The DLV system for knowledge representation and reasoning

Author:

Leone Nicola1,Pfeifer Gerald2,Faber Wolfgang2,Eiter Thomas2,Gottlob Georg2,Perri Simona1,Scarcello Francesco1

Affiliation:

1. University of Calabria, Rende (CS), Italy

2. Technische Universität Wien, Vienna, Austria

Abstract

Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows one to express every property of finite structures that is decidable in the complexity class Σ P 2 (NP NP ). Thus, under widely believed assumptions, DLP is strictly more expressive than normal ( disjunction-free ) logic programming, whose expressiveness is limited to properties decidable in NP. Importantly, apart from enlarging the class of applications which can be encoded in the language, disjunction often allows for representing problems of lower complexity in a simpler and more natural fashion.This article presents the DLV system, which is widely considered the state-of-the-art implementation of disjunctive logic programming, and addresses several aspects. As for problem solving, we provide a formal definition of its kernel language, function-free disjunctive logic programs (also known as disjunctive datalog ), extended by weak constraints, which are a powerful tool to express optimization problems. We then illustrate the usage of DLV as a tool for knowledge representation and reasoning, describing a new declarative programming methodology which allows one to encode complex problems (up to Δ P 3 -complete problems) in a declarative fashion. On the foundational side, we provide a detailed analysis of the computational complexity of the language of DLV, and by deriving new complexity results we chart a complete picture of the complexity of this language and important fragments thereof.Furthermore, we illustrate the general architecture of the DLV system, which has been influenced by these results. As for applications, we overview application front-ends which have been developed on top of DLV to solve specific knowledge representation tasks, and we briefly describe the main international projects investigating the potential of the system for industrial exploitation. Finally, we report about thorough experimentation and benchmarking, which has been carried out to assess the efficiency of the system. The experimental results confirm the solidity of DLV and highlight its potential for emerging application areas like knowledge management and information integration.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Reference105 articles.

1. Logic programming and negation: A survey

2. Apt K. R. Blair H. A. and Walker A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker Ed. Morgan Kaufmann San Francisco CA 89--148.]] Apt K. R. Blair H. A. and Walker A. 1988. Towards a theory of declarative knowledge. In Foundations of Deductive Databases and Logic Programming J. Minker Ed. Morgan Kaufmann San Francisco CA 89--148.]]

3. Dislop: A research project on disjunctive logic programming;Aravindan C.;AI Commun. Europ. J. Artific. Intell.,1997

4. Babovich Y. 2002. Cmodels homepage. http://www.cs.utexas.edu/users/tag/cmodels.html.]] Babovich Y. 2002. Cmodels homepage. http://www.cs.utexas.edu/users/tag/cmodels.html.]]

Cited by 653 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. ASPECT: Answer Set rePresentation as vEctor graphiCs in laTex;Journal of Logic and Computation;2024-09-03

2. An ASP Implementation of Defeasible Deontic Logic;KI - Künstliche Intelligenz;2024-07-20

3. Design and implementation of modern CDCL ASP solvers;Intelligenza Artificiale;2024-05-25

4. A Model-Based Systems Engineering Plugin for Cloud Security Architecture Design;SN Computer Science;2024-05-16

5. Ontology-Mediated Query Answering Using Graph Patterns with Conditions;2024 IEEE 40th International Conference on Data Engineering (ICDE);2024-05-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3