On the relation among answer set solvers
- 1 August 2008
- journal article
- Published by Springer Nature in Annals of Mathematics and Artificial Intelligence
- Vol. 53 (1-4) , 169-204
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solversJournal of Algorithms, 2008
- Solving SAT and SAT Modulo TheoriesJournal of the ACM, 2006
- The DLV system for knowledge representation and reasoningACM Transactions on Computational Logic, 2006
- Why are there so many loop formulas?ACM Transactions on Computational Logic, 2006
- Some (in)translatability results for normal logic programs and propositional theoriesJournal of Applied Non-Classical Logics, 2006
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- Tight logic programsTheory and Practice of Logic Programming, 2003
- Extending and implementing the stable model semanticsArtificial Intelligence, 2002
- Many hard examples for resolutionJournal of the ACM, 1988
- Linear-time algorithms for testing the satisfiability of propositional horn formulaeThe Journal of Logic Programming, 1984