Sciweavers

33 search results - page 1 / 7
» Global propagation of side constraints for solving over-cons...
Sort
View
ANOR
2011
96views more  ANOR 2011»
13 years 1 months ago
Global propagation of side constraints for solving over-constrained problems
This article deals with the resolution of over-constrained problems using constraint programming, which often imposes to add to the constraint network new side constraints. These ...
Thierry Petit, Emmanuel Poder
PRICAI
2004
Springer
14 years 7 days ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...
CP
2001
Springer
13 years 11 months ago
New Lower Bounds of Constraint Violations for Over-Constrained Problems
In recent years, many works have been carried out to solve over-constrained problems, and more speci cally the Maximal Constraint Satisfaction Problem (Max-CSP), where the goal is ...
Jean-Charles Régin, Thierry Petit, Christia...
CPAIOR
2009
Springer
14 years 1 months ago
Open Constraints in a Boundable World
Open forms of global constraints allow the addition of new variables to an argument during the execution of a constraint program. Such forms are needed for difficult constraint pro...
Michael J. Maher
ICLP
1997
Springer
13 years 11 months ago
Solving Small TSPs with Constraints
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
Yves Caseau, François Laburthe