Author ORCID Identifier
Fandinno - https://orcid.org/0000-0002-3917-8717
Lifschitz - https://orcid.org/0000-0001-6051-7907
Document Type
Article
Publication Date
1-19-2024
Publication Title
Theory and Practice of Logic Programming
Issue
First View
First Page
1
Last Page
31
Abstract
Program completion is a translation from the language of logic programs into the language of first-order theories. Its original definition has been extended to programs that include integer arithmetic, accept input, and distinguish between output predicates and auxiliary predicates. For tight programs, that generalization of completion is known to match the stable model semantics, which is the basis of answer set programming. We show that the tightness condition in this theorem can be replaced by a less restrictive “local tightness” requirement. From this fact we conclude that the proof assistant ANTHEM-P2P can be used to verify equivalence between locally tight programs.
Recommended Citation
Fandinno, Jorge; Lifschitz, Vladimir; and Temple, Nathan, "Locally Tight Programs" (2024). Computer Science Faculty Publications. 104.
https://digitalcommons.unomaha.edu/compscifacpub/104
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Comments
This is an open access article that is licensed under the Creative Commons Attribution license.
DOI: https://doi.org/10.1017/S147106842300039X