A translational approach to constraint answer set solving

Theory and Practice of Logic Programming

Volumn 10, Issue 4-6, 2010, Pages 465-480

  Drescher, Christian ^a   Walsh, Toby ^b  

^a VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

answer set programming; constraint processing; decomposition

Indexed keywords

ANSWER SET PROGRAMMING; ANSWER SET SOLVING; CONSTRAINT PROCESSING; CONSTRAINT SATISFACTION PROBLEMS; ENCODINGS; FINITE DOMAINS; LOGIC PROGRAMS; NEW APPROACHES;

LOGIC PROGRAMMING;

CONSTRAINT THEORY;

EID: 77957230122     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000220     Document Type: Conference Paper

References (37)

1. BALDUCCINI, M. 2009. CR-prolog as a specification language for constraint satisfaction problems. In Proceedings of LPNMR'09. Springer, 402-408.
2. BARAL, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
3. BARAL, C., CHANCELLOR, K., TRAN, N., TRAN, N., JOY, A., and BERENS, M. 2004. A knowledge based approach for representing and reasoning about signaling networks. In Proceedings of ISMB/ECCB'04. 15-22. (Pubitemid 41296666)
4. BASELICE, S., BONATTI, P., and GELFOND, M. 2005. Towards an integration of answer set and constraint solving. In Proceedings of ICLP'05. Springer, 52-66. (Pubitemid 41491593)
5. BESSIéRE, C., KATSIRELOS, G., NARODYTSKA, N., QUIMPER, C.-G., and WALSH, T. 2009. Decompositions of all different, global cardinality and related constraints. In Proceedings of IJCAI'09. AAAI Press/The MIT Press.
6. BIERE, A., HEULE, M., van MAAREN, H., AND WALSH, T., Eds. 2009. Handbook of Satisfiability. IOS Press.
7. CRAWFORD, J. M. and BAKER, A. B. 1994. Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of AAAI'94. AAAI Press, 1092-1097.
8. DAL PALù, A., DOVIER, A., PONTELLI, E., and ROSSI, G. 2009. Answer set programming with constraints using lazy grounding. In Proceedings of ICLP'09. Springer, 115-129.
9. DECHTER, R. 2003. Constraint Processing. Morgan Kaufmann.
10. DOVIER, A., FORMISANO, A., and PONTELLI, E. 2005. A comparison of CLP (FD) and ASP solutions to NP-complete problems. In Proceedings of ICLP'05. Springer, 67-82. (Pubitemid 41491594)
11. FUJITA, M., SLANEY, J. K., and BENNETT, F. 1993. Automatic generation of some results in finite algebra. In Proceedings of IJCAI'93. Morgan Kaufmann, 52-59.
12. GEBSER, M., HINRICHS, H., SCHAUB, T., and THIELE, S. 2009. Xpanda: A (simple) preprocessor for adding multi-valued propositions to ASP. In Proceedings of WLP'09.
13. GEBSER, M., KAUFMANN, B., NEUMANN, A., and SCHAUB, T. 2007a. Clasp: A conflict-driven answer set solver. In Proceedings of LPNMR'07. Springer, 260-265.
14. GEBSER, M., KAUFMANN, B., NEUMANN, A., and SCHAUB, T. 2007b. Conflict-driven answer set solving. In Proceedings of IJCAI'07. AAAI Press/The MIT Press, 386-392.
15. GEBSER, M., OSTROWSKI, M., and SCHAUB, T. 2009. Constraint answer set solving. In Proceedings of ICLP'09. Springer, 235-249.
16. GELFOND, M. and LIFSCHITZ, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP'88. MIT Press, 1070-1080.
17. GENT, I. P. 2002. Arc consistency in SAT. In Proceedings of ECAI'02. IOS Press, 121-125.
18. GENT, I. P. and WALSH, T. 1999. CSPLIB: A benchmark library for constraints. In Proceedings of CP'99. Springer, 480-481.
19. GOMES, C. P. and SELMAN, B. 1997. Problem structure in the presence of perturbations. In Proceedings of AAAI'97. AAAI Press, 221-226.
20. HELJANKO, K. and NIEMELä, I. 2003. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3, 4-5, 519-550.
21. JAFFAR, J. and MAHER, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503-581.
22. JäRVISALO, M., OIKARINEN, E., JANHUNEN, T., and NIEMELä, I. 2009. A module-based framework for multi-language constraint modeling. In Proceedings of LPNMR'09. Springer, 155-169.
23. LECONTE, M. 1996. A bounds-based reduction scheme for constraints of difference. In CP'96, Second International Workshop on Constraint-based Reasoning, Key West, Florida.
24. LEE, J. 2005. A model-theoretic counterpart of loop formulas. In Proceedings of IJCAI'05. Professional Book Center, 503-508.
25. LIFSCHITZ, V. 1999. Answer set planning. In Proceedings of ICLP'99. MIT Press, 23-37.
26. MELLARKOD, V. and GELFOND, M. 2008. Integrating answer set reasoning with constraint solving techniques. In Proceedings of FLOPS'08. Springer, 15-31. (Pubitemid 351642017)
27. MELLARKOD, V., GELFOND, M., and ZHANG, Y. 2008. Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence 53, 1-4, 251-287. (Pubitemid 351642017)
28. MITCHELL, D. 2005. A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85, 112-133.
29. NIEMELä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3-4, 241-273.
30. NIEUWENHUIS, R., OLIVERAS, A., and TINELLI, C. 2006. Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL (T).. Journal of the ACM 53, 6, 937-977. (Pubitemid 46276962)
31. NOGUEIRA, M., BALDUCCINI, M., GELFOND, M., WATSON, R., and BARRY, M. 2001. An A-prolog decision support system for the space shuttle. In Proceedings of PADL'01. Springer, 169-183.
32. PETRIE, K. E. and SMITH, B. M. 2003. Symmetry breaking in graceful graphs. In Proceedings of CP'03. Springer, 930-934. (Pubitemid 37273842)
33. ROSSI, F., van BEEK, P., AND WALSH, T., EDS. 2006. Handbook of Constraint Programming. Elsevier.
34. SIMONS, P., NIEMELä, I., and SOININEN, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1-2, 181-234.
35. TAMURA, N., TAGA, A., KITAGAWA, S., and BANBARA, M. 2006. Compiling finite linear CSP into SAT. In Proceedings of CP'06. Springer, 590-603. (Pubitemid 44618766)
36. WALSH, T. 2000. SAT v CSP. In Proceedings of CP'00. Springer, 441-456.
37. YOU, J.-H. and HOU, G. 2004. Arc-consistency + unit propagation = lookahead. In Proceedings of ICLP'04. Springer, 314-328. (Pubitemid 39224282)