A theory of diagnosis from first principles
Artificial Intelligence
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Backjumping for quantified Boolean logic satisfiability
Artificial Intelligence
cc{\rm T}: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming
CIC '06 Proceedings of the 15th International Conference on Computing
The Diagnosis Frontend of the dlv system
AI Communications
A solver for QBFs in negation normal form
Constraints
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
Towards implementations for advanced equivalence checking in answer-set programming
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Testing strong equivalence of datalog programs – implementation and examples
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
SELP – a system for studying strong equivalence between logic programs
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Representing paraconsistent reasoning via quantified propositional logic
Inconsistency Tolerance
| Hi-index | 0.00 |
The tool ccT is an implementation for testing various parameterised notions of program correspondence between logic programs under the answer-set semantics, based on reductions to quantified propositional logic. One such notion is relativised uniform equivalence with projection , which extends standard uniform equivalence via two additional parameters: one for specifying the input alphabet and one for specifying the output alphabet. In particular, the latter parameter is used for projecting answer sets to the set of designated output atoms, i.e. ignoring auxiliary atoms during answer-set comparison. In this paper, we discuss an application of ccT for verifying the correctness of students' solutions drawn from a laboratory course on logic programming, employing relativised uniform equivalence with projection as the underlying program correspondence notion. We complement our investigation by discussing a performance evaluation of ccT, showing that discriminating among different back-end solvers for quantified propositional logic is a crucial issue towards optimal performance.