Abstract
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming (CLP) over finite domains. The objective is to identify how the solvers in the two domains respond to different problems, highlighting strengths and weaknesses of their implementations and suggesting criteria for choosing one approach versus the other. Ultimately, the work in this paper is expected to lay the ground for transfer of concepts between the two domains (e.g., suggesting ways to use CLP in the execution of ASP).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Anger, C., Schauß, T., Truszczyński, M.: ASPARAGUS – the Dagstuhl Initiative. ALP Newsletter 17(3) (2004)
Baral, C.: Knowledge representation, reasoning and declarative problem solving. Cambridge University Press, Cambridge (2003)
Clote, P., Backofen, R.: Computational Molecular Biology. Wiley & Sons, Chichester (2001)
Crescenzi, P., et al.: On the complexity of protein folding. In: STOC, pp. 597–603 (1998)
Dal Palù, A., Dovier, A., Fogolari, F.: Constraint logic programming approach to protein structure prediction. BMC Bioinformatics 5(186), 1–12 (2004)
Diaz, D., Codognet, P.: Design and Implementation of the GNU Prolog System. Journal of Functional and Logic Programming 2001(6) (2001)
Dovier, A., Formisano, A., Pontelli, E.: A comparison of CLP(FD) and ASP solutions to combinatorial problems, www.di.univaq.it/~formisano/CLPASP
Elkabani, I., Pontelli, E., Son, T.C.: SModels with CLP and Its Applications: A Simple and Effective Approach to Aggregates in ASP. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 73–89. Springer, Heidelberg (2004)
Erdem, E., Lifschitz, V.: Tight Logic Programs. In: TPLP, vol. 3, pp. 499–518 (2003)
Fernandez, A.J., Hill, P.M.: A Comparative Study of 8 Constraint Programming Languages Over the Boolean and Finite Domains. Constraints 5(3), 275–301 (2000)
Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: ICLP, pp. 1070–1080. MIT Press, Cambridge (1988)
Giunchiglia, E., Lierler, Y., Maratea, M.: SAT-Based Answer Set Programming. In: Proc. of AAAI 2004, pp. 61–66. AAAI/Mit Press (2004)
Jaffar, J., Maher, M.J.: Constraint Logic Programming: A Survey. J. of Logic Programming 19/20, 503–581 (1994)
Lierler, Y., Maratea, M.: CModels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)
Lifschitz, V.: Answer Set Planning. In: Logic Programming and Non-monotonic Reasoning, pp. 373–374. Springer, Heidelberg (1999)
Lin, F., Zhao, Y.: ASSAT: Computing Answer Sets of A Logic Program By SAT Solvers. In: Proc. of AAAI 2002, pp. 112–117. AAAI/MIT Press, Cambridge (2002)
Marek, V.W., Truszczyński, M.: Autoepistemic Logic. JACM 38(3), 588–619 (1991)
Marek, V.W., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm, pp. 375–398. Springer, Heidelberg (1999)
Marriott, K., Stuckey, P.J.: Programming with Constraints. MIT Press, Cambridge (1998)
Wallace, M., Schimpf, J., Shen, K., Harvey, W.: On Benchmarking Constraint Logic Programming Platforms. Constraints 9(1), 5–34 (2004)
Weisstein, E.W.: Schur Number. From MathWorld–A Wolfram Web Resource, mathworld.wolfram.com/SchurNumber.html
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
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
Web site of COLOR02/03/04: Graph Coloring and its Applications: http://mat.gsia.cmu.edu/COLORING03
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dovier, A., Formisano, A., Pontelli, E. (2005). A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In: Gabbrielli, M., Gupta, G. (eds) Logic Programming. ICLP 2005. Lecture Notes in Computer Science, vol 3668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562931_8
Download citation
DOI: https://doi.org/10.1007/11562931_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29208-1
Online ISBN: 978-3-540-31947-4
eBook Packages: Computer ScienceComputer Science (R0)