CLP(FD) and normal logic programs in the context of Answer Set Programming are perhaps the two main declarative approaches to modeling and solving NP-complete problems. In this paper, we compare the encoding style and computational results for the two paradigms, studying some NP-complete problems.
A comparison of CLP(FD) and ASP solutions to NP-complete problems
FORMISANO, Andrea;
2005
Abstract
CLP(FD) and normal logic programs in the context of Answer Set Programming are perhaps the two main declarative approaches to modeling and solving NP-complete problems. In this paper, we compare the encoding style and computational results for the two paradigms, studying some NP-complete problems.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.