Academia.edu no longer supports Internet Explorer.
To browse Academia.edu and the wider internet faster and more securely, please take a few seconds to upgrade your browser.
2008
…
14 pages
1 file
This paper provides an introduction to knowledge representation using OntoDLP, a formalism which combines the full computational power of Disjunctive Logic Programming (DLP) with suitable abstraction mechanisms for the representation of complex objects and default reasoning. The paper does not provide a formal definition of the language, rather it is intended as an informal presentation of its main features.
Agp, 2003
This paper is a presentation of ONTO-DLP, an extension of Disjunctive Logic Programming (DLP) for complex knowledge modelling. ONTO-DLP enhances DLP by constructs coming from other knowledge representation formalisms, namely, Complex-Datalog and Ordered Logic. The former provides suitable abstraction mechanisms for complex objects handling, while the latter provides support for default reasoning. Such features make ONTO-DLV a powerful language for ontology specification and reasoning.
1994
Abstract In this paper, we review recent work aimed at the application of declarative logic programming to knowledge representation in artificial intelligence. We consider extensions of the language of definite logic programs by classical (strong) negation, disjunction, and some modal operators and show how each of the added features extends the representational power of the language.
2006
Disjunctive Logic Programming is nowadays a mature formalism which has been successfully applied to a variety of practical problems, such as information integration, knowledge representation, planning, diagnosis, optimization and configuration. Although current DLP systems have been extended in many directions, they still miss features which may be helpful towards industrial applications, like the capability of quickly introducing new predefined constructs or of dealing with modules.
ACM Transactions on Computational Logic, 2006
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows 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.
Journal of Applied Logic, 2007
The paper presents DLV + , a Disjunctive Logic Programming (DLP) system with object-oriented constructs, including classes, objects, (multiple) inheritance, and types. DLV + is built on top of DLV (a state-of-the art DLP system), and provides a graphical user interface that allows one to specify, update, browse, query, and reason on knowledge bases. Two strong points of the system are the powerful type-checking mechanism and the advanced interface for visual querying.
1997
This paper gives a brief high-level description of what has been done in the Disjunctive Logic Programming-project (funded by Deutsche Forschungs-Gemeinschaft), undertaken by the University of Koblenz since July 1995. We present the main ideas, cite the relevant papers and point to the implemented systems and how to access them. This paper also serves as a brief survey of the current status of disjunctive logic programming by highlighting important developments and providing enough pointers for further reading.
Theory and Practice of Logic Programming, 2002
The paper proposes a new knowledge representation language, called DLP < , which extends disjunctive logic programming (with strong negation) by inheritance. The addition of inheritance enhances the knowledge modeling features of the language providing a natural representation of default reasoning with exceptions. A declarative model-theoretic semantics of DLP < is provided, which is shown to generalize the Answer Set Semantics of disjunctive logic programs. The knowledge modeling features of the language are illustrated by encoding classical nonmonotonic problems in DLP < . The complexity of DLP < is analyzed, proving that inheritance does not cause any computational overhead, as reasoning in DLP < has exactly the same complexity as reasoning in disjunctive logic programming. This is confirmed by the existence of an efficient translation from DLP < to plain disjunctive logic programming. Using this translation, an advanced KR system supporting the DLP < language has been implemented on top of the DLV system and has subsequently been integrated into DLV.
2006
Abstract Humans have always been intrigued by their ability to reason. We have constantly attempted to emulate this process, trying almost everything, from physiological explanations, to sociological accounts. The approach with possibly the longest tradition conceives this process as a mere manipulation of symbols.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
Internet: http://www8. informatik. unierlangen. …, 2007