Ultimate approximation and its application in nonmonotonic knowledge representation systems
From MaRDI portal
Publication:598245
DOI10.1016/j.ic.2004.02.004zbMath1074.68069OpenAlexW2145648043MaRDI QIDQ598245
Victor W. Marek, Marc Denecker, Miroslaw Truszczynski
Publication date: 6 August 2004
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2004.02.004
Related Items (24)
On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory ⋮ A Formal Theory of Justifications ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Safe inductions and their applications in knowledge representation ⋮ 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 ⋮ Three-valued semantics for hybrid MKNF knowledge bases revisited ⋮ Equational Properties of Stratified Least Fixed Points (Extended Abstract) ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Well-founded operators for normal hybrid MKNF knowledge bases ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Fixpoint semantics for active integrity constraints ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Unnamed Item ⋮ Approximating operators and semantics for abstract dialectical frameworks ⋮ A fixed point theorem for non-monotonic functions ⋮ A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence ⋮ Judgment Aggregation in Abstract Dialectical Frameworks ⋮ Fixed point semantics for stream reasoning ⋮ Flexible Approximators for Approximating Fixpoint Theory ⋮ BOOLEAN FUZZY SETS ⋮ Approximation Schemes in Logic and Artificial Intelligence
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The alternating fixpoint of logic programs with negation
- On the relation between default and autoepistemic logic
- A logic for default reasoning
- Chain-complete posets and directed sets with applications
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Fixpoint semantics for logic programming a survey
- Uniform semantic treatment of default and autoepistemic logics
- A lattice-theoretical fixpoint theorem and its applications
- A kripke-kleene semantics for logic programs*
- Negation in logic programming
- Contributions to the Theory of Logic Programming
- Bilattices and the semantics of logic programming
- The Semantics of Predicate Logic as a Programming Language
- Autoepistemic logic
- The well-founded semantics for general logic programs
- Logic programming revisited
This page was built for publication: Ultimate approximation and its application in nonmonotonic knowledge representation systems
