Well-founded semantics coincides with three-valued stable semantics
Fundamenta Informaticae
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Fixpoint semantics for logic programming a survey
Theoretical Computer Science
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Annals of Mathematics and Artificial Intelligence
Well-founded and stable semantics of logic programs with aggregates
Theory and Practice of Logic Programming
Predicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming
Fundamenta Informaticae
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Discovering classes of strongly equivalent logic programs
Journal of Artificial Intelligence Research
Modularity aspects of disjunctive stable models
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Approximation Fixpoint Theory was developed as a fixpoint theory of lattice operators that provides a uniform formalization of four main semantics of three major nonmonotonic reasoning formalisms. This paper clarifies how this fixpoint theory can define the stable and well-founded semantics of logic programs. It investigates the notion of strong equivalence underlying this semantics. It also shows the remarkable power of this theory for defining natural and elegant versions of these semantics for extensions of logic and answer set programs. In particular, we here consider extensions with general rule bodies, general interpretations (also non-Herbrand interpretations) and aggregates. We also investigate the relationship with the equilibrium semantics of nested answer set programs, on the formal and the informal level.