Sciweavers

AGI
2008
14 years 29 days ago
Learning from Inconsistencies in an Integrated Cognitive Architecture
Whereas symbol
Kai-Uwe Kühnberger, Peter Geibel, Helmar Gust...
ECAI
2008
Springer
14 years 1 months ago
The Impact of Constraint Programming
Constraint satisfaction problems (CSPs) are ubiquitous in many real-world contexts. However, modeling a problem as a CSP can be very challenging, usually requiring considerable ex...
Pascal Van Hentenryck
CSCLP
2008
Springer
14 years 1 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
CP
2008
Springer
14 years 1 months ago
Classes of Submodular Constraints Expressible by Graph Cuts
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...
Stanislav Zivný, Peter Jeavons
CIKM
2008
Springer
14 years 1 months ago
A SQL database system for solving constraints
This demonstration presents the concepts, design, and implementation of SCDE, a relational database systems extended with the ability to solve constraint satisfaction problems (CS...
Sebastien Siva, Lesi Wang
AIMSA
2008
Springer
14 years 1 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz
FLAIRS
2007
14 years 1 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
FLAIRS
2007
14 years 1 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
AAAI
2007
14 years 1 months ago
Using Expectation Maximization to Find Likely Assignments for Solving CSP's
We present a new probabilistic framework for finding likely variable assignments in difficult constraint satisfaction problems. Finding such assignments is key to efficient sea...
Eric I. Hsu, Matthew Kitching, Fahiem Bacchus, She...
ECAI
2000
Springer
14 years 3 months ago
Solving Permutation Constraint Satisfaction Problems with Artificial Ants
Abstract. We describe in this paper Ant-P-solver, a generic constraint solver based on the Ant Colony Optimization (ACO) metaheuristic. The ACO metaheuristic takes inspiration on t...
Christine Solnon