Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

IF 1.4 2区数学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Theory and Practice of Logic Programming Pub Date : 2023-07-01 DOI:10.1017/s1471068423000236

JESSE HEYNINCK, BART BOGAERTS

引用次数: 0

Abstract

Abstract 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, that is, operators whose range are sets of elements rather than single elements. In this paper, we make three further contributions to non-deterministic AFT: (1) we define and study ultimate approximations of non-deterministic operators, (2) we give an algebraic formulation of the semi-equilibrium semantics by Amendola et al ., and (3) we generalize the characterizations of disjunctive logic programs to disjunctive logic programs with aggregates.

查看原文本刊更多论文

非确定性近似算子:极限算子、半平衡语义和聚合

逼近不动点理论(AFT)是研究非单调逻辑语义的一个抽象的、通用的代数框架。在最近的工作中，AFT被推广到非确定性算子，即范围是元素集合而不是单个元素的算子。在本文中，我们对非确定性AFT作了三个进一步的贡献:(1)我们定义并研究了非确定性算子的极限逼近;(2)我们给出了Amendola等人的半平衡语义的代数表述;(3)我们将析取逻辑规划的特征推广到具有聚集的析取逻辑规划。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theory and Practice of Logic Programming 工程技术-计算机：理论方法

CiteScore

4.50

自引率

21.40%

发文量

审稿时长

>12 weeks

期刊介绍： Theory and Practice of Logic Programming emphasises both the theory and practice of logic programming. Logic programming applies to all areas of artificial intelligence and computer science and is fundamental to them. Among the topics covered are AI applications that use logic programming, logic programming methodologies, specification, analysis and verification of systems, inductive logic programming, multi-relational data mining, natural language processing, knowledge representation, non-monotonic reasoning, semantic web reasoning, databases, implementations and architectures and constraint logic programming.