On the relation among answer set solvers

Annals of Mathematics and Artificial Intelligence

Volumn 53, Issue 1-4, 2008, Pages 169-204

  Giunchiglia, Enrico ^a   Leone, Nicola ^b   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

Answer set programming; Answer set solvers; Search trees

Indexed keywords

EID: 65449182703     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-009-9113-1     Document Type: Article

References (55)

1. Achlioptas, D., Beame, P., Molloy, M.: A sharp threshold in proof complexity. In: Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC), pp. 337-346. ACM, New York (2001)
2. Anger, C., Gebser, M., Linke, T., Neumann, A., Schaub, T.: The nomore++ approach to answer set solving. In: Sutcliffe, G., Voronkov, A. (eds.) Proc. of the 12th International Conference on Logic Programming, Artificial Intelligence, and Reasoning (LPAR), Lecture Notes in Computer Science, vol. 3835, pp. 95-109. Springer, New York (2005) (Pubitemid 43955308)
3. Anger, C., Gebser, M., Janhunen, T., Schaub, T.: What's a head without a body? In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proc. of the 17th European Conference on Artificial Intelligence (ECAI), pp. 769-770. IOS, Amsterdam (2006)
4. Babovich, Y., Lifschitz, V.: Computing answer sets using program completion. Available at http://www.cs.utexas.edu/users/tag/cmodels/cmodels-1.ps (2003)
5. F. Calimeri W. Faber N. Leone G. Pfeifer 2006 Pruning operators for disjunctive logic programming systems Fundam. Inform. 71 2-3 183 214 (Pubitemid 43893779)
6. V. Chvátal E. Szemerédi 1988 Many hard examples for resolution J. ACM 35 4 759 768
7. Clark, K.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 293-322. Plenum, New York (1978)
8. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT, Cambridge (2001)
9. H.E. Dixon M.L. Ginsberg D.K. Hofer E.M. Luks A.J. Parkes 2005 Generalizing Boolean satisfiability III: implementation J. Artif. Intell. Res. (JAIR) 23 441 531
10. W.F. Dowling J.H. Gallier 1984 Linear-time algorithms for testing the satisfiability of propositional Horn formulae J. Log. Program. 1 3 267 284
11. East, D., Truszczynski, M.: The aspps system. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) Proc. of 8th European Conference on Logics in Artificial Intelligence (JELIA), Lecture Notes in Computer Science, vol. 2424, pp. 533-536. Springer, New York (2002)
12. E. Erdem V. Lifschitz 2003 Tight logic programs Theory Pract. Log. Program. 3 4-5 499 518
13. Faber, W.: Enhancing efficiency and expressiveness in ASP systems. Ph.D. thesis, University of Wien (2002)
14. Faber, W., Leone, N., Pfeifer, G.: Pushing goal derivation in DLP computation. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) Proc. of the 5th International Conference on Logic Programming and Nonmonostonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 1730, pp. 107-116. Springer, New York (1999)
15. Faber, W., Leone, N., Pfeifer, G.: Experimenting with heuristics for ASP. In: Nebel, B. (ed.) Proc. of the 17th International Joint Conference on Artificial Intelligence (IJCAI), pp. 635-640. Morgan Kaufmann, San Francisco (2001)
16. Faber, W., Leone, N., Pfeifer, G.: Recursive aggregates in disjunctive logic programs: semantics and complexity. In: Alferes, J.J., Leite, J. (eds.) Proc. of the 9th European Conference on Logics in Artificial Intelligence (JELIA), Lecture Notes in Computer Science, vol. 3229, pp. 200-212. Springer, New York (2004)
17. F. Fages 1994 Consistency of Clark's completion and existence of stable models Methods Logic Comput. Sci. 1 51 60
18. Gebser, M., Schaub, T.: Tableaux calculi for answer set programming. In: Etalle, S., Truszczynski, M. (eds.) Proc. of the 22nd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4079, pp. 11-25. Springer, New York (2006) (Pubitemid 44492579)
19. Gebser, M., Schaub, T.: Generic tableaux for answer set programming. In: Dahl V, Niemelä I (eds) Proc. of the 23rd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4670, pp. 119-133. Springer, New York (2007)
20. Gebser, M., Kaufmann, B., Neumann, B., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M.M. (ed.) Proc. of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pp. 386-392 (2007a)
21. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczynski, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J.S. (eds.) Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 4483, pp. 3-17. Springer, New York (2007b)
22. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski R, Bowen K (eds.) Proc. of 5th International Conference and Symposium on Logic Programming (ICLP/SLP), pp. 1070-1080. MIT, Cambridge (1988)
23. M. Gelfond V. Lifschitz 1991 Classical negation in logic programs and disjunctive databases New Gener. Comput. 9 3/4 365 385
24. Giunchiglia, E., Maratea, M.: Evaluating search strategies and heuristics for efficient answer set programming. In: Bandini, S., Manzoni, S. (eds.) Advanced in Artificial Intelligence: 9th Congress of the Italian Association for Artificial Intelligence (AIIA), Lecture Notes in Computer Science, vol. 4733, pp. 122-134. Springer, New York (2005a)
25. Giunchiglia, E., Maratea, M.: On the relation between ASP and SAT procedures (or, between smodels and cmodels). In: Gabbrielli, M., Gupta, G. (eds.) Proc. of the 21st International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 3668, pp. 37-51. Springer, New York (2005b)
26. Giunchiglia, E., Sebastiani, R.: Applying the Davis-Putnam procedure to non-clausal formulas. In: Lamma, E., Mello, P. (eds.) Advances in Artificial Intelligence: 6th Congress of the Italian Association for Artificial Intelligence (AIIA), Lecture Notes in Computer Science, vol. 1792, pp. 84-94. Springer, New York (1999)
27. E. Giunchiglia Y. Lierler M. Maratea 2006 Answer set programming based on propositional satisfiability J. Autom. Reason. 36 4 345 377 (Pubitemid 46046675)
28. A. Haken 1985 The intractability of resolution Theor. Comp. Sci. 39 297 308
29. Janhunen, T.: Representing normal programs with clauses. In: de Mántaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eureopean Conference on Artificial Intelligenc (ECAI), pp. 358-362. IOS, Amsterdam (2004)
30. T. Janhunen 2006 Some (in)translatability results for normal logic programs and propositional theories J. Appl. Non-Class. Log. 16 1-2 35 86
31. Järvisalo, M., Oikarinen, E.: Extended ASP tableaux and rule redundancy in normal logic programs. In: Dahl, V., Niemelä, I. (eds.) Proc. of the 23rd International Conference on Logic Programming (ICLP), Lecture Notes in Computer Science, vol. 4670, pp. 134-148. Springer, New York (2007)
32. N. Leone P. Rullo F. Scarcello 1997 Disjunctive stable models: unfounded sets, fixpoint semantics and computation Inf. Comput. 135 2 69 112 (Pubitemid 127452754)
33. N. Leone G. Pfeifer W. Faber T. Eiter G. Gottlob S. Perri F. Scarcello 2006 The DLV system for knowledge representation and reasoning ACM Trans. Comput. Log. (TOCL) 7 3 499 562 (Pubitemid 44330485)
34. P. Liberatore 2000 On the complexity of choosing the branching literal in DPLL Artif. Intell. 116 1-2 315 326 (Pubitemid 30560305)
35. Lierler, Y.: Abstract answer set solver. Accepted at the 24th International Conference on Logic Programming (ICLP). Available at http://www.cs.utexas.edu/users/yuliya/papers/aasp.pdf (2008)
36. Lifschitz, V.: Answer set planning. In: Schreye, D.D. (ed.) Proc. of the 16th International Conference on Logic Programming (ICLP), pp. 23-37. MIT, Cambridge (1999)
37. V. Lifschitz A. Razborov 2006 Why are there so many loop formulas? ACM Trans. Comput. Log. 7 2 183 214 (Pubitemid 43909223)
38. F. Lin Y. Zhao 2004 ASSAT: Computing answer sets of a logic program by SAT solvers Artif. Intell. 147 1-2 115 137
39. Liu, L., Truszczynski, M.: Pbmodels - software to compute stable models by pseudoboolean solvers. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) Proc. of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 3662, pp. 410-415. Springer, New York (2005)
40. M. Maratea F. Ricca W. Faber N. Leone 2008 Look-back techniques and heuristics in DLV: Implementation, evaluation and comparison to QBF solvers J. Algorithms 63 1-3 70 89
41. Marek, V., Truszczynski, M.: Stable models as an alternative programming paradigm. In: The Logic Programming Paradigm: a 25.Years perspective, Lecture Notes in Computer Science, Springer, New York (1999)
42. Marek, V.W., Truszczyński, M.: Nonmonotonic Logics-Context- Dependent Reasoning. Springer, New York (1993)
43. Mitchell, D.G.: Resolution and constraint satisfaction. In: Rossi, F. (ed.) Proc. of the 9th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, vol. 2833, pp. 555-569. Springer, New York (2003) (Pubitemid 137630381)
44. Monasson, R.: On the analysis of backtrack procedures for the coloring of random graphs, Chap Complex Networks. Lecture Notes in Physics. Springer, New York (2004)
45. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conference (DAC'01), pp. 530-535. ACM (2001)
46. I. Niemelä 1999 Logic programs with stable model semantics as a constraint programming paradigm Ann. Math. Artif. Intell. 25 3-4 241 273
47. R. Nieuwenhuis A. Oliveras C. Tinelli 2006 Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T) J. ACM 53 6 937 977 (Pubitemid 46276962)
48. F. Ricca W. Faber N. Leone 2006 A backjumping technique for disjunctive logic programming AI Commun. 19 2 155 172 (Pubitemid 43848926)
49. Simons, P.: Extending and implementing the stable model semantics. Ph.D. thesis, Helsinky University (2000)
50. P. Simons I. Niemelä T. Soininen 2002 Extending and implementing the stable model semantics Artif. Intell. 138 1-2 181 234
51. Syrjanen, T.: Lparse manual. http://www.tcs.hut.fi/software/smodels/ lparse.ps.gz (2003)
52. Tseitin, G.: On the complexity of proofs in propositional logics. Semin. Math. 8 (1970)
53. Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) Proc. of 6th International Conference on Principles and Practice of Constraint Programming (CP), Lecture Notes in Computer Science, vol. 1894, pp. 441-456. Springer, New York (2000)
54. Ward, J., Schlipf, J.: Answer set programming with clause learning. In: Lifschitz, V., Niemelä, I. (eds.) Proc. of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR), Lecture Notes in Computer Science, vol. 2923, pp. 302-313. Springer, New York (2004) (Pubitemid 38050686)
55. You, J.H., Liu, G., Yuan, L.Y., Onuczko, C.: Lookahead in smodels compared to local consistencies in CSP. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) Proc. of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, (LPNMR), Lecture Notes in Computer Science, pp. 266-278. Springer, New York (2005)