cc⊤: a correspondence-checking tool for logic programs under the answer-set semantics

Authors:
Johannes Oetsch;Martina Seidl;Hans Tompits;Stefan Woltran
Affiliations:
Institut für Informationssysteme 184/3, Technische Universität Wien, Vienna, Austria;Institut für Softwaretechnik 188/3, Technische Universität Wien, Vienna, Austria;Institut für Informationssysteme 184/3, Technische Universität Wien, Vienna, Austria;Institut für Informationssysteme 184/3, Technische Universität Wien, Vienna, Austria
Venue:
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Year:
2006

Citing 6
Cited 2

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming and knowledge representation-the A-prolog perspective

Artificial Intelligence
On solution correspondences in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Towards implementations for advanced equivalence checking in answer-set programming

ICLP'05 Proceedings of the 21st international conference on Logic Programming
SELP – a system for studying strong equivalence between logic programs

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
The second QBF solvers comparative evaluation

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

In recent work, a general framework for specifying correspondences between logic programs under the answer-set semantics has been defined. The framework captures different notions of equivalence, including well-known ones like ordinary, strong, and uniform equivalence, as well as refined ones based on the projection of answer sets where not all parts of an answer set are of relevance. In this paper, we describe an implementation to verify program correspondences in this general framework. The system, called cc⊤, relies on linear-time constructible reductions to quantified propositional logic and uses extant solvers for the latter language as back-end inference engines.