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

Agostino Dovier, Andrea Formisano, Enrico Pontelli. A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems. In Maurizio Gabbrielli, Gopal Gupta, editors, Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings. Volume 3668 of Lecture Notes in Computer Science, pages 67-82, Springer, 2005. [doi]

@inproceedings{DovierFP05,
  title = {A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems},
  author = {Agostino Dovier and Andrea Formisano and Enrico Pontelli},
  year = {2005},
  doi = {10.1007/11562931_8},
  url = {http://dx.doi.org/10.1007/11562931_8},
  tags = {completeness},
  researchr = {https://researchr.org/publication/DovierFP05},
  cites = {0},
  citedby = {0},
  pages = {67-82},
  booktitle = {Logic Programming, 21st International Conference, ICLP 2005, Sitges, Spain, October 2-5, 2005, Proceedings},
  editor = {Maurizio Gabbrielli and Gopal Gupta},
  volume = {3668},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-29208-X},
}