Sciweavers

230 search results - page 8 / 46
» Constraint Satisfaction with Delayed Evaluation
Sort
View
ECAI
2010
Springer
13 years 10 months ago
Restarts and Nogood Recording in Qualitative Constraint-based Reasoning
Abstract. This paper introduces restart and nogood recording techniques in the domain of qualitative spatial and temporal reasoning. Nogoods and restarts can be applied orthogonall...
Matthias Westphal, Stefan Wölfl, Jason Jingsh...
STACS
2009
Springer
14 years 4 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
FLAIRS
2006
13 years 11 months ago
Full Restart Speeds Learning
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...
Smiljana Petrovic, Susan L. Epstein
FLAIRS
2004
13 years 11 months ago
Concurrent Backtrack Search on DisCSPs
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
Roie Zivan, Amnon Meisels
CSCLP
2008
Springer
13 years 11 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin