Sciweavers

232 search results - page 21 / 47
» Implementing logical connectives in constraint programming
Sort
View
144
Voted
SLP
1994
121views more  SLP 1994»
15 years 4 months ago
CLP(Intervals) Revisited
The design and implementation of constraint logic programming (CLP) languages over intervals is revisited. Instead of decomposing complex constraints in terms of simple primitive ...
Frédéric Benhamou, David A. McAllest...
129
Voted
CP
2005
Springer
15 years 9 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
Magnus Ågren, Pierre Flener, Justin Pearson
144
Voted
ECOOP
2010
Springer
15 years 6 months ago
Verifying Executable Object-Oriented Specifications with Separation Logic
Specifications of Object-Oriented programs conventionally employ Boolean expressions of the programming language for assertions. Programming errors can be discovered by checking at...
Stephan van Staden, Cristiano Calcagno, Bertrand M...
115
Voted
ICLP
2005
Springer
15 years 9 months ago
A Type System for CHR
Abstract. We propose a generic type system for the Constraint Handling Rules (CHR), a rewriting rule language for implementing constraint solvers. CHR being a high-level extension ...
Emmanuel Coquery, François Fages
131
Voted
ICLP
2005
Springer
15 years 9 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli