Skip to main content Accessibility help
×
Home

A translational approach to constraint answer set solving

  • CHRISTIAN DRESCHER (a1) and TOBY WALSH (a2)

Abstract

We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into logic programs such that unit-propagation achieves arc, bound or range consistency. Experiments with our encodings demonstrate their computational impact.

Copyright

References

Hide All
Balduccini, M. 2009. CR-prolog as a specification language for constraint satisfaction problems. In Proceedings of LPNMR'09. Springer, 402408.
Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press.
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.
Baselice, S., Bonatti, P., and Gelfond, M. 2005. Towards an integration of answer set and constraint solving. In Proceedings of ICLP'05. Springer, 5266.
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.
Biere, A., Heule, M., van Maaren, H., and Walsh, T., Eds. 2009. Handbook of Satisfiability. IOS Press.
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, 10921097.
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, 115129.
Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
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, 6782.
Fujita, M., Slaney, J. K., and Bennett, F. 1993. Automatic generation of some results in finite algebra. In Proceedings of IJCAI'93. Morgan Kaufmann, 5259.
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.
Gebser, M., Kaufmann, B., Neumann, A., and Schaub, T. 2007a. Clasp: A conflict-driven answer set solver. In Proceedings of LPNMR'07. Springer, 260265.
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, 386392.
Gebser, M., Ostrowski, M., and Schaub, T. 2009. Constraint answer set solving. In Proceedings of ICLP'09. Springer, 235249.
Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Proceedings of ICLP'88. MIT Press, 10701080.
Gent, I. P. 2002. Arc consistency in SAT. In Proceedings of ECAI'02. IOS Press, 121125.
Gent, I. P. and Walsh, T. 1999. CSPLIB: A benchmark library for constraints. In Proceedings of CP'99. Springer, 480481.
Gomes, C. P. and Selman, B. 1997. Problem structure in the presence of perturbations. In Proceedings of AAAI'97. AAAI Press, 221226.
Heljanko, K. and Niemelä, I. 2003. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3, 4–5, 519550.
Jaffar, J. and Maher, M. J. 1994. Constraint logic programming: A survey. Journal of Logic Programming 19/20, 503581.
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, 155169.
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.
Lee, J. 2005. A model-theoretic counterpart of loop formulas. In Proceedings of IJCAI'05. Professional Book Center, 503508.
Lifschitz, V. 1999. Answer set planning. In Proceedings of ICLP'99. MIT Press, 2337.
Mellarkod, V. and Gelfond, M. 2008. Integrating answer set reasoning with constraint solving techniques. In Proceedings of FLOPS'08. Springer, 1531.
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, 251287.
Mitchell, D. 2005. A SAT solver primer. Bulletin of the European Association for Theoretical Computer Science 85, 112133.
Niemelä, I. 1999. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3–4, 241273.
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, 937977.
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, 169183.
Petrie, K. E. and Smith, B. M. 2003. Symmetry breaking in graceful graphs. In Proceedings of CP'03. Springer, 930934.
Rossi, F., van Beek, P., and Walsh, T., Eds. 2006. Handbook of Constraint Programming. Elsevier.
Simons, P., Niemelä, I., and Soininen, T. 2002. Extending and implementing the stable model semantics. Artificial Intelligence 138, 1–2, 181234.
Tamura, N., Taga, A., Kitagawa, S., and Banbara, M. 2006. Compiling finite linear CSP into SAT. In Proceedings of CP'06. Springer, 590603.
Walsh, T. 2000. SAT v CSP. In Proceedings of CP'00. Springer, 441456.
You, J.-H. and Hou, G. 2004. Arc-consistency + unit propagation = lookahead. In Proceedings of ICLP'04. Springer, 314328.

Keywords

Related content

Powered by UNSILO

A translational approach to constraint answer set solving

  • CHRISTIAN DRESCHER (a1) and TOBY WALSH (a2)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.