Evaluating search strategies and heuristics for efficient Answer Set Programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3673 LNAI, Issue , 2005, Pages 122-134

  Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

BIFURCATION (MATHEMATICS); DATA STRUCTURES; FORMAL LOGIC; HEURISTIC METHODS; LOGIC PROGRAMMING; PROBLEM SOLVING; TREES (MATHEMATICS);

ANSWER SET PROGRAMMING (ASP); EXPERIMENTAL EVALUATION; LOGIC PROGRAMS; SATISFIABILITY (SAT);

HEURISTIC PROGRAMMING;

EID: 33646156630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11558590_13     Document Type: Conference Paper

References (21)

1. [BS97] Roberto J. Bayardo, Jr. and Robert C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of AAAI-97, pages 203-208, Menlo Park, July 27-31 1997. AAAI Press.
2. [Cla78] Keith Clark. Negation as failure. In Herve Gallaire and Jack Minker, editors, Logic and Data Bases, pages 293-322. Plenum Press, 1978.
3. [DLL62] M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
4. [Esr02] Erdem Esra. Theory and applications of answer set programming. PhD thesis, University of Texas at Austin, 2002. PhD thesis.
5. [Fag94] François Fages. Consistency of dark's completion and existence of stable models. Journal of Methods of Logic in Computer Science, 1:51-60, 1994.
6. [FLP01] W. Faber, N. Leone, and G. Pfeifer. Experimenting with heuristics for asp. In Proc. IJCAI, 2001.
7. [Fre95] Jon W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
8. [GL88] Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In Robert Kowalski and Kenneth Bowen, editors, Logic Programming: Proc. Fifth Int'l Conf. and Symp., pages 1070-1080, 1988.
9. [GM05] E. Giunchiglia and M. Maratea. On the relation between sat and asp procedures. Submitted to AAAI 2005, 2005.
10. [GML04] E. Giunchiglia, M. Maratea, and Y. Lierler. SAT-based answer set programming. In American Association for Artificial Intelligence, 2004.
11. [GMT03] E. Giunchiglia, M. Maratea, and A. Tacchella. (In)Effectiveness of look-ahead techniques in a modern SAT solver. In 9th International Conference on Principles and Practice of Constraint Programming (CP-03), pages 842-846, 2003.
12. [LA97] Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366-371, San Francisco, August 23-29 1997. Morgan Kaufmann Publishers.
13. [LS05] D. LeBerre and L. Simon. Fifty-five solvers in vancouver: The sat 2004 competition. In 8th International Conference on Theory an Applications of Satisfiability Testing. Selected Revised Papers., Lecture Notes in Computer Science. Springer Verlag, 2005. To appear.
14. [LZ03] F. Lin and Y. Zhao. Asp phase transition: A study on randomly generated programs. In Proc. ICLP-03, 2003.
15. +01] Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), June 2001.
16. [MT99] Victor Marek and Miroslaw Truszczynski. Stable models as an alternative programming paradigm. In The Logic Programming Paradigm: a 25. Years perspective, Lecture Notes in Computer Science. Springer Verlag, 1999.
17. [Nie99] I. Niemelä. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence, 25:241-273, 1999.
18. [Pro93] Patrick Presser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
19. [Sim00] Patrick Simons. Extending and implementing the stable model semantics. PhD thesis, Helsinky University, 2000. PhD thesis.
20. [SS96] João P. Marques Silva and Karem A. Sakallah. GRASP - a new search algorithm for satisfiability. Technical report, University of Michigan, 1996.
21. [ZMMM01] L. Zhang, C. F. Madigan, M. H. Moskewicz, and S. Malik. Efficient conflict driven learning in a boolean satisfiability solver. In ICCAD, 2001.