Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-30743-0_13 | Correct Reasoning |
Keywords | Field | DocType |
approximation fixpoint theory,main semantics,fixpoint theory,well-founded semantics,general rule body,elegant version,nested answer set program,general interpretation,logic program,equilibrium semantics | Proof-theoretic semantics,Formal semantics (linguistics),Modal μ-calculus,Discrete mathematics,Operational semantics,Axiomatic semantics,Denotational semantics,Stable model semantics,Well-founded semantics,Calculus,Mathematics | Conference |
Citations | PageRank | References |
4 | 0.41 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marc Denecker | 1 | 1626 | 106.40 |
| Maurice Bruynooghe | 2 | 2767 | 226.05 |
| Joost Vennekens | 3 | 434 | 37.36 |