Anthem 2.0: Automated Reasoning for Answer Set Programming
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 15 Jul 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 2.
2 papers.
- 2026Implementing the First-Order Logic of Here and Therecited by 0
- 2026Parametric Modular Answer Set Programs Made Declarativecited by 0
- 2026Parametric Modular Answer Set Programs Made Declarative21 May 2026
- 2026Implementing the First-Order Logic of Here and There7 Jan 2026