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.

An Empirical Study of Constraint Logic Programming and Answer Set Programming Solutions of Combinatorial Problems

FORMISANO, Andrea;
2009

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 in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/119370
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 39
  • ???jsp.display-item.citation.isi??? 20
social impact