Evaluating ASP and commercial solvers on the CSPLib
type: Item
instance of: scholarly article
title: Evaluating ASP and commercial solvers on the CSPLib
zbMATH Open document ID: 1179.90287
author: Toni Mancini
author: Davide Micaletto
author: Fabio Patrizi
author: Marco Cadoli
published in: Constraints
publication date: 2009-05-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5559827
zbMATH Keywords: declarative constraint modelling
zbMATH Keywords: constraint programming
zbMATH Keywords: problem reformulation
zbMATH Keywords: experimental evaluation among solvers
zbMATH Keywords: answer set programming
zbMATH Keywords: OPL
describes a project that uses: AMPL
describes a project that uses: CPLEX
describes a project that uses: Cmodels
describes a project that uses: ASSAT
describes a project that uses: CSPLib
describes a project that uses: Oz
MaRDI profile type: Publication
full work available at URL: s10601-007-9028-6
OpenAlex ID: W1980107758
cites work: Constraint programming and hybrid formulations for three life designs
cites work: Automated reformulation of specifications by safe delay of constraints
cites work: Compiling problem specifications into SAT
cites work: Building and solving mathematical programming models in engineering and science
cites work: Increasing constraint propagation by redundant modeling: An experience report
cites work: Logic Programming
cites work: A comparative study of eight constraint programming languages over the Boolean and finite domains
cites work: A theory of abstraction
cites work: Q4375757
cites work: The DLV system for knowledge representation and reasoning
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: ASSAT: computing answer sets of a logic program by SAT solvers
cites work: Exploiting functional dependencies in declarative problem specifications
cites work: A comparison of complete global optimization solvers
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Q2767022
cites work: Global Optimization and Constraint Satisfaction
cites work: Computer science today. Recent trends and developments
cites work: 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''
cites work: Permutation Problems and Channelling Constraints
DOI: 10.1007/S10601-007-9028-6
description: scientific article; zbMATH DE number 5559827