Foundations of logic programming
Foundations of logic programming
Journal of Logic Programming
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Negation as failure using tight derivations for general logic programs
Foundations of deductive databases and logic programming
On the declarative semantics of deductive databases and logic programs
Foundations of deductive databases and logic programming
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Weakly stratified logic programs
Fundamenta Informaticae - Special issue on LOGIC PROGRAMMING
Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
Bilattices and the semantics of logic programming
Journal of Logic Programming
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Acyclic logic programs and the completeness of SLDNF-resolution
Theoretical Computer Science
Reasoning about termination of pure Prolog programs
Information and Computation
General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
Mathematical theory of domains
Mathematical theory of domains
Handbook of logic in computer science (vol. 3)
Quasi-metrics and the semantics of logic programs
Fundamenta Informaticae
Artificial Intelligence
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Answer set programming and plan generation
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Paraconsistent Declarative Semantics for Extended Logic Programs
Annals of Mathematics and Artificial Intelligence
Approximating the Semantics of Logic Programs by Recurrent Neural Networks
Applied Intelligence
Loop Checking and the Wll-Founded Semantics
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
A Deductive System for Non-Monotonic Reasoning
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
The Well-Founded Semantics Is a Stratified Fitting Semantics
KI '02 Proceedings of the 25th Annual German Conference on AI: Advances in Artificial Intelligence
Generalized metrics and uniquely determined logic programs
Theoretical Computer Science - Topology in computer science
Classes of terminating logic programs
Theory and Practice of Logic Programming
Order-consistent programs are cautiously monotonic
Theory and Practice of Logic Programming
A note on the relationships between logic programs and neural networks
IW-FM'00 Proceedings of the 4th Irish conference on Formal Methods
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
Topology And The Semantics Of Logic Programs
Fundamenta Informaticae
On the Semantics of Trust and Caching in the Semantic Web
ISWC '08 Proceedings of the 7th International Conference on The Semantic Web
A Coherent Well-founded Model for Hybrid MKNF Knowledge Bases
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Answer sets for logic programs with arbitrary abstract constraint atoms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Layer Supported Models of Logic Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
Decidability under the well-founded semantics
RR'07 Proceedings of the 1st international conference on Web reasoning and rule systems
Local closed world reasoning with description logics under the well-founded semantics
Artificial Intelligence
Resolution-Based approximate reasoning for OWL DL
ISWC'05 Proceedings of the 4th international conference on The Semantic Web
The well supported semantics for multidimensional dynamic logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Hi-index | 0.00 |
Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more successful and acknowledged than others. The rationales behind those various semantics have been manifold, depending on one's point of view, which may be that of a programmer or inspired by commonsense reasoning, and consequently the constructions which lead to these semantics are technically very diverse, and the exact relationships between them have not yet been fully understood. In this paper, we present a conceptually new method, based on level mappings, which allows to provide uniform characterizations of different semantics for logic programs. We will display our approach by giving new and uniform characterizations of some of the major semantics, more particular of the least model semantics for definite programs, of the Fitting semantics, and of the well-founded semantics. A novel characterization of the weakly perfect model semantics will also be provided.