A solver for QBFs in negation normal form
Constraints
Testing Relativised Uniform Equivalence under Answer-Set Projection in the System cc T
Applications of Declarative Programming and Knowledge Management
ccT on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Hi-index | 0.00 |
In recent work, a general framework for specifying correspondences between logic programs under the answer-set semantics has been defined. The framework allows to define different notions of equivalence, including well-known notions like strong 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 a system, called cc{\rm T}, to verify program correspondences in this general framework, relying on linear-time constructible reductions to quantified propositional logic using extant solvers for the latter language as back-end inference engines. We provide a preliminary performance evaluation which sheds light on some crucial design issues.