Verifying Strong Equivalence of Programs in the Input Language of gringo

Lifschitz, Vladimir; Lühne, Patrick; Schaub, Torsten

doi:10.1007/978-3-030-20528-7_20

Cited by 16 publications

(24 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another extension we plan to include in the future is the addition of trace labels for constraints, so that those that are labelled become weak constraints. Other extensions for the long term include the use of causal literals as in [8] or the use of verification annotations to be combined with a similar theorem proving technique as done in [11].…”

Section: Discussionmentioning

confidence: 99%

A System for Explainable Answer Set Programming

Cabalar

Fandinno

Muñiz

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. These annotations allow tracing the application of rules or the atoms derived by them. The input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver. xclingo translates the annotations into additional predicates and rules and uses the ASP solver clingo to obtain the extension of those auxiliary predicates. This information is used afterwards to construct derivation trees containing textual explanations. The language allows selecting which atoms to explain and, in its turn, which atoms or rules to include in those explanations. We illustrate the basic features through a diagnosis problem from the literature.

show abstract

Section: Discussionmentioning

confidence: 99%

A System for Explainable Answer Set Programming

Cabalar

Fandinno

Muñiz

2020

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

show abstract

“…Our goal is to extend this method of proving strong equivalence to rules of minigringo-the fragment of the input language of gringo (Gebser et al . 2019) investigated in several recent publications (Lifschitz et al . 2019;Fandinno et al .…”

Section: Vladimir Lifschitzmentioning

confidence: 99%

Here and There with Arithmetic

Lifschitz

2021

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

Abstarct In the theory of answer set programming, two groups of rules are called strongly equivalent if, informally speaking, they have the same meaning in any context. The relationship between strong equivalence and the propositional logic of here-and-there allows us to establish strong equivalence by deriving rules of each group from rules of the other. In the process, rules are rewritten as propositional formulas. We extend this method of proving strong equivalence to an answer set programming language that includes operations on integers. The formula representing a rule in this language is a first-order formula that may contain comparison symbols among its predicate constants, and symbols for arithmetic operations among its function constants. The paper is under consideration for acceptance in TPLP.

show abstract

“…The class of programs studied in this paper is the subset of the input language of gringo (Gebser et al 2015) discussed in earlier publications by Lifschitz et al (2019;.…”

Section: Review: Programsmentioning

confidence: 99%

“…The translation τ * (Lifschitz et al 2019) converts a program into a finite set of first-order sentences with variables of two sorts. Besides program variables, which are meant to range over precomputed program terms, these sentences contain integer variables, which are meant to range over numerals.…”

Section: Review: Representing Programs By First-order Theoriesmentioning

confidence: 99%

“…In this paper, 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, state a theorem describing the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem (Lifschitz et al 2018;Lifschitz et al 2019) and vampire (Kovács and Voronkov 2013), for verifying the correctness of programs with input and output. A lemma that may be of independent interest relates the semantics of simple gringo programs to stable models of first-order formulas (Ferraris et al 2011).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Verifying Tight Logic Programs with anthem and vampire

Fandinno

Lifschitz

Lühne

et al. 2020

Theory and Practice of Logic Programming

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Verifying Strong Equivalence of Programs in the Input Language of gringo

Cited by 16 publications

References 8 publications

A System for Explainable Answer Set Programming

A System for Explainable Answer Set Programming

Here and There with Arithmetic

Verifying Tight Logic Programs with anthem and vampire

Contact Info

Product

Resources

About