Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc T

Authors:
Johannes Oetsch;Martina Seidl;Hans Tompits;Stefan Woltran
Affiliations:
Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria A-1040;Institut für Softwaretechnik, Technische Universität Wien, Vienna, Austria A-1040;Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria A-1040;Institut für Informationssysteme, Technische Universität Wien, Vienna, Austria A-1040
Venue:
Applications of Declarative Programming and Knowledge Management
Year:
2009

Citing 8
Cited 0

Strongly equivalent logic programs

ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
cc{\rm T}: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming

CIC '06 Proceedings of the 15th International Conference on Computing
A Solver for QBFs in Nonprenex Form

Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Facts do not cease to exist because they are ignored: relativised uniform equivalence with answer-set projection

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
On solution correspondences in answer-set programming

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Discovering classes of strongly equivalent logic programs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

The system ccT is a tool for testing correspondence between propositional logic programs under the answer-set semantics with respect to different refined notions of program correspondence. The underlying methodology of ccT is to reduce a given correspondence problem to the satisfiability problem of quantified propositional logic and to employ extant solvers for the latter language as back-end inference engines. In a previous version of ccT, the system was designed to test correspondence between programs based on relativised strong equivalence under answer-set projection . Such a setting generalises the standard notion of strong equivalence by taking the alphabet of the context programs as well as the projection of the compared answer sets to a set of designated output atoms into account. This paper outlines a newly added component of ccT for testing similarly parameterised correspondence problems based on uniform equivalence .