mlsanityData to 7 Oct 2026

Verifying Tight Logic Programs with anthem and Vampire

arXiv 2008.02025 ↗First posted 5 Aug 2020cs.LO cs.AIcited by 13

Not on the map. Why?

Abstract (arXiv)

This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas. Under consideration for acceptance in TPLP.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Aug 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 2; 2023: 2; 2024: 2; 2025: 4; 2026: 2.

13 papers.

Sort:

  1. 2021Constraint Answer Set Programming: Integrational and Translational (or SMT-based) Approachescited by 7
  2. 2022Verification of Locally Tight Programscited by 3
  3. 2024Unit Testing in ASP Revisited: Language and Test-Driven Development Environmentcited by 2
  4. 2023Rethinking Answer Set Programming Templatescited by 1
  5. 2024Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalencecited by 1
  6. 2025Splitting Answer Set Programs with respect to Intensionality Statements (Extended Version)cited by 1
  7. 2025SM-based Semantics for Answer Set Programs Containing Conditional Literals and Arithmeticcited by 1
  8. 2022Tools and Methodologies for Verifying Answer Set Programscited by 0
  9. 2023Automated Verification of Equivalence Properties in Advanced Logic Programs -- Bachelor Thesiscited by 0
  10. 2025Relating Answer Set Programming and Many-sorted Logics for Formal Verificationcited by 0
  11. 2025Deductive Systems for Logic Programs with Countingcited by 0
  12. 2026Implementing the First-Order Logic of Here and Therecited by 0
1 more
  1. 2026Parametric Modular Answer Set Programs Made Declarativecited by 0