The mathematics of inheritance systems
The mathematics of inheritance systems
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Logic programs with exceptions
Logic programming
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
Journal of the ACM (JACM)
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Handbook of logic in artificial intelligence and logic programming (vol. 3)
The acceptability semantics for logic programs
Proceedings of the eleventh international conference on Logic programming
Well-founded semantics and stratification for ordered logic programs
New Generation Computing
Disjunctive stable models: unfounded sets, fixpoint semantics, and computation
Information and Computation
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
ACM Transactions on Database Systems (TODS)
Abduction from logic program: semantics and complexity
Theoretical Computer Science
Answer sets for prioritized logic programs
ILPS '97 Proceedings of the 1997 international symposium on Logic programming
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
A Deductive Environment for Dealing with Objects and Nonmonotonic Reasoning
IEEE Transactions on Knowledge and Data Engineering
Reasoning with Prioritized Defaults
LPKR '97 Selected papers from the Third International Workshop on Logic Programming and Knowledge Representation
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Well-founded semantics for extended logic programs with dynamic preferences
Journal of Artificial Intelligence Research
A Classification Theory Of Semantics Of Normal Logic Programs: I. Strong Properties
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Multiagent Compromises, Joint Fixpoints, and Stable Models
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Multi-dimensional Dynamic Knowledge Representation
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Computing preferred answer sets by meta-interpretation in Answer Set Programming
Theory and Practice of Logic Programming
Disjunctive logic programs with inheritance
Theory and Practice of Logic Programming
Using methods of declarative logic programming for intelligent information agents
Theory and Practice of Logic Programming
| Hi-index | 0.00 |
The paper proposes a knowledge representation language which extends logic programming with disjunction, inheritance, true negation and modularization. The resulting language is called Disjunctive Ordered Logic (\mathcal{DOL} for short). A model‐theoretic semantics for \mathcal{DOL} is given, and it is shown to extend the stable model semantics of disjunctive logic programs. A number of examples show the suitability of \mathcal{DOL} for knowledge representation and commonsense reasoning. Among other things, the proposed language appears to be a powerful tool for the description of diagnostic processes which are based on stepwise refinements. The complexity and the expressiveness of the language are carefully analyzed. The analysis pays particular attention to the relative power and complexity of inheritance, negation and disjunction. An interesting result in this course concerns the role played by inheritance. Indeed, our results show that inheritance does not increase at all the complexity of any fragment of the language, while it does increase the expressive power of some \mathcal{DOL} fragments.