Grounded fixpoints and their applications in knowledge representation
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
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- On well-founded set-inductions and locally monotone operators
- Fixpoint semantics for logic programming a survey
Cites work
- scientific article; zbMATH DE number 4158606 (Why is no real title available?)
- scientific article; zbMATH DE number 3930375 (Why is no real title available?)
- A logic for default reasoning
- A logic of nonmonotone inductive definitions
- All I know: A study in autoepistemic logic
- Approximating operators and semantics for abstract dialectical frameworks
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Datalog extensions for database queries and updates
- Dualities between alternative semantics for logic programming and nonmonotonic reasoning
- Fixpoint semantics for logic programming a survey
- Hex semantics via approximation fixpoint theory
- Logic Programming and Nonmonotonic Reasoning
- Logic programs with monotone abstract constraint atoms
- Non-monotonic logic. I
- Nonmonotonic Logic II
- On notation for ordinal numbers
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the relation between default and autoepistemic logic
- Reiter's default logic is a logic of autoepistemic reasoning and a good one, too
- Semantical considerations on nonmonotonic logic
- Semantics and complexity of recursive aggregates in answer set programming
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- The Semantics of Predicate Logic as a Programming Language
- The well-founded semantics for general logic programs
- Translating default logic into standard autoepistemic logic
- Twelve Definitions of a Stable Model
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Uniform semantic treatment of default and autoepistemic logics
- Vicious circle principle and logic programs with aggregates
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(15)- Embedding justification theory in approximation fixpoint theory
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Fixpoint semantics for recursive \textsc{shacl}
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Approximation fixpoint theory in Coq. With an application to logic programming
- Safe inductions and their applications in knowledge representation
- Fixpoint semantics for active integrity constraints
- Flexible approximators for approximating fixpoint theory
- Active integrity constraints for general-purpose knowledge bases
- On well-founded set-inductions and locally monotone operators
- Fixed point semantics for stream reasoning
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Grounded fixpoints and active integrity constraints
This page was built for publication: Grounded fixpoints and their applications in knowledge representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q892232)
