Reasoning from last conflict(s) in constraint programming

@article{Lecoutre2009ReasoningFL,
  title={Reasoning from last conflict(s) in constraint programming},
  author={Christophe Lecoutre and L. Sais and S{\'e}bastien Tabary and V. Vidal},
  journal={Artif. Intell.},
  year={2009},
  volume={173},
  pages={1592-1614}
}
Constraint programming is a popular paradigm to deal with combinatorial problems in artificial intelligence. Backtracking algorithms, applied to constraint networks, are commonly used but suffer from thrashing, i.e. the fact of repeatedly exploring similar subtrees during search. An extensive literature has been devoted to prevent thrashing, often classified into look-ahead (constraint propagation and search heuristics) and look-back (intelligent backtracking and learning) approaches. In this… Expand
Conflict Ordering Search for Scheduling Problems
TLDR
A new generic scheme to guide backtrack search, called Conflict Ordering Search (COS), that reorders variables on the basis of conflicts that happen during search, that remembers the last variables on which search decisions failed. Expand
Parallelization of TSP Solving in CP
TLDR
Bound-Backtrack-and-Dive is presented, a method which solves the problem of Travelling Salesman Problem by running a sequential solving of the problem with a bounded number of backtracks and decomposing with EPS using that information rather than LCFirst. Expand
Objective as a Feature for Robust Search Strategies
TLDR
This paper defines an objective-based function, to monitor the objective bounds modifications and to extract information, which is the main feature to design a new variable selection heuristic, whose results validate human intuitions about the objective modifications. Expand
Dead-End Elimination for Weighted CSP
TLDR
This work presents a simplified dominance breaking constraint, called restricted dead-end elimination (DEEr), the worst-case time complexity of which is in O(ned2), and shows that maintaining DEEr during a depth-first branch and bound (DFBB) search is often faster than maintaining PSNSr and always faster than or similar to DFBB alone. Expand
Anytime Hybrid Best-First Search with Tree Decomposition for Weighted CSP
TLDR
Both HBFS and BTD-HBFS improve both anytime and overall performance compared to their counterparts, and are shown to perform on par with methods like limited discrepancy search and frequent restarting. Expand
Adaptive and Opportunistic Exploitation of Tree-Decompositions for Weighted CSPs
TLDR
This work proposes to exploit new decompositions for solving the constraint optimization problem and uses them in a more dynamic manner in the sense that the solving of a subproblem would be based on the decomposition, totally or locally, only when it seems to be useful. Expand
Soft arc consistency revisited
TLDR
This paper extends the notion of arc consistency by allowing fractional weights and by allowing several arc consistency operations to be applied simultaneously and shows that an optimal arc consistency closure can theoretically be determined in polynomial time by reduction to linear programming. Expand
On the use of graphs within constraint-programming
TLDR
This PhD thesis is about the use of graphs within constraint-programming, in order to improve its scalability and suggests a generic schema, relying on a graph structure, to dynamically decompose filtering algorithms. Expand
The salesman and the tree: the importance of search in CP
TLDR
A natural generalization of the weighted cycle constraint (WCC) to the DCMSTP is introduced and it is shown that significant improvement can be achieved via the graph interpretation of the state-of-the-art Last Conflict heuristic. Expand
Parallel Stochastic Portfolio Search for Constraint Solving
  • K. Liu, Sven Löffler, P. Hofstedt
  • Computer Science
  • 2019 IEEE Intl Conf on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom)
  • 2019
TLDR
This paper investigates the techniques of existing single-solver-based portfolio approach in detail and gains insight into how to improve the portfolio approach, and presents the parallel stochastic portfolio search that benefits from the explicit early diversity resulted from randomization and parallelism. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 57 REFERENCES
Conflict-Directed Backjumping Revisited
TLDR
This paper shows that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant, and empirically shows that adding CBJ to a backtracking algorithm that maintains generalized arc consistency (GAC), an algorithm that is referred to as GAC-CBJ, can still provide orders of magnitude speedups. Expand
Increasing Tree Search Efficiency for Constraint Satisfaction Problems
TLDR
Analytically and experimentally show that a lookahead procedure called forward checking which employs the most likely to fail principle performs better than standard backtracking, Ullman's, Waltz's, Mackworth's, and Haralick's discrete relaxation in all cases tested, and better than Gaschnig's backmarking in the larger problems. Expand
Maintaining Arc-Consistency within Dynamic Backtracking
TLDR
Experiments show that mac-dbt is able to solve very large problems and that it remains very stable as the size of the problems increases, and it outperforms mac on the structured problems the authors have randomly generated. Expand
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM
TLDR
This paper presents an approach that allows base algorithms to be combined, giving us new hybrids, and it is shown that FC‐CBJ is by far the best of the algorithms examined. Expand
Extending Forward Checking
TLDR
This paper presents a general approach to extending constraint propagating algorithms, especially forward checking, and provides a simple yet flexible mechanism for pruning domain values, and shows that with this in place it becomes easy to utilize new mechanisms for detecting inconsistent values during search. Expand
Boosting Systematic Search by Weighting Constraints
TLDR
A dynamic and adaptive variable ordering heuristic which guides systematic search toward inconsistent or hard parts of a Constraint Satisfaction Problem (CSP) and which avoids some trashing by first instantiating variables involved in the constraints that have frequently participated in dead-end situations. Expand
Stubborness: A Possible Enhancement for Backjumping and Nogood Recording
TLDR
The Conflict directed Backjumping (CBJ) algorithm at-tempts to reduce the number of nodes visited within the constraintsatisfaction problem by analyzing failures by analyze failures in the CSP solved itself. Expand
Contradicting Conventional Wisdom in Constraint Satisfaction
TLDR
Evidence contradicting both pieces of conventional wisdom is presented, and renewed consideration of an approach which fully maintains arc consistency during backtrack search is suggested. Expand
Handbook of Constraint Programming
TLDR
Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas. Expand
Using CSP Look-Back Techniques to Solve Real-World SAT Instances
TLDR
The results show that incorporating CSP look-back techniques renders easy many problems which otherwise are beyond DP's reach, and recommend that such techniques be included as options in implementations of DP, just as they are in systematic algorithms for the more general constraint satisfaction problem. Expand
...
1
2
3
4
5
...