Journal of Logic Programming
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Foundations of deductive databases and logic programming
Foundations of deductive databases and logic programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
A completeness theorem for SLDNF resolution
Journal of Logic Programming
General theory of cumulative inference
Proceedings of the 2nd international workshop on Non-monotonic reasoning
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Generalized well-founded semantics for logic programs
CADE-10 Proceedings of the tenth international conference on Automated deduction
Negation by default and unstratifiable logic programs
Selected papers of the workshop on Deductive database theory
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
JELIA '90 Proceedings of the European workshop on Logics in AI
Three-valued formalizations of non-monotonic reasoning and logic programming
Proceedings of the first international conference on Principles of knowledge representation and reasoning
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
What does a conditional knowledge base entail?
Artificial Intelligence
Journal of Logic Programming
General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Adding closed world assumptions to well-founded semantics
FGCS'921 Selected papers of the conference on Fifth generation computer systems
Three-valued formalization of logic programming: is it needed?
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unfounded sets and well-founded semantics for general logic programs
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Partial Evaluation and Relevance for Approximations of Stable Semantics
ISMIS '94 Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems
The Strong Semantics for Logic Programs
ISMIS '91 Proceedings of the 6th International Symposium on Methodologies for Intelligent Systems
The Stable Semantics and its Variants: A Comparison of Recent Approaches
KI '94 Proceedings of the 18th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Cumulativity and Rationality in Semantics of Normal Logic Programs
Proceedings of the 1st International Workshop on Nonmonotonic and Inductive Logic
Cumulative Inference Relations for JTMS and Logic Programming
Proceedings of the 1st International Workshop on Nonmonotonic and Inductive Logic
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Logic knowledge bases with two default rules
Annals of Mathematics and Artificial Intelligence
Semantics and expressiveness of disjunctive ordered logic
Annals of Mathematics and Artificial Intelligence
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
Journal of Automated Reasoning
Integrating the Completion and the Well Founded Semantics
IBERAMIA '98 Proceedings of the 6th Ibero-American Conference on AI: Progress in Artificial Intelligence
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Transformation-based bottom-up computation of the well-founded model
Theory and Practice of Logic Programming
A uniform approach to logic programming semantics
Theory and Practice of Logic Programming
On the existence of stable models of non-stratified logic programs
Theory and Practice of Logic Programming
DisLoP: a research project on Disjunctive Logic Programming
AI Communications
Annals of Mathematics and Artificial Intelligence
Logic-based knowledge representation
Artificial intelligence today
Towards closed world reasoning in dynamic open worlds
Theory and Practice of Logic Programming
On Semantic Update Operators for Answer-Set Programs
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Conditional learning of rules and plans by knowledge exchange in logical agents
RuleML'2011 Proceedings of the 5th international conference on Rule-based reasoning, programming, and applications
Fundamenta Informaticae - Logic, Language, Information and Computation
A Possibilistic Argumentation Decision Making Framework with Default Reasoning
Fundamenta Informaticae - Latin American Workshop on Logic Languages, Algorithms and New Methods of Reasoning (LANMR)
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
Fundamenta Informaticae
A Classification Theory Of Semantics Of Normal Logic Programs: Ii. Weak Properties
Fundamenta Informaticae
Relative expressiveness of defeasible logics
Theory and Practice of Logic Programming
Hi-index | 0.00 |
Our aim in this article is to present a method for classifying and characterizing the various different semantics of logic programs with negation that have been considered in the last years. Instead of appealing to more or less questionable intuitions, we take a more structural view: our starting point is the observation that all semantics induce in a natural way non-monotonic entailment relations “ |˜ ”. The novel idea of our approach is to ask for the properties of these |˜ -relations and to use them for describing all possible semantics. The main properties discussed in this paper are adaptations of rules that play a fundamental rôle in general non-monotonic reasoning: Cumulativity and Rationality. They were introduced and investigated by Gabbay, Kraus, Lehmann, Magidor and Makinson. We show that the 3-valued version COMP 3 of Clark's completion, the stratified semantics M supp P as well as the well-founded semantics WFS and two extensions of it behave very regular: they are cumulative, rational and one of them is even supraclassical. While Pereira's recently proposed semantics O-SEM is not rational it is still cumulative. Cumulativity fails for the regular semantics REG-SEM of You/Yuan (recently shown to be equivalent to three other proposals). In a second article we will supplement these strong rules with a set of weak rules and consider the problem of uniquely describing a given semantics by its strong and weak properties together.