An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

Journal of Experimental and Theoretical Artificial Intelligence

Volumn 21, Issue 2, 2009, Pages 79-121

  Dovier, Agostino ^a   Formisano, Andrea ^b   Pontelli, Enrico ^c  

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

^c New Mexico State University   (United States)

Author keywords

Combinatorial problems; Constraint solving; Logic programming

Indexed keywords

ANSWER SET PROGRAMMING; COMBINATORIAL PROBLEM; COMBINATORIAL PROBLEMS; CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SOLVING; DECLARATIVE ENCODINGS; EMPIRICAL STUDIES; EXPERIMENTAL COMPARISON; FINITE DOMAINS; HARD PROBLEMS; TRANSFER OF TECHNOLOGY; TWO DOMAINS;

FINITE DIFFERENCE METHOD; LOGIC PROGRAMMING;

COMPUTER PROGRAMMING LANGUAGES;

EID: 67651222010     PISSN: 0952813X     EISSN: 13623079     Source Type: Journal    
DOI: 10.1080/09528130701538174     Document Type: Article

References (39)

1. Anger, C., Schaub, T., and Truszczynski, M. (2004), 'ASPARAGUS - the Dagstuhl Initiative', ALP Newsletter, 17. Available at http://www.logicprogramming.org
2. Baral, C. (2003), Knowledge Representation, Reasoning and Declarative Problem Solving, Cambridge, UK: Cambridge University Press.
3. Clote, P., and Backofen, R. (2001), Computational Molecular Biology, New York: Wiley.
4. Crescenzi, P., Goldman, D., Papadimitriou, C.H., Piccolboni, A., and Yannakakis, M. (1998), 'On the Complexity of Protein Folding', Journal of Computational Biology, 5, 423-466.
5. Dal Palú, A., Dovier, A., and Fogolari, F. (2004), 'Constraint Logic Programming Approach to Protein Structure Prediction', BMC Bioinformatics, 5, 1-12.
6. Davis, M., Logemann, G., and Loveland, D. (1962), 'A Machine Program for Theorem Proving', Communications of the ACM, 5, 394-397.
7. Davis, M., and Putnam, H. (1960), 'A Computing Procedure for Quantification Theory', Journal of the ACM, 7, 201-215.
8. Diaz, D., and Codognet, P. (2001), 'Design and Implementation of the GNU-Prolog System', Journal of Functional and Logic Programming, 6.
9. Dovier, A., Formisano, A., and Pontelli, E. (2005), 'A Comparison of CLP(FD) and ASP in Tackling Hard Combinatorial Problems'. www.di.univaq.it/ formisano/CLPASP.
10. Elkabani, I., Pontelli, E., and Son, T.C. (2004), 'Smodels with CLP and its Applications: A Simple and Effective Approach to Aggregates in ASP', in Proceedings of ICLP04, pp. 73-89.
11. Elkhatib, O., Pontelli, E., and Son, T.C. (2004), 'A Tool for Reasoning About Answer Sets in Prolog', in Proceedings of PADL, pp. 148-162.
12. Erdem, E., and Lifschitz, V. (2004), 'Tight Logic Programs', TPLP (Vol 3), pp. 499-518.
13. Fernandez, A.J., and Hill, P.M. (2000), 'A Comparative Study of 8 Constraint Programming Languages Over the Boolean and Finite domains', Constraints, 5, 275-301.
14. Gelfond, M. (2002), 'Representing Knowledge in A-Prolog', Computational Logic: Logic Programming and Beyond, 2408, 413-451.
15. Gelfond, M., and Lifschitz, V. (1988), 'The Stable Model Semantics for Logic Programming', in Proceedings of ICLP88, MIT Press, Boston, MA, pp. 1070-1080.
16. Gelfond, M., and Lifschitz, V. (1998), 'Action Languages', Electronic Transactions on Artificial Intelligence, 2, 193-210.
17. Giunchiglia, E., Lierler, Y., and Maratea, M. (2004), 'SAT-based Answer Set Programming', in Proceedings of AAAI'04, pp. 61-66.
18. Giunchiglia, E., Lierler, Y., and Maratea, M. (2006), 'Answer Set Programming Based on Propositional Satisfiability', Journal of Automated Reasoning, 36, 345-377.
19. Jaffar, J., and Maher, M.J. (1994), 'Constraint Logic Programming: A Survey', Journal of Logic Programming, 19/20, 503-581.
20. Lee, J., and Lifschitz, V. (2003), 'Loop Formulas for Disjunctive Logic Programs', in Proceedings of ICLP03, pp. 451-465.
21. Lierler, Y., and Maratea, M. (2004), 'CMODELS-2: SAT-based Answer Set Solver Enhanced to Nontight Programs', in Proceedings of LPNMR04, pp. 346-350.
22. Lifschitz, V. (1999), 'Answer Set Planning', in Proceedings of ICLP99, pp. 23-37.
23. Lifschitz, V., and Razborov, A. (2006), 'Why Are There so Many Loop Formulas?', ACM Transactions on Computational Logic, 7, 261-268.
24. Lin, F., and Zhao, Y. (2004), 'ASSAT: Computing Answer Sets of a Logic Program by SAT Solvers', in Proceedings of AAAI'02, pp. 112-117.
25. Marek, V.W., and Truszczyński, M. (1991), 'Autoepistemic Logic', Journal of the ACM, 38, 588-619.
26. Marek, V.W., and Truszczyński, M. (1999), 'Stable Models and an Alternative Logic Programming Paradigm', in The Logic Programming Paradigm, Berlin: Springer Verlag, pp. 375-398.
27. Marriott, K., and Stuckey, P.J. (1998), Programming with Constraints, Boston, MA: MIT Press.
28. Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., and Malik, S. (2001), 'Chaff: Engineering an Efficient SAT Solver', in Proceedings of Design Automation Conference, pp. 530-535.
29. Papadimitriou, C.H. (1994), Computational Complexity, Upper Saddle River, NJ: Addison Wesley.
30. Prestwich, S.D. (2003), 'Local Search on SAT-encoded Colouring Problems', in Proceedings of SAT 2003, 6th International Conference, pp. 105-119.
31. Simons, P. (2000), 'Extending and Implementing the Stable Model Semantics', Doctoral dissertation, Helsinki University of Technology, Helsinki, Finland.
32. Son, T.C., Baral, C., and McIlraith, S. (2003), 'Planning with Different Forms of Domain-dependent Control Knowledge - An Answer Set Programming Approach', in Proceedings of LPNMR01, pp. 226-239.
33. Thielscher, M. (2002), 'Reasoning about Actions with CHRs and Finite Domain Constraints', in Proceedings of ICLP02, pp. 70-84.
34. Wallace, M., Schimpf, J., Shen, K., and Harvey, W. (2004), 'On Benchmarking Constraint Logic Programming Platforms', Constraints, 9, 5-34.
35. Weisstein, E.W. (2005), 'Schur Number'. mathworld.wolfram.com/ SchurNumber.html
36. Websites of ASP Solver ASSAT: assat.cs.ust.hk. CCalc: www.cs.utexas.edu/users/ tag/cc. Cmodels: www.cs.utexas.edu/users/tag/cmodels. DeReS and aspps: www.cs.uky.edu/ai. DLV: www.dbai.tuwien.ac.at/proj/dlv. Smodels: www.tcs.hut.fi/Software/smodels
37. Websites of CLP(FD) implementation SICStu Prolog: www.sics.se/isl/ sicstuswww/site/ index.html. B-Prolog: www.probp.com. ECLiPSe: eclipse.crosscoreoptimiza-tion.com. GNU-Prolog: pauillac.inria.fr/ diaz/gnu-prolog
38. Websites for some SAT solver mChaff and zChaff: www.princeton.edu/ chaff/soft-ware.html. Simo: www.star.dist.unige.it/ sim/simo/
39. Website of COLOR02/03/04: Graph Coloring and its Applications. URL: mat.gsia.cmu.edu/ COLORING03