#### DMCA

## Evaluating asp and commercial solvers on the CSPLib (preliminary work (2006)

### Cached

### Download Links

Venue: | In WLP |

Citations: | 1 - 1 self |

### Citations

483 |
AMPL: A Modeling Language for
- Fourer, Gay, et al.
- 2003
(Show Context)
Citation Context ...o the design and development of 1) General purpose constraint modelling and programming languages (e.g., opl [23], xpressmp3, gams [5], etc.), and 2) Languages based on specific solvers, such as ampl =-=[12]-=- (an interface to mathematical programming solvers), dlv [13], smodels [17], assat [15] (which translate into an instance of ASP – Answer Set Programming), NP-Spec [4] (which translates into an instan... |

456 | The DLV system for knowledge representation and reasoning.
- Leone, Pfeifer, et al.
- 2006
(Show Context)
Citation Context ... modelling and programming languages (e.g., opl [23], xpressmp3, gams [5], etc.), and 2) Languages based on specific solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv =-=[13]-=-, smodels [17], assat [15] (which translate into an instance of ASP – Answer Set Programming), NP-Spec [4] (which translates into an instance of SAT). This paper focuses on the last class of solvers, ... |

389 | Logic programs with stable model semantics as a constraint programming paradigm.
- Niemela
- 1999
(Show Context)
Citation Context ... programming languages (e.g., opl [23], xpressmp3, gams [5], etc.), and 2) Languages based on specific solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv [13], smodels =-=[17]-=-, assat [15] (which translate into an instance of ASP – Answer Set Programming), NP-Spec [4] (which translates into an instance of SAT). This paper focuses on the last class of solvers, which are high... |

314 | The Oz Programming Model.
- Smolka
- 1995
(Show Context)
Citation Context ... solvers. Comparison among different solvers for CP has already been addressed in the literature: in particular, we cite [10] and [24] where Solver is compared to other CP languages such as, e.g., oz =-=[22]-=-, claire6, and various Prolog-based systems. Moreover, some benchmark suites have been proposed, cf., e.g., the COCONUT one [20]. Also on the ASP side, which has been the subject of much research in t... |

260 | Assat: computing answer sets of a logic program by sat solvers.
- Lin, Zhao
- 2004
(Show Context)
Citation Context ... languages (e.g., opl [23], xpressmp3, gams [5], etc.), and 2) Languages based on specific solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv [13], smodels [17], assat =-=[15]-=- (which translate into an instance of ASP – Answer Set Programming), NP-Spec [4] (which translates into an instance of SAT). This paper focuses on the last class of solvers, which are highly declarati... |

252 |
The OPL optimization programming language.
- Hentenryck
- 1999
(Show Context)
Citation Context ...as C++, Java, or Prolog. At the same time, the need for a higher level of abstraction led to the design and development of 1) General purpose constraint modelling and programming languages (e.g., opl =-=[23]-=-, xpressmp3, gams [5], etc.), and 2) Languages based on specific solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv [13], smodels [17], assat [15] (which translate into... |

198 | Symmetry-breaking predicates for search problems. In:
- Crawford, Ginsberg, et al.
- 1996
(Show Context)
Citation Context ... http://www.csplib.org. As for symmetry-breaking, given the high abstraction level of the languages, an immediately usable form of reformulation is through the addition of new constraints (cf., e.g., =-=[8, 11]-=-). Since previous studies [19] showed that this technique is effective when simple formulae are added, it is interesting to know –for each class of solvers– what is the amount of symmetry breaking tha... |

172 | Compiling constraints in clp(FD),
- Codognet, Diaz
- 1996
(Show Context)
Citation Context ...etc.) or translating in a format suitable for Integer Programming solvers (e.g., Ilog Cplex1), has been challenged by the use of libraries for Constraint Programming (CP), e.g., Ilog Solver2, CLP(FD) =-=[7]-=-, interfaced through general purpose programming languages such as C++, Java, or Prolog. At the same time, the need for a higher level of abstraction led to the design and development of 1) General pu... |

115 | Breaking row and column symmetry in matrix models.
- Flener, Frisch, et al.
- 2002
(Show Context)
Citation Context ... http://www.csplib.org. As for symmetry-breaking, given the high abstraction level of the languages, an immediately usable form of reformulation is through the addition of new constraints (cf., e.g., =-=[8, 11]-=-). Since previous studies [19] showed that this technique is effective when simple formulae are added, it is interesting to know –for each class of solvers– what is the amount of symmetry breaking tha... |

90 | Cmodels-2: Sat-based answer set solver enhanced to non-tight programs, in:
- Lierler, Maratea
- 2004
(Show Context)
Citation Context ...er of analyzed problems, in order to cover a large part of the CSPLib, following the methodology described in this paper, as well as to extend the analysis to other ASP systems, in particular cmodels =-=[14]-=-, which uses SAT, and is known to be very efficient in many cases (cf., e.g., [9]). Next, we plan to extend the set of refomulations by also exploiting: (i) Safe delay of constraints, (ii) Implied con... |

74 | Increasing constraint propagation by redundant modeling: an experience report.
- Cheng, Choi, et al.
- 1999
(Show Context)
Citation Context ...tes is very common in declarative programming, especially when the user needs to store partial results, to maintain intermediate states, or wants to make the so-called redundant modelling (cf., e.g., =-=[6, 2]-=-). Although, in general, the use of auxiliary predicates increases the size of the search space, in some cases this results in a simplification of complex constraints and in a reduction of the number ... |

43 | Compiling problem specifications into SAT
- Cadoli, Schaerf
(Show Context)
Citation Context ... specific solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv [13], smodels [17], assat [15] (which translate into an instance of ASP – Answer Set Programming), NP-Spec =-=[4]-=- (which translates into an instance of SAT). This paper focuses on the last class of solvers, which are highly declarative, and characterized by the possibility of decoupling the specification of a pr... |

36 | Using auxiliary variables and implied constraints to model non-binary problems
- Smith, Stergiou, et al.
- 2000
(Show Context)
Citation Context ... symmetry-breaking, but make also some discussions about the role of global constraints and auxiliary predicates. Other reformulation techniques, e.g., the addition of implied constraints (cf., e.g., =-=[21]-=-), safe-delay of constraints [1], and the addition of procedural aspects, e.g., search strategies, are subject of current work. As for symmetry-breaking, for each problem we identify its structural sy... |

31 | A comparative study of eight constraint programming languages over the Boolean and finite domains,
- Fernández, Hill
- 2000
(Show Context)
Citation Context ...e of knowledge on the good practices in modelling for some important classes of solvers. Comparison among different solvers for CP has already been addressed in the literature: in particular, we cite =-=[10]-=- and [24] where Solver is compared to other CP languages such as, e.g., oz [22], claire6, and various Prolog-based systems. Moreover, some benchmark suites have been proposed, cf., e.g., the COCONUT o... |

30 | Benchmarking global optimization and constraint satisfaction codes
- Shcherbina, Neumaier
- 2003
(Show Context)
Citation Context ...d [24] where Solver is compared to other CP languages such as, e.g., oz [22], claire6, and various Prolog-based systems. Moreover, some benchmark suites have been proposed, cf., e.g., the COCONUT one =-=[20]-=-. Also on the ASP side, which has been the subject of much research in the recent years, some benchmark suites have been proposed in order to facilitate the task of evaluating improvements of their la... |

26 | A comparison of CLP(FD) and ASP solutions to NP-complete problems.
- Dovier, Formisano, et al.
- 2005
(Show Context)
Citation Context ...d technologies, and in evaluating the relative impact of different features and modelling techniques. In particular, very few papers compare ASP solvers to state-of-the-art systems for CP (cf., e.g., =-=[9, 18]-=-). In Section 5 we briefly relate our work with such papers. In this research we consider the CSPLib problem library for our experiments. CSPLib is a collection of 45 problems, and is widely known in ... |

20 | Automated reformulation of specifications by safe delay of constraints, Artif Intell 170(8-9
- Cadoli, Mancini
- 2006
(Show Context)
Citation Context ... some discussions about the role of global constraints and auxiliary predicates. Other reformulation techniques, e.g., the addition of implied constraints (cf., e.g., [21]), safe-delay of constraints =-=[1]-=-, and the addition of procedural aspects, e.g., search strategies, are subject of current work. As for symmetry-breaking, for each problem we identify its structural symmetries, i.e., those that depen... |

18 | Detecting and breaking symmetries by reasoning on problem specifications.
- Mancini, Cadoli
- 2005
(Show Context)
Citation Context ...urrent work. As for symmetry-breaking, for each problem we identify its structural symmetries, i.e., those that depend on the problem structure, and not on the particular instance (along the lines of =-=[16]-=-), and exploit them by adding further constraints to the specification (the so-called symmetrybreaking constraints). Since symmetries can be broken in several ways, we define different high-level symm... |

18 | Breaking instance-independent symmetries in exact graph coloring.
- Ramani, Aloul, et al.
- 2004
(Show Context)
Citation Context ...mmetry-breaking, given the high abstraction level of the languages, an immediately usable form of reformulation is through the addition of new constraints (cf., e.g., [8, 11]). Since previous studies =-=[19]-=- showed that this technique is effective when simple formulae are added, it is interesting to know –for each class of solvers– what is the amount of symmetry breaking that can be added to the model, a... |

16 | Exploiting functional dependencies in declarative problem specifications
- Mancini, Cadoli
(Show Context)
Citation Context ...tes is very common in declarative programming, especially when the user needs to store partial results, to maintain intermediate states, or wants to make the so-called redundant modelling (cf., e.g., =-=[6, 2]-=-). Although, in general, the use of auxiliary predicates increases the size of the search space, in some cases this results in a simplification of complex constraints and in a reduction of the number ... |

11 | Logic Programming approaches for representing and solving Constraint Satisfaction Problems: A comparison
- Pelov, Mot, et al.
- 2000
(Show Context)
Citation Context ...d technologies, and in evaluating the relative impact of different features and modelling techniques. In particular, very few papers compare ASP solvers to state-of-the-art systems for CP (cf., e.g., =-=[9, 18]-=-). In Section 5 we briefly relate our work with such papers. In this research we consider the CSPLib problem library for our experiments. CSPLib is a collection of 45 problems, and is widely known in ... |

9 |
On benchmarking constraint logic programming platforms. Response to Fernandez and Hill’s “A comparative study of eight constraint programming languages over the Boolean and finite domains”.
- Wallace, Schimpf, et al.
- 2004
(Show Context)
Citation Context ...ledge on the good practices in modelling for some important classes of solvers. Comparison among different solvers for CP has already been addressed in the literature: in particular, we cite [10] and =-=[24]-=- where Solver is compared to other CP languages such as, e.g., oz [22], claire6, and various Prolog-based systems. Moreover, some benchmark suites have been proposed, cf., e.g., the COCONUT one [20]. ... |

8 |
as an Effective Solving Technology for Constraint Problems
- SAT
- 2006
(Show Context)
Citation Context ...y of them are described only in natural language, this work also provides, as a side-effect, formal specifications of such problems in the modelling languages adopted by some solvers. In related work =-=[3]-=-, we model a number of problems from the same library in the language NP-Spec [4]. Ultimately, we plan to provide (and eventually make publicly available) specifications for several solvers, covering ... |

6 | SAT as an effective solving technology for constraint problems - Cadoli, Mancini, et al. |

4 | Compiling problem specifications into - Cadoli, Schaerf |

2 |
Automated reformulation of speci by safe delay of constraints
- Cadoli, Mancini
- 2004
(Show Context)
Citation Context ... some discussions about the role of global constraints and auxiliary predicates. Other reformulation techniques, e.g., the addition of implied constraints (cf., e.g., [21]), safe-delay of constraints =-=[1]-=-, and the addition of procedural aspects, e.g., search strategies, are subject of current work. As for symmetry-breaking, for each problem we identify its structural symmetries, i.e., those that depen... |

1 |
Compiling problem speci into SAT
- Cadoli, Schaerf
(Show Context)
Citation Context ...n specic solvers, such as ampl [12] (an interface to mathematical programming solvers), dlv [13], smodels [17], assat [15] (which translate into an instance of ASP { Answer Set Programming), NP-Spec =-=[4]-=- (which translates into an instance of SAT). This paper focuses on the last class of solvers, which are highly declarative, and characterized by the possibility of decoupling the specication of a pro... |