Verifying Tight Logic Programs with anthem and vampire

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

doi:10.1017/s1471068420000344

Cited by 23 publications

(20 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In our experience this feature augments the program under test in a way that is not obvious to the programmer, thus we decided to discard this feature. Alternative ways of verifying the correctness of programs with input and output have been recently proposed (Fandinno et al 2020), that could be considered for integration in our framework.…”

Section: Related Workmentioning

confidence: 99%

Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

AMENDOLA,

MAZZOTTA,

RICCA

et al. 2024

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Unit testing frameworks are nowadays considered a best practice, included in almost all modern software development processes, to achieve rapid development of correct specifications. Knowledge representation and reasoning paradigms such as Answer Set Programming (ASP), that have been used in industry-level applications, are not an exception. Indeed, the first unit testing specification language for ASP was proposed in 2011 as a feature of the ASPIDE development environment. Later, a more portable unit testing language was included in the LANA annotation language. In this paper we revisit both languages and tools for unit testing in ASP. We propose a new unit test specification language that allows one to inline tests within ASP programs, and we identify the computational complexity of the tasks associated with checking the various program-correctness assertions. Test-case specifications are transparent to the traditional evaluation, but can be interpreted by a specific testing tool. Thus, we present a novel environment supporting test-driven development of ASP programs.

show abstract

Section: Related Workmentioning

confidence: 99%

Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

AMENDOLA,

MAZZOTTA,

RICCA

et al. 2024

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

show abstract

“…2019) investigated in several recent publications (Lifschitz et al . 2019;Fandinno et al . 2020;Lifschitz 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

“…This makes reasoning about programs with variables cumbersome. For instance, it prohibits using first-order theorem provers for verifying properties of programs as advocated by Fandinno et al (2020).…”

Section: Introductionmentioning

confidence: 99%

Axiomatization of Aggregates in Answer Set Programming

Fandinno

Hansen

Lierler

2022

AAAI

Self Cite

View full text Add to dashboard Cite

The paper presents a characterization of logic programs with aggregates based on many-sorted generalization of operator SM that refers neither to grounding nor to fixpoints. This characterization introduces new symbols for aggregate operations and aggregate elements, whose meaning is fixed by adding appropriate axioms to the result of the SM transformation. We prove that for programs without positive recursion through aggregates our semantics coincides with the semantics of the answer set solver Clingo.

show abstract

Verifying Tight Logic Programs with anthem and vampire

Cited by 23 publications

References 17 publications

Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

Unit Testing in ASP Revisited: Language and Test-Driven Development Environment

Here and There with Arithmetic

Axiomatization of Aggregates in Answer Set Programming

Contact Info

Product

Resources

About