Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
From MaRDI portal
Publication:2900518
DOI10.1007/978-3-642-30743-0_13zbMath1357.68031OpenAlexW2100577610MaRDI QIDQ2900518
Marc Denecker, Joost Vennekens, Maurice Bruynooghe
Publication date: 23 July 2012
Published in: Correct Reasoning (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/350619
Related Items (8)
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ On dual programs in co-logic programming and the Horn \({\mu}\)-calculus ⋮ Approximation Fixpoint Theory and the Well-Founded Semantics of Higher-Order Logic Programs ⋮ An analysis of the equational properties of the well-founded fixed point ⋮ The intricacies of three-valued extensional semantics for higher-order logic programs ⋮ Fixpoint semantics for active integrity constraints ⋮ On Dual Programs in Co-Logic Programming ⋮ Fixed point semantics for stream reasoning
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- Equilibrium logic
- Fixpoint semantics for logic programming a survey
- Uniform semantic treatment of default and autoepistemic logics
- Well-founded and stable semantics of logic programs with aggregates
- Modularity Aspects of Disjunctive Stable Models
- Toward useful type-free theories. I
- A kripke-kleene semantics for logic programs*
- The well-founded semantics for general logic programs
- Strongly equivalent logic programs
This page was built for publication: Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
