Author ORCID Identifier
https://orcid.org/0000-0002-3917-8717
https://orcid.org/0000-0002-8447-4048
https://orcid.org/0000-0002-6146-623X
https://orcid.org/0000-0001-6051-7907
Document Type
Article
Publication Date
9-18-2025
Publication Title
Theory and Practice of Logic Programming
Volume
25
Issue
4
First Page
668
Last Page
684
DOI
https://doi.org/10.1017/S1471068425100112
Abstract
ANTHEM 2.0 is a tool to aid in the verification of logic programs written in an expressive fragment of CLINGO ’s input language named MINI-GRINGO, which includes arithmetic operations and simple choice rules but not aggregates. It can translate logic programs into formula representations in the logic of here-and-there and analyze properties of logic programs such as tightness. Most importantly, ANTHEM 2.0 can support program verification by invoking first-order theorem provers to confirm that a program adheres to a first-order specification or to establish strong and external equivalence of programs. This paper serves as an overview of the system’s capabilities. We demonstrate how to use ANTHEM 2.0 effectively and interpret its results.
Recommended Citation
Fandinno, Jorge; Hansen, Zachary; Lierler, Yuliya; Glinzer, Christoph; Heuer, Jan; Schaub, Torsten; Stolzmaan, Tobias; and Lifschitz, Vladimire, "ANTHEM 2.0: Automated Reasoning for Answer Set Programming" (2025). Computer Science Faculty Publications. 108.
https://digitalcommons.unomaha.edu/compscifacpub/108
Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.
Funded by the University of Nebraska at Omaha Open Access Fund
Comments
The PDF passed the Adobe accessibility checker prior to upload.
This article was published under the University of Nebraska at Omaha and Cambridge University Press Open Access Publishing Agreement.