Non-Deterministic Approximation Fixpoint Theory and Its Application in Disjunctive Logic Programming
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of nonmonotonic logics. It provides a unifying study of the semantics of different formalisms for nonmonotonic reasoning, such as logic programming, default logic and autoepistemic logic. In this paper, we extend AFT to dealing with non-deterministic constructs that allow to handle indefinite information, represented e.g. by disjunctive formulas. This is done by generalizing the main constructions and corresponding results of AFT to non-deterministic operators, whose ranges are sets of elements rather than single elements. The applicability and usefulness of this generalization is illustrated in the context of disjunctive logic programming.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, i.e.\ operators w…
A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
The logic of hybrid MKNF (minimal knowledge and negation as failure) is a powerful knowledge representation language that elegantly pairs ASP (answer set programming) with ontologies. Disjunctive rules are a desirable ex…
NegationApproximation Fixpoint Theory with Refined Approximation Spaces
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics o…
Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled. This paper revisits it from the viewp…
Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT
Approximation fixpoint theory (AFT) provides an algebraic framework for the study of fixpoints of operators on bilattices and has found its applications in characterizing semantics for various classes of logic programs a…