An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems

DOI10.1080/09528130701538174zbMath1193.68073OpenAlexW2014205104MaRDI QIDQ3638568

Andrea Formisano, Enrico Pontelli, Agostino Dovier

Publication date: 27 October 2009

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09528130701538174

zbMATH Keywords

combinatorial problemslogic programmingconstraint solving

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Logic programming (68N17)

Related Items (5)

RASP and ASP as a fragment of linear logic ⋮ Weight constraint programs with evaluable functions ⋮ Unnamed Item ⋮ A job-shop scheduling approach for optimising sugarcane rail operations ⋮ Multivalued action languages with constraints in CLP(FD)

Uses Software

• ASSAT
• Cmodels
• Smodels
• Prolog
• Chaff

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains
• ASSAT: computing answer sets of a logic program by SAT solvers
• Answer set programming based on propositional satisfiability
• A comparative study of eight constraint programming languages over the Boolean and finite domains
• Autoepistemic logic
• Logic Programming
• Why are there so many loop formulas?
• Logic Programming
• Theory and Applications of Satisfiability Testing
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving

This page was built for publication: An empirical study of constraint logic programming and answer set programming solutions of combinatorial problems