Evaluating ASP and commercial solvers on the CSPLib

DOI10.1007/s10601-007-9028-6zbMath1179.90287OpenAlexW1980107758MaRDI QIDQ1020490

Toni Mancini, Davide Micaletto, Marco Cadoli, Fabio Patrizi

Publication date: 29 May 2009

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-007-9028-6

zbMATH Keywords

constraint programminganswer set programmingproblem reformulationdeclarative constraint modellingexperimental evaluation among solversOPL

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (5)

On the separability of subproblems in Benders decompositions ⋮ Design and results of the Fifth Answer Set Programming Competition ⋮ MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* ⋮ Compiling finite domain constraints to SAT withBEE ⋮ Evaluating ASP and commercial solvers on the CSPLib

Uses Software

• ASSAT
• AMPL
• CPLEX
• CSPLib
• Cmodels
• Oz

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
• Evaluating ASP and commercial solvers on the CSPLib
• Exploiting functional dependencies in declarative problem specifications
• A theory of abstraction
• Increasing constraint propagation by redundant modeling: An experience report
• A comparative study of eight constraint programming languages over the Boolean and finite domains
• A comparison of complete global optimization solvers
• Constraint programming and hybrid formulations for three life designs
• Computer science today. Recent trends and developments
• Logic programs with stable model semantics as a constraint programming paradigm
• Automated reformulation of specifications by safe delay of constraints
• Compiling problem specifications into SAT
• Permutation Problems and Channelling Constraints
• The DLV system for knowledge representation and reasoning
• Logic Programming and Nonmonotonic Reasoning
• Logic Programming
• Global Optimization and Constraint Satisfaction

This page was built for publication: Evaluating ASP and commercial solvers on the CSPLib