Hex semantics via approximation fixpoint theory

DOI10.1007/978-3-642-40564-8_11MaRDI QIDQ2851236zbMATH OpenOpenAlexFDO

Authors Christian Antić, Thomas Eiter, Michael Fink

Publication date 10 October 2013

Published in Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40564-8_11

Mathematics Subject Classification ID

Logic programming (68N17) Semantics in the theory of computing (68Q55)

Recommendations

• 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
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Fixpoint semantics for logic programming a survey

Cited in

(13)

• Efficient HEX-Program Evaluation Based on Unfounded Sets
• Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
• Knowledge compilation of logic programs using approximation fixpoint theory
• Safe inductions and their applications in knowledge representation
• Fixpoint semantics for active integrity constraints
• Flexible approximators for approximating fixpoint theory
• On well-founded set-inductions and locally monotone operators
• A hierarchical approach to computer Hex
• Fixed point semantics for stream reasoning
• Grounded fixpoints and their applications in knowledge representation
• Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
• Categorical approximation fixpoint theory

This page was built for publication: Hex semantics via approximation fixpoint theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851236)