Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
From MaRDI portal
Recommendations
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- Overview of an abstract fixed point theory for non-monotonic functions and its applications to logic programming
Cites work
- A compositional typed higher-order logic with definitions
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- A remark on method in transfinite algebra
- A three-valued semantics for deductive databases and logic programs
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Approximating operators and semantics for abstract dialectical frameworks
- Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Bilattices and the semantics of logic programming
- Bottom-up computation of perfect models for disjunctive theories
- Characterizations of the stable semantics by partial evaluation
- Computing ideal sceptical argumentation
- Constructive versions of Tarski's fixed point theorems
- Defaulting on Reasons
- Equilibrium logic
- Fixpoint semantics for active integrity constraints
- Fixpoint semantics for recursive \textsc{shacl}
- Forgetting auxiliary atoms in forks
- Grounded fixpoints and their applications in knowledge representation
- Hex semantics via approximation fixpoint theory
- scientific article; zbMATH DE number 3648682 (Why is no real title available?)
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 5510996 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 140388 (Why is no real title available?)
- scientific article; zbMATH DE number 3635472 (Why is no real title available?)
- scientific article; zbMATH DE number 1926616 (Why is no real title available?)
- scientific article; zbMATH DE number 7299857 (Why is no real title available?)
- Logic Programming
- On the partial semantics for disjunctive deductive databases
- Paraconsistent Stable Semantics for Extended Disjunctive Programs
- Partial equilibrium logic
- Reasoning with logical bilattices
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Safe inductions and their applications in knowledge representation
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
- The Semantics of Predicate Logic as a Programming Language
- Une méthode d'élimination des nombres transfinis des raisonnements mathématiques.
- Uniform semantic treatment of default and autoepistemic logics
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(2)
This page was built for publication: Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6566627)
