Anthem 2.0: Automated Reasoning for Answer Set Programming
Jorge Fandinno, Christoph Glinzer, Zachary Hansen, Jan Heuer, Yuliya Lierler, Vladimir Lifschitz, Torsten Schaub, Tobias Stolzmann

TL;DR
Anthem 2.0 is a tool that automates reasoning tasks for logic programs in mini-gringo, enabling verification, property analysis, and equivalence checking using theorem provers.
Contribution
It introduces Anthem 2.0, a novel system that translates mini-gringo programs into logical formulas and supports automated verification and equivalence analysis.
Findings
Supports verification against first-order specifications
Analyzes properties like tightness of logic programs
Establishes program equivalence using theorem provers
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
