Abstract
AbstractThis 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference14 articles.
1. Gebser, M. , Kaminski, R. , Kaufmann, B. , Lindauer, M. , Ostrowski, M. , Romero, J. , Schaub, T. and Thiele, S. 2019. Potassco User Guide. URL: https://github.com/potassco/guide/releases/.
2. Fandinno, J. , Lifschitz, V. , Lühne, P. and Schaub, T. 2020. Verifying tight logic programs with Anthem and Vampire. Theory and Practice of Logic Programming, 20.
3. Verifying Strong Equivalence of Programs in the Input Language of gringo
4. Abstract gringo
5. Making prolog more expressive