
arXiv: 2211.17262
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.
FOS: Computer and information sciences, Technology, Logic Programming, Computer Science - Artificial Intelligence, 1702 Cognitive Sciences, Semantics in the theory of computing, Knowledge Representation, Approximation Fixpoint Theory, Logic programming, Computer Science, Artificial Intelligence, logic programming, 4611 Machine learning, 0801 Artificial Intelligence and Image Processing, Artificial Intelligence & Image Processing, 0802 Computation Theory and Mathematics, Logic in artificial intelligence, approximation fixpoint theory, COMPLEXITY, Science & Technology, Answer Set Programming, 4602 Artificial intelligence, knowledge representation, answer-set programming, 4603 Computer vision and multimedia computation, Artificial Intelligence (cs.AI), STABLE SEMANTICS, Knowledge representation, Computer Science, WELL-FOUNDED SEMANTICS
FOS: Computer and information sciences, Technology, Logic Programming, Computer Science - Artificial Intelligence, 1702 Cognitive Sciences, Semantics in the theory of computing, Knowledge Representation, Approximation Fixpoint Theory, Logic programming, Computer Science, Artificial Intelligence, logic programming, 4611 Machine learning, 0801 Artificial Intelligence and Image Processing, Artificial Intelligence & Image Processing, 0802 Computation Theory and Mathematics, Logic in artificial intelligence, approximation fixpoint theory, COMPLEXITY, Science & Technology, Answer Set Programming, 4602 Artificial intelligence, knowledge representation, answer-set programming, 4603 Computer vision and multimedia computation, Artificial Intelligence (cs.AI), STABLE SEMANTICS, Knowledge representation, Computer Science, WELL-FOUNDED SEMANTICS
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
