Approximation Fixpoint Theory for Non-Deterministic Operators and Its Application in Disjunctive Logic Programming

Heyninck, Jesse and Arieli, Ofer (2021) Approximation Fixpoint Theory for Non-Deterministic Operators and Its Application in Disjunctive Logic Programming, Proceedings of 18th International Conference on Principles of Knowledge Representation and Reasoning, 18, 334-344, International Joint Conferences on Artificial Intelligence Organization.

Text kr2021-0032-heyninck-et-al.pdf - Published Version Download (240kB)

Abstract

Approximation fixpoint theory (AFT) constitutes 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 non-deterministic constructs such as disjunctive information. This is done by generalizing the main constructions and corresponding results 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.

Item Type:	Conference paper
Subjects:	Computing methodologies > Artificial intelligence > Knowledge representation and reasoning > Logic programming and answer set programming
Date Deposited:	03 Dec 2021 11:36
Last Modified:	03 Dec 2021 11:36
URI:	https://pubs.cs.uct.ac.za/id/eprint/1509

Actions (login required)

View Item