Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

Journal of Algorithms

Volumn 63, Issue 1-3, 2008, Pages 70-89

  Maratea, Marco ^a,b   Ricca, Francesco ^a   Faber, Wolfgang ^a   Leone, Nicola ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

^b UNIVERSITY OF GENOA   (Italy)

Author keywords

Heuristics; Knowledge representation and reasoning; Nonmonotonic reasoning

Indexed keywords

DIFFERENTIATION (CALCULUS); HEURISTIC METHODS; MATHEMATICAL TECHNIQUES;

ANSWER SET PROGRAMMING; ANSWER SETS; BACKTRACKING SEARCH; EXPERIMENTAL EVALUATIONS; HEURISTICS; KNOWLEDGE REPRESENTATION AND REASONING; LITERALS; NONMONOTONIC REASONING; QBF SOLVERS; SEARCH PROCESSES; SEARCH SPACES; SEARCH TREES; STATE-OF-THE-ART SYSTEM;

HEURISTIC PROGRAMMING;

EID: 49449094346     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jalgor.2008.02.006     Document Type: Article

References (40)

1. Gelfond M., and Lifschitz V. The stable model semantics for logic programming. Logic Programming: Proceedings Fifth International Conference and Symposium (1988), MIT Press, Cambridge, MA 1070-1080
2. Gelfond M., and Lifschitz V. Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9 (1991) 365-385
3. Lifschitz V. Answer set planning. In: Schreye D.D. (Ed). Proceedings of the 16th International Conference on Logic Programming, ICLP'99, Las Cruces, NM (1999), MIT Press 23-37
4. Janhunen T., and Niemelä I. Gnt-A solver for disjunctive logic programs. In: Lifschitz V., and Niemelä I. (Eds). Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR-7. Lecture Notes in Artificial Intelligence vol. 2923 (2004), Springer 331-335
5. Lierler Y. Disjunctive answer set programming via satisfiability. In: Baral C., Greco G., Leone N., and Terracina G. (Eds). Proceedings of Logic Programming and Nonmonotonic Reasoning-8th International Conference, LPNMR'05, Diamante, Italy, September 2005. Lecture Notes in Comput. Sci. vol. 3662 (2005), Springer 447-451
6. Ricca F., Faber W., and Leone N. A backjumping technique for disjunctive logic programming. AI Commun. 19 2 (2006) 155-172
7. J. Gaschnig, Performance measurement and analysis of certain search algorithms, PhD thesis, Carnegie Mellon University, Pittsburgh, PA, Technical report CMU-CS-79-124, 1979
8. Prosser P. Hybrid algorithms for the constraint satisfaction problem. Comput. Intelligence 9 (1993) 268-299
9. Moskewicz M.W., Madigan C.F., Zhao Y., Zhang L., and Malik S. Chaff: Engineering an efficient SAT solver. Proceedings of the 38th Design Automation Conference, DAC 2001, Las Vegas, NV (2001), ACM 530-535
10. Faber W., Leone N., Mateis C., and Pfeifer G. Using database optimization techniques for nonmonotonic reasoning. In: INAP Organizing Committee (Ed). Proceedings of the 7th International Workshop on Deductive Databases and Logic Programming, DDLP'99 (1999), Prolog Association of Japan 135-139
11. W. Faber, Enhancing efficiency and expressiveness in answer set programming systems, PhD thesis, Institut für Informationssysteme, Technische Universität Wien, 2002
12. Faber W., Leone N., and Pfeifer G. Experimenting with heuristics for answer set programming. Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, WA (2001), Morgan Kaufmann 635-640
13. Faber W., and Ricca F. Solving hard ASP programs efficiently. In: Baral C., Greco G., Leone N., and Terracina G. (Eds). Proceedings of Logic Programming and Nonmonotonic Reasoning-8th International Conference, LPNMR'05, Diamante, Italy, September 2005. Lecture Notes in Comput. Sci. vol. 3662 (2005), Springer 240-252
14. Faber W., Leone N., and Ricca F. Solving hard problems for the second level of the polynomial hierarchy: Heuristics and benchmarks. Intell. Artific. 2 3 (2005) 21-28
15. Leone N., Pfeifer G., Faber W., Eiter T., Gottlob G., Perri S., and Scarcello F. The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7 3 (2006) 499-562
16. Feldmann R., Monien B., and Schamberger S. A distributed algorithm to evaluate quantified Boolean formulae. Proceedings National Conference on AI, AAAI'00, Austin, TX (2000), AAAI Press 285-290
17. Benedetti M. skizzo: A suite to evaluate and certify qbfs. In: Nieuwenhuis R. (Ed). Automated Deduction-CADE-20, 20th International Conference on Automated Deduction, Tallinn, Estonia. Lecture Notes in Comput. Sci. vol. 3632 (2005), Springer 369-376
18. Biere A. Resolve and expand. Revised Selected Papers of the 7th International Conference on Theory and Applications of Satisfiability Testing, SAT'04. Lecture Notes in Artificial Intelligence vol. 3542 (2005), Springer 59-70
19. Ward J., and Schlipf J.S. Answer set programming with clause learning. In: Lifschitz V., and Niemelä I. (Eds). Proceedings of the 7th International Conference on Logic Programming and Non-Monotonic Reasoning, LPNMR-7. Lecture Notes in Artificial Intelligence vol. 2923 (2004), Springer 302-313
20. Gebser M., Kaufmann B., Neumann A., and Schaub T. Conflict-driven answer set solving. Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 (2007), Morgan Kaufmann 386-392
21. Narizzano M., and Tacchella A. QBF solvers evaluation. page (2002). http://www.qbflib.org/qbfeval/index.html/
22. Narizzano M., Pulina L., and Tacchella A. The QBFEVAL Web portal. Proceedings of the 10th European Conference on Logics in Artificial Intelligence, JELIA'06. Lecture Notes in Artificial Intelligence vol. 4160 (2006), Springer 494-497
23. Cadoli M., Giovanardi A., and Schaerf M. Experimental analysis of the computational cost of evaluating quantified Boolean formulae. Proceedings of the 5th Congress: Advances in Artificial Intelligence of the Italian Association for Artificial Intelligence, AI*IA 97, Rome. Lecture Notes in Comput. Sci. (1997), Springer 207-218
24. I. Gent, T. Walsh, The QSAT Phase Transition, in: Proceedings of the 16th AAAI, 1999
25. Chen H., and Interian Y. A model for generating random quantified Boolean formulas. Nineteenth International Joint Conference on Artificial Intelligence, IJCAI-05 (2005), Professional Book Center 66-71
26. Eiter T., and Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Ann. Math. Artificial Intelligence 15 3/4 (1995) 289-323
27. Castellini C., Giunchiglia E., and Tacchella A. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism. Artificial Intelligence 147 1/2 (2003) 85-117
28. Ayari A., and Basin D.A. Bounded model construction for monadic second-order logics. Proceedings of Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL (2000)
29. Cadoli M., Eiter T., and Gottlob G. Default logic as a query language. IEEE Trans. Knowl. Data Engrg. 9 3 (1997) 448-463
30. M. Zolda, Comparing different prenexing strategies for quantified Boolean formulas, Master's thesis, Institut für Informationssysteme, Technische Universität Wien, 2005
31. Dechter R., and Frost D. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence 136 2 (2002) 147-188
32. Bayardo R., and Schrag R. Using CSP look-back techniques to solve real-world SAT instances. Proceedings of the 15th National Conference on Artificial Intelligence, AAAI-97 (1997) 203-208
33. Silva J.P.M., and Sakallah K.A. GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48 5 (1999) 506-521
34. Goldberg E., and Novikov Y. BerkMin: A fast and robust sat-solver. Design, Automation and Test in Europe Conference and Exposition, DATE 2002, Paris (2002), IEEE Comput. Soc. 142-149
35. L. Zhang, S. Malik, Conflict driven learning in a quantified Boolean satisfiability solver, in: Proceedings of the International Conference on Computer-Aided Design, ICCAD 2002, 2002, pp. 442-449
36. Zhang L., and Malik S. Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation. Proceedings of Principles and Practice of Constraint Programming-CP 2002, 8th International Conference, CP 2002, Ithaca, NY. Lecture Notes in Comput. Sci. (2002), Springer 200-215
37. Giunchiglia E., Narizzano M., and Tacchella A. Backjumping for quantified Boolean logic satisfiability. Artificial Intelligence 145 (2003) 99-120
38. Letz R. Lemma and model caching in decision procedures for quantified Boolean formulas. Proceedings of Automated Reasoning with Analytic Tableaux and Related Methods, International Conference, TABLEAUX 2002, Copenhagen. Lecture Notes in Comput. Sci. (2002), Springer 160-175
39. J. Ward, Answer set programming with clause learning, PhD thesis, Ohio State University, Cincinnati, OH, 2004
40. Giunchiglia E., Lierler Y., and Maratea M. Answer set programming based on propositional satisfiability. J. Automat. Reason. 36 4 (2006) 345-377