Ultimate approximation and its application in nonmonotonic knowledge representation systems
From MaRDI portal
Publication:598245
DOI10.1016/J.IC.2004.02.004zbMATH Open1074.68069OpenAlexW2145648043MaRDI QIDQ598245FDOQ598245
Authors: Marc Denecker, Wiktor Marek, Mirosław Truszczyński 
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
Recommendations
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Flexible approximators for approximating fixpoint theory
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Grounded fixpoints and their applications in knowledge representation
Cites Work
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- The well-founded semantics for general logic programs
- The alternating fixpoint of logic programs with negation
- A lattice-theoretical fixpoint theorem and its applications
- Chain-complete posets and directed sets with applications
- The Semantics of Predicate Logic as a Programming Language
- Autoepistemic logic
- Bilattices and the semantics of logic programming
- A logic for default reasoning
- A kripke-kleene semantics for logic programs*
- Fixpoint semantics for logic programming a survey
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Negation in logic programming
- Contributions to the Theory of Logic Programming
- On the relation between default and autoepistemic logic
- Uniform semantic treatment of default and autoepistemic logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic programming revisited
Cited In (28)
- Embedding justification theory in approximation fixpoint theory
- Fixpoint semantics for recursive \textsc{shacl}
- A fixed point theorem for non-monotonic functions
- On Well-Founded Set-Inductions and Locally Monotone Operators
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Title not available (Why is that?)
- Equational Properties of Stratified Least Fixed Points (Extended Abstract)
- A Formal Theory of Justifications
- Knowledge compilation of logic programs using approximation fixpoint theory
- Safe inductions and their applications in knowledge representation
- Fixpoint semantics for active integrity constraints
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Fixed point semantics for stream reasoning
- Approximation Schemes in Logic and Artificial Intelligence
- Grounded fixpoints and their applications in knowledge representation
- Judgment Aggregation in Abstract Dialectical Frameworks
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- BOOLEAN FUZZY SETS
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence
- 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
- Flexible Approximators for Approximating Fixpoint Theory
- Approximating operators and semantics for abstract dialectical frameworks
- Well-supported semantics for logic programs with generalized rules
- Categorical approximation fixpoint theory
- Well-founded operators for normal hybrid MKNF knowledge bases
This page was built for publication: Ultimate approximation and its application in nonmonotonic knowledge representation systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q598245)
