Ultimate approximation and its application in nonmonotonic knowledge representation systems
From MaRDI portal
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
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 1301742 (Why is no real title available?)
- scientific article; zbMATH DE number 2085279 (Why is no real title available?)
- scientific article; zbMATH DE number 1390354 (Why is no real title available?)
- A kripke-kleene semantics for logic programs*
- A lattice-theoretical fixpoint theorem and its applications
- A logic for default reasoning
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Autoepistemic logic
- Bilattices and the semantics of logic programming
- Chain-complete posets and directed sets with applications
- Contributions to the Theory of Logic Programming
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Fixpoint semantics for logic programming a survey
- Logic programming revisited: logic programs as inductive definitions
- Negation in logic programming
- On the relation between default and autoepistemic logic
- The Semantics of Predicate Logic as a Programming Language
- The alternating fixpoint of logic programs with negation
- The well-founded semantics for general logic programs
- Uniform semantic treatment of default and autoepistemic logics
Cited in
(29)- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Fixed point semantics for stream reasoning
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Flexible approximators for approximating fixpoint theory
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Categorical approximation fixpoint theory
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Equational properties of stratified least fixed points (extended abstract)
- On well-founded set-inductions and locally monotone operators
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- An analysis of the equational properties of the well-founded fixed point
- A fixpoint characterization of three-valued disjunctive hybrid MKNF knowledge bases
- Fixpoint semantics for recursive \textsc{shacl}
- Approximation Schemes in Logic and Artificial Intelligence
- Knowledge compilation of logic programs using approximation fixpoint theory
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Safe inductions and their applications in knowledge representation
- Three-valued semantics for hybrid MKNF knowledge bases revisited
- A fixed point theorem for non-monotonic functions
- Approximating operators and semantics for abstract dialectical frameworks
- A formal theory of justifications
- BOOLEAN FUZZY SETS
- Well-supported semantics for logic programs with generalized rules
- Embedding justification theory in approximation fixpoint theory
- Judgment aggregation in abstract dialectical frameworks
- Well-founded operators for normal hybrid MKNF knowledge bases
- Grounded fixpoints and their applications in knowledge representation
- Fixpoint semantics for active integrity constraints
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)
