Strong Equivalence of Logic Programs with Counting

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

Theory and Practice of Logic Programming Pub Date : 2022-05-16 DOI:10.1017/S1471068422000278

V. Lifschitz

引用次数: 2

Abstract

Abstract In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. In some cases, strong equivalence of programs in the input language of the grounder gringo can be established by deriving rules of each program from rules of the other. The possibility of such proofs has been demonstrated for a subset of that language that includes comparisons, arithmetic operations, and simple choice rules, but not aggregates. This method is extended here to a class of programs in which some uses of the #count aggregate are allowed.

查看原文本刊更多论文

具有计数的逻辑程序的强等价性

摘要在答案集规划中，如果两组规则在任何上下文中具有相同的意义，则认为它们是强等价的。在某些情况下，可以通过从一个程序的规则推导出另一个程序的规则来建立地面外国佬输入语言中程序的强等价性。这种证明的可能性已经在该语言的一个子集中得到了证明，该子集包括比较、算术运算和简单的选择规则，但不包括聚合。此方法在这里被扩展到一类允许使用#count聚合的程序。

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

求助全文

约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.