ASP modulo CSP: The clingcon system

Theory and Practice of Logic Programming

Volumn 12, Issue 4-5, 2012, Pages 485-503

  Ostrowski, Max ^a   Schaub, Torsten ^a  

^a UNIVERSITY OF POTSDAM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ANSWER SET PROGRAMMING; CONSTRAINT PROGRAMMING; EMPIRICAL EVALUATIONS; GLOBAL CONSTRAINTS; LEARNING TECHNIQUES; PERFORMANCE IMPROVEMENTS; SIMPLE MODELING; SYSTEM FEATURES; TECHNICAL INNOVATION;

CONSTRAINT THEORY;

LOGIC PROGRAMMING;

EID: 84871970450     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068412000142     Document Type: Conference Paper

References (29)

1. ASP Competition. 2011. https://www.mat.unical.it/aspcomp2011/.
2. Balduccini, M. 2009. Representing constraint satisfaction problems in answer set programming. In Workshop ASPOCP'09.
3. Baral, C. 2003. Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press
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. Biere, A., Heule, M., van Maaren, H. and Walsh, T., 2009. Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications. IOS Press
6. Bofill, M., Nieuwenhuis, R., Oliveras, A., Rodr'iguez-Carbonell, E. and Rubio, A. 2008. The barcelogic SMT solver. In Computer Aided Verification. Springer, 294-298.
7. Chinneck, J. and Dravinieks, E. 1991. Locating minimal infeasible constraints sets in linear programs. In ORSA Journal On Computing 3, 157-168. clingcon. http://www.cs.uni-potsdam.de/clingcon
8. Dal Palù, A., Dovier, A., Pontelli, E. and Rossi, G. 2009. Answer set programming with constraints using lazy grounding. See Hill and Warren (2009), 115-129.
9. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann Publishers
10. Drescher, C. and Walsh, T. 2010. A translational approach to constraint answer set solving. In TPLP, vol. 10(4-6). Cambridge University Press, 465-480.
11. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T. and Thiele, S. A user's guide to gringo, clasp, clingo, and iclingo. Available at http://potassco.sourceforge.net
12. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M. and Ziller, S. 2011. A portfolio solver for answer set programming: Preliminary report. In Proceedings of LPNMR'11. Springer, 352-357.
13. Gebser, M., Kaminski, R. and Schaub, T. 2011. Complex optimization in answer set programming: Extended version. Unpublished draft. Available at (metasp
14. Gebser, M., Kaufmann, B., Neumann, A. and Schaub, T. 2007. 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. See Hill and Warren (2009), 235-249. gecode. http://www.gecode.org
16. Gelfond, M. and Lifschitz, V. 1991. Classical negation in logic programs and disjunctive databases. New Generation Computing 9, 365-385.
17. Hill, P. and Warren, D., Eds. 2009. Proceedings of ICLP'09. Springer
18. Janhunen, T., Liu, G. and Niemel̈a, I. 2011. Tight integration of non-ground answer set programming and satisfiability modulo theories. In Proceedings of GTTV'11. 1-13.
19. Junker, U. 2001. QuickXPlain: Conflict detection for arbitrary constraint propagation algorithms. IJCAI'01 Workshop on Modelling and Solving Problems with Constraints
20. Mellarkod, V. and Gelfond, M. 2008. Integrating answer set reasoning with constraint solving techniques. In Proceedings of FLOPS'08. Springer, 15-31. (Pubitemid 351642017)
21. 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. metasp. http://www.cs.uni-potsdam.de/ metasp
22. Mohr, R. and Henderson, T. 1986. Arc and path consistency revisited. Artificial Intelligence 28, 2, 225-233.
23. Niemel̈a, I. 2008. Stable models and difference logic. Annals of Mathematics and Artificial Intelligence 53, 1-4, 313-329.
24. Nieuwenhuis, R., Oliveras, A. and Tinelli, C. 2006. Solving SAT and SMT: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). JACM 53, 6, 937-977. (Pubitemid 46276962)
25. Schulte, C., Tack, G. and Lagerkvist, M. 2012. Modeling. In Modeling and Programming with Gecode, C. Schulte, G. Tack, and M. Lagerkvist. Corresponds to Gecode 3.7.2.
26. Syrj̈anen, T. Lparse 1.0 user's manual. http://www.tcs.hut.fi/ Software/smodels/lparse.ps.gz.
27. Tamura, N., Tanjo, T. and Banbara, M. 2008. System description of a SAT-based CSP solver Sugar. In Third International CSP Solver Competition. 71-75.
28. van Loon, J. 1981. Irreducibly inconsistent systems of linear inequalities. In European Journal of Operational Research. vol. 3. Elsevier Science, 283-288.
29. Yu, Y. and Malik, S. 2006. Lemma learning in SMT on linear constraints. In Theory and Applications of Satisfiability Testing - SAT 2006. Springer, 142-155. (Pubitemid 44531753)