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

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 .

[1]  Krzysztof R. Apt,et al.  Logic Programming , 1990, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[2]  Armando Tacchella,et al.  The Second QBF Solvers Comparative Evaluation , 2004, SAT (Selected Papers.

[3]  Stefan Woltran,et al.  On Solution Correspondences in Answer-Set Programming , 2005, IJCAI.

[4]  Michael Gelfond,et al.  Classical negation in logic programs and disjunctive databases , 1991, New Generation Computing.

[5]  Stefan Woltran,et al.  A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results , 2006, WLP.

[6]  U. Egly,et al.  A Solver for QBFs in Nonprenex Form , 2006, ECAI.

[7]  David Pearce,et al.  Simplifying Logic Programs Under Answer Set Semantics , 2004, ICLP.

[8]  Thomas Eiter,et al.  Uniform Equivalence of Logic Programs under the Stable Model Semantics , 2003, ICLP.

[9]  David Pearce,et al.  Strongly equivalent logic programs , 2001, ACM Trans. Comput. Log..

[10]  Stefan Woltran,et al.  Facts Do Not Cease to Exist Because They Are Ignored: Relativised Uniform Equivalence with Answer-Set Projection , 2007, AAAI.

[11]  M. Seidl,et al.  cc{\rm T}: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming , 2006, 2006 15th International Conference on Computing.

[12]  J. Oetsch.  An Extension of the System cc ⊤ for Testing Relativised Uniform Equivalence under Answer-Set Projection ∗ , 2007 .

[13]  Stefan Woltran,et al.  Simplifying Logic Programs Under Uniform and Strong Equivalence , 2004, LPNMR.

[14]  Stefan Woltran,et al.  Comparing Different Prenexing Strategies for Quantified Boolean Formulas , 2003, SAT.

[15]  Tomi Janhunen,et al.  Verifying the Equivalence of Logic Programs in the Disjunctive Case , 2004, LPNMR.

[16]  Fangzhen Lin,et al.  SELP - A System for Studying Strong Equivalence between Logic Programs , 2005, Answer Set Programming.