An experimental comparison of constraint logic programming and answer set programming

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2007, Pages 1622-1625

  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

[No Author keywords available]

Indexed keywords

DECLARATIVE ENCODINGS; HIGHLIGHTING STRENGTHS; PROGRAMMING PARADIGMS; SET PROGRAMMINGS;

CONSTRAINT THEORY; ENCODING (SYMBOLS); OPTIMIZATION; PROBLEM SOLVING;

LOGIC PROGRAMMING;

EID: 36348994808     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Anger, C.; Schaub, T.; and Truszczyński, M. 2004. ASPARAGUS - the Dagstuhl Initiative. ALP Newsletter 17(3).
2. Baral, C. 2003. Knowledge representation, reasoning and declarative problem solving. Cambridge University Press.
3. Davis, M.; Logemann, G.; and Loveland, D. 1962. A machine program for theorem-proving. Comm. ofthe ACM 5:394-397.
4. Dovier, A.; Formisano, A.; and Pontelli, E. 2005. A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. Int. Conference on Logic Progr., 67-82. Springer.
5. Elkabani, I.; Pontelli, E.; and Son, T. C. 2004. Smodels with CLP and its applications. Int. Conf. Logic Progr., Springer, 73-89.
6. Fernández, A., and Hill, P. M. 2000. A comparative study of eight constraint programming languages over the Boolean and Finite Domains. Constraints 5:275-301.
7. Gelfond, M., and Lifschitz, V. 1988. The Stable Model Semantics for Logic Programming. Int. Conf. on Logic Progr., MIT Press, 1070-1080.
8. Giunchiglia, E. et al. 2006. Answer set programming based on prepositional satisfiability. J. Automat. Reason. 36(4):345-377.
9. Jaffar, J., and Maher, M. J. 1994. Constraint Logic Programming: A Survey. J. of Logic Progr. 19/20:503-581.
10. Lee, J., and Lifschitz, V. 2003. Loop formulas for disjunctive logic programs. Int. Conf. Logic Progr., Springer, 451-465.
11. Lifschitz, V., and Razborov, A. A. 2006. Why are there so many loop formulas? ACM-TOCL 7(2):261-268.
12. Marek, V., and Truszczynski, M. 1991. Autoepistemic Logic. JACM 38(3):588-619.
13. Marriott, K., and Stuckey, P. J. 1998. Programming with Constraints. The MIT Press.
14. Moskewicz, M. W. et al. 2001. Chaff: Engineering an efficient SAT solver. DAC-01, ACM Press, 530-535.
15. Pontelli, E.; Son, T.; and Elkhatib, O. 2006. A Tool for Knowledge Base Integration and Querying. AAAI Spring Symposium.
16. Simons, P. 2000. Extending and Implementing the Stable Model Semantics. Ph.D. Dissertation, Helsinki Univ. Technology.
17. Wallace, M. et al. 2004. On benchmarking constraint logic programming platforms. Constraints 9:5-34.