On Program Completion, with an Application to the Sum and Product Puzzle

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

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

VLADIMIR LIFSCHITZ

引用次数: 0

Abstract

Abstract This paper describes a generalization of Clark’s completion that is applicable to logic programs containing arithmetic operations and produces syntactically simple, natural looking formulas. If a set of first-order axioms is equivalent to the completion of a program, then we may be able to find standard models of these axioms by running an answer set solver. As an example, we apply this “reverse completion” procedure to the Sum and Product Puzzle.

查看原文本刊更多论文

论程序完成，并应用于和与积难题

本文描述了Clark补全的一种推广，它适用于包含算术运算的逻辑程序，并产生语法简单、看起来自然的公式。如果一组一阶公理等价于一个程序的完成，那么我们可以通过运行答案集求解器来找到这些公理的标准模型。作为一个例子，我们将这种“反向补全”过程应用于和与积拼图。

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

求助全文

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