A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems | Zendy

Agostino Dovier | Zendy; Andrea Formisano | Zendy; Enrico Pontelli | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems

Author(s) -

Agostino Dovier,

Andrea Formisano,

Enrico Pontelli

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-29208-X

DOI - 10.1007/11562931_8

Subject(s) - answer set programming , computer science , implementation , programming language , logic programming , constraint programming , set (abstract data type) , theoretical computer science , constraint logic programming , strengths and weaknesses , constraint (computer aided design) , logic program , constraint satisfaction , mathematical optimization , artificial intelligence , mathematics , philosophy , geometry , epistemology , stochastic programming , probabilistic logic

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)

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research