STTT
2010
13 years 6 months ago
2010
ion/refinement solvers1 Andreas Bauer , Martin Leucker , Christian Schallhart , Michael Tautschnig Computer Sciences Laboratory, Australian National University Institut f
IJCAI
2001
14 years 25 days ago
2001
Constraint propagation is the main feature of any constraint solver. This is thus of prime importance to manage constraint propagation as efficiently as possible, justifying the us...
FLAIRS
2006
14 years 25 days ago
2006
Because many real-world problems can be represented and solved as constraint satisfaction problems, the development of effective, efficient constraint solvers is important. A solv...
ERSHOV
2006
Springer
14 years 3 months ago
2006
Springer
We integrate a logic programming language into Meta-S, a flexible and extendable constraint solver cooperation system, by treating resolution as constraint solver. This new approac...
ECAI
2006
Springer
14 years 3 months ago
2006
Springer
Abstract. We present Minion, a new constraint solver. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits....
CP
2006
Springer
14 years 3 months ago
2006
Springer
Efficient constraint propagation is crucial to any constraint solver. We show that watched literals, already a great success in the satisfiability community, can be used to provide...
PLILP
1994
Springer
14 years 3 months ago
1994
Springer
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
ICLP
1993
Springer
14 years 3 months ago
1993
Springer
nt an abstract instruction set for a constraint solver over finite domains, which can be smoothly integrated in the WAM architecture. It is based on the use of a single primitive...
EPIA
1993
Springer
14 years 3 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
AGP
1998
IEEE
14 years 3 months ago
1998
IEEE
We compare two (apparently) rather different set-based constraint languages, and we show that, in spite of their different origins and aims, there are large classes of constraint ...