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.

PDF

To Appear In Theory and Practice of Logic Programming (2025).

@article{anthem2.0, title={Anthem 2.0: Automated Reasoning for Answer Set Programming}, author={Jorge Fandinno and Christoph Glinzer and Zachary Hansen and Jan Heuer and Yuliya Lierler and Vladimir Lifschitz and Torsten Schaub and Tobias Stolzmann}, journal={Theory and Practice of Logic Programming}, month={ }, url="http://www.cs.utexas.edu/users/ai-labpub-view.php?PubID=128125", year={2025} }