Evaluating Search Strategies and Heuristics for Efficient Answer Set Programming

1. Bayardo Jr., R.J., Schrag, R.C.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of AAAI 1997, pp. 203–208. AAAI Press, Menlo Park (1997)

   Google Scholar 

2. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293–322. Plenum Press, New York (1978)

   Google Scholar 

3. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Journal of the ACM 5(7) (1962)

   Google Scholar 

4. Esra, E.: Theory and applications of answer set programming. PhD thesis, University of Texas at Austin, PhD thesis (2002)

   Google Scholar 

5. Fages, F.: Consistency of Clark’s completion and existence of stable models. Journal of Methods of Logic in Computer Science 1, 51–60 (1994)

   Google Scholar 

6. Faber, W., Leone, N., Pfeifer, G.: Experimenting with heuristics for asp. In: Proc. IJCAI (2001)

   Google Scholar 

7. Freeman, J.W.: Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania (1995)

   Google Scholar 

8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming: Proc. Fifth Int’l Conf. and Symp., pp. 1070–1080 (1988)

   Google Scholar 

9. Giunchiglia, E., Maratea, M.: On the relation between sat and asp procedures. In: AAAI 2005 (2005) (Submitted to)

   Google Scholar 

10. Giunchiglia, E., Maratea, M., Lierler, Y.: SAT-based answer set programming. In: American Association for Artificial Intelligence (2004)

    Google Scholar 

11. Giunchiglia, E., Maratea, M., Tacchella, A. (In)Effectiveness of look-ahead techniques in a modern SAT solver. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 842–846. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

12. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 366–371. Morgan Kaufmann Publishers, San Francisco (1997)

    Google Scholar 

13. LeBerre, D., Simon, L.: Fifty-five solvers in vancouver: The sat 2004 competition. In: 8th International Conference on Theory an Applications of Satisfiability Testing. Selected Revised Papers. LNCS, Springer, Heidelberg (2005) (to appear)

    Google Scholar 

14. Lin, F., Zhao, Y.: Asp phase transition: A study on randomly generated programs. In: Proc. ICLP 2003 (2003)

    Google Scholar 

15. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (June 2001)

    Google Scholar 

16. Marek, V., Truszczynski, M.: Stable models as an alternative programming paradigm. In: The Logic Programming Paradigm: a 25.Years perspective. LNCS, Springer, Heidelberg (1999)

    Google Scholar 

17. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 241–273 (1999)

    Article  MATH  MathSciNet  Google Scholar 

18. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3), 268–299 (1993)

    Article  Google Scholar 

19. Simons, P.: Extending and implementing the stable model semantics. PhD thesis, Helsinky University, PhD thesis (2000)

    Google Scholar 

20. Silva, J.P.M., Sakallah, K.A.: GRASP - a new search algorithm for satisfiability. Technical report, University of Michigan (1996)

    Google Scholar 

21. Zhang, L., Madigan, C.F., Moskewicz, M.H., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD (2001)

    Google Scholar 

Download references