Loading...
Please wait, while we are loading the content...
Similar Documents
An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems.
| Content Provider | CiteSeerX |
|---|---|
| Author | Dovier, Agostino Pontelli, Enrico Formisano, Andrea |
| Abstract | This paper presents experimental comparisons between the declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Programming over finite domains (CLP(FD)). The objective is to investigate 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 foundations for transfer of technology between the two domains, e.g., suggesting ways to use CLP(FD) in the execution of ASP. |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Constraint Logic Programming Answer Set Programming Solution Hard Problem Answer Set Programming Experimental Comparison Finite Domain Empirical Study Different Problem Combinatorial Problem Declarative Encoding |
| Content Type | Text |
| Resource Type | Article |
