A comparison of CLP(FD) and ASP solutions to NP-complete problems

Lecture Notes in Computer Science

Volumn 3668, Issue , 2005, Pages 67-82

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

^a UNIVERSITY OF UDINE   (Italy)

^b UNIVERSITY OF L'AQUILA   (Italy)

^c NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS PROGRAMMING; ENCODING (SYMBOLS); LOGIC PROGRAMMING; PROBLEM SOLVING;

ANSWER SET PROGRAMMING (ASP); CONSTRAINT LOGIC PROGRAMMING (CLP); DECLARATIVE ENCODINGS; FINITE DOMAINS;

COMPUTATIONAL COMPLEXITY;

EID: 27144559454     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11562931_8     Document Type: Conference Paper

References (24)

1. C. Anger, T. Schauß, and M. Truszczyński. ASPARAGUS - the Dagstuhl Initiative. ALP Newsletter, 17(3), 2004.
2. C. Baral. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, 2003.
3. P. Clote and R. Backofen. Computational Molecular Biology. Wiley & Sons, 2001.
4. P. Crescenzi et al. On the complexity of protein folding. In STOC, pages 597-603, 1998.
5. A. Dal Palù, A. Dovier, and F. Fogolari. Constraint logic programming approach to protein structure prediction. BMC Bioinformatics, 5(186):1-12, 2004.
6. D. Diaz and P. Codognet. Design and Implementation of the GNU Prolog System. Journal of Functional and Logic Programming 2001(6), 2001.
7. A. Dovier, A. Formisano, and E. Pontelli. A comparison of CLP(FD) and ASP solutions to combinatorial problems. www.di.univaq.it/~formisano/CLPASP
8. I. Elkabani, E. Pontelli, and T. C. Son. SModels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP. In ICLP, 73-89, 2004.
9. E. Erdem and V. Lifschitz. Tight Logic Programs. In TPLP, 3:499-518, 2003.
10. A. J. Fernandez and P. M. Hill. A Comparative Study of 8 Constraint Programming Languages Over the Boolean and Finite Domains. Constraints, 5(3):275-301, 2000.
11. M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In ICLP, pages 1070-1080, MIT Press, 1988.
12. E. Giunchiglia, Y. Lierler, and M. Maratea. SAT-Based Answer Set Programming. In Proc. of AAAI'04, pages 61-66, AAAI/Mit Press, 2004.
13. J. Jaffar and M. J. Maher. Constraint Logic Programming: A Survey. J. of Logic Programming, 19/20:503-581, 1994.
14. Y. Lierler and M. Maratea. CModels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In LPNMR, pages 346-350. Springer Verlag, 2004.
15. V. Lifschitz. Answer Set Planning. In Logic Programming and Non-monotonic Reasoning, pages 373-374. Springer Verlag, 1999.
16. F. Lin and Y. Zhao. ASSAT: Computing Answer Sets of A Logic Program By SAT Solvers. In Proc. of AAAI'02, pages 112-117. AAAI/MIT Press, 2002.
17. V. W. Marek and M. Truszczyriski. Autoepistemic Logic. JACM, 38(3):588-619, 1991.
18. V. W. Marek and M. Truszczynski. Stable models and an alternative logic programming paradigm. The Logic Programming Paradigm, 375-398. Springer, 1999.
19. K. Marriott and P. J. Stuckey. Programming with Constraints. MIT Press, 1998.
20. M. Wallace, J. Schimpf, K. Shen, and W. Harvey. On Benchmarking Constraint Logic Programming Platforms. Constraints, 9(1):5-34, 2004.
21. E. W. Weisstein. Schur Number. From MathWorld-A Wolfram Web Resource. mathworld.wolfram.com/SchurNumber.html.
22. Web references for some ASP solvers. 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.
23. Web references for some CLP(FD) implementations. SICStus Prolog: www.sics.se/isl/sicstuswww/site/index.html. B-Prolog: www.probp.com. ECLiPSe: www.icparc.ic.ac.uk/eclipse. GNU Prolog: pauillac. inria.fr/~diaz/gnu-prolog.
24. Web site of COLOR02/03/04: Graph Coloring and its Applications: http://mat.gsia.cmu.edu/COLORING03.