Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
From MaRDI portal
Recommendations
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Approximation logic of programs
- Fixpoint semantics for logic programming a survey
- Answer set programming in intuitionistic logic
- scientific article; zbMATH DE number 19156
- scientific article; zbMATH DE number 2242586
- A characterization of answer sets for logic programs
- Fixed-parameter complexity of semantics for logic programs
- scientific article; zbMATH DE number 2085278
Cites work
- A kripke-kleene semantics for logic programs*
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Discovering classes of strongly equivalent logic programs
- Equilibrium logic
- Fixpoint semantics for logic programming a survey
- scientific article; zbMATH DE number 4160107 (Why is no real title available?)
- scientific article; zbMATH DE number 1926645 (Why is no real title available?)
- scientific article; zbMATH DE number 3073037 (Why is no real title available?)
- Modularity aspects of disjunctive stable models
- Predicate introduction for logics with a fixpoint semantics. I: Logic programming
- Strongly equivalent logic programs
- The alternating fixpoint of logic programs with negation
- The well-founded semantics for general logic programs
- Toward useful type-free theories. I
- Uniform semantic treatment of default and autoepistemic logics
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(25)- Fixpoint semantics for active integrity constraints
- Equivalence between answer-set programs under (partially) fixed input
- Fixed point semantics for stream reasoning
- On dual programs in co-logic programming and the Horn \({\mu}\)-calculus
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input
- Flexible approximators for approximating fixpoint theory
- Hex semantics via approximation fixpoint theory
- scientific article; zbMATH DE number 1824109 (Why is no real title available?)
- An analysis of the equational properties of the well-founded fixed point
- Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
- The intricacies of three-valued extensional semantics for higher-order logic programs
- Knowledge compilation of logic programs using approximation fixpoint theory
- scientific article; zbMATH DE number 2085279 (Why is no real title available?)
- Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- On well-founded set-inductions and locally monotone operators
- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
- On dual programs in co-logic programming
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
- Categorical approximation fixpoint theory
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Embedding justification theory in approximation fixpoint theory
- Grounded fixpoints and their applications in knowledge representation
This page was built for publication: Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900518)
