Abstract
AbstractIn 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.
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. Strongly equivalent logic programs
3. Infinitary equilibrium logic and strongly equivalent logic programs
4. Vicious circle principle, aggregates, and formation of sets in ASP based languages
5. Verifying Strong Equivalence of Programs in the Input Language of gringo
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献