Sciweavers

Share
CP
2005
Springer
10 years 18 days ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
CP
2005
Springer
10 years 18 days ago
Evolving Variable-Ordering Heuristics for Constrained Optimisation
In this paper we present and evaluate an evolutionary approach for learning new constraint satisfaction algorithms, specifically for MAX-SAT optimisation problems. Our approach of...
Stuart Bain, John Thornton, Abdul Sattar
CP
2005
Springer
10 years 18 days ago
A Linear-Logic Semantics for Constraint Handling Rules
One of the attractive features of the Constraint Handling Rules (CHR) programming language is its declarative semantics where rules are read as formulae in first-order predicate l...
Hariolf Betz, Thom W. Frühwirth
CP
2005
Springer
10 years 4 months ago
Search and Inference in AI Planning
While Planning has been a key area in Artificial Intelligence since its beginnings, significant changes have occurred in the last decade as a result of new ideas and a more estab...
Hector Geffner
CP
2005
Springer
10 years 4 months ago
Dynamic Ordering for Asynchronous Backtracking on DisCSPs
An algorithm that performs asynchronous backtracking on distributed CSPs, with dynamic ordering of agents is proposed, ABT DO. Agents propose reorderings of lower priority agents a...
Roie Zivan, Amnon Meisels
CP
2005
Springer
10 years 4 months ago
Applying Decomposition Methods to Crossword Puzzle Problems
Abstract. In this paper, we investigate the performance of several existing structural decomposition methods on fully interlocked Crossword Puzzle Problems (CPPs) and draw directio...
Yaling Zheng, Berthe Y. Choueiry
CP
2005
Springer
10 years 4 months ago
Approximate Constrained Subgraph Matching
Stéphane Zampelli, Yves Deville, Pierre Dup...
CP
2005
Springer
10 years 4 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
Benjamin W. Wah, Yixin Chen
CP
2005
Springer
10 years 4 months ago
Robust Constraint Solving Using Multiple Heuristics
Abstract. Constraint Programming is a proven successful technique, but it requires skill in modeling problems, and knowledge on how algorithms interact with models. What can be a g...
Alfio Vidotto, Kenneth N. Brown, J. Christopher Be...
books