Skip to main content
padlock icon - secure page this page is secure

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

Buy Article:

$60.00 + tax (Refund Policy)

This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in Answer Set Programming (ASP) and Constraint Logic Programming over Finite Domains (CLP(FD)). The objective is to investigate how solvers in the two domains respond to different problems, highlighting the strengths and weaknesses of their implementations, and suggesting criteria for choosing one approach over the other. Ultimately, the work in this paper is expected to lay the foundations for a transfer of technology between the two domains, for example by suggesting ways to use CLP(FD) in the execution of ASP.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
No Metrics

Keywords: combinatorial problems; constraint solving; logic programming

Document Type: Research Article

Affiliations: 1: Dipartimento di Matematica e Informatica, Universita di Udine, 33100 Udine, Italy 2: Dipartimento di Matematica e Informatica, Universita di Perugia, 06123 Perugia, Italy 3: Department of Computer Science, New Mexico State University, Las Cruces, NM 88003-8001, USA

Publication date: June 1, 2009

More about this publication?
  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more