Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming-Reference-Cited by-同舟云学术

Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming

Published:2005 Issue: Volume: Page:189-203
ISSN:0302-9743
Container-title:Logic Programming
language:
Short-container-title:

Author:

Tompits Hans,Woltran Stefan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11562931_16.pdf

Reference28 articles.

1. Arieli, O.: Paraconsistent Preferential Reasoning by Signed Quantified Boolean Formulae. In: Proc. ECAI 2004, pp. 773–777. IOS Press, Amsterdam (2004)

2. Arieli, O., Denecker, M.: Reducing Preferential Paraconsistent Reasoning to Classical Entailment. Journal of Logic and Computation 13(4), 557–580 (2003)

3. Lecture Notes in Computer Science;P. Besnard,2005

4. Coste-Marquis, S., Fargier, H., Lang, J., Le Berre, D., Marquis, P.: Function Problems for Quantified Boolean Formulas. Technical Report 2003-15-R, Institut de Recherche en Informatique de Toulouse, IRIT (2003), Available at http://www.cril.univ-artois.fr/asqbf/pub/files/qbfeng7.pdf

5. Delgrande, J., Schaub, T., Tompits, H., Woltran, S.: On Computing Solutions to Belief Change Scenarios. Journal of Logic and Computation 14(6), 801–826 (2004)

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Beyond Uniform Equivalence between Answer-set Programs;ACM Transactions on Computational Logic;2021-01-31

2. Applying Visible Strong Equivalence in Answer-Set Program Transformations;ACM Transactions on Computational Logic;2020-10-31

3. Characterising equilibrium logic and nested logic programs: Reductions and complexity,;Theory and Practice of Logic Programming;2009-07-31

4. cc⊤ on Stage: Generalised Uniform Equivalence Testing for Verifying Student Assignment Solutions;Logic Programming and Nonmonotonic Reasoning;2009

5. A solver for QBFs in negation normal form;Constraints;2008-07-13