Reasoning from last conflict(s) in constraint programming

DOI10.1016/j.artint.2009.09.002zbMath1185.68645OpenAlexW2011292059MaRDI QIDQ1045989

Sébastien Tabary, Christophe Lecoutre, Lakhdar Saïs, Vincent Vidal

Publication date: 21 December 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2009.09.002

zbMATH Keywords

planningconstraint satisfactionnogoodsconflictsintelligent backtracking

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

The salesman and the tree: the importance of search in CP ⋮ Tractability-preserving transformations of global cost functions ⋮ Improving the robustness of EPS to solve the TSP ⋮ Virtual pairwise consistency in cost function networks ⋮ Approximate Counting with Deterministic Guarantees for Affinity Computation ⋮ Computational protein design as an optimization problem ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ Soft arc consistency revisited ⋮ Explanation-based weighted degree ⋮ Reasoning from last conflict(s) in constraint programming

Uses Software

• PDDL
• QUICKXPLAIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random constraint satisfaction: easy generation of hard (satisfiable) instances
• Reasoning from last conflict(s) in constraint programming
• Radio link frequency assignment
• Branching and pruning: An optimal temporal POCL planner based on constraint programming
• An optimal coarse-grained arc consistency algorithm
• STRIPS: A new approach to the application of theorem proving to problem solving
• Locating the phase transition in binary constraint satisfaction problems
• Search Heuristics and Heavy-Tailed Behaviour
• 2 -Way vs.d -Way Branching for CSP
• New methods to color the vertices of a graph
• Principles and Practice of Constraint Programming – CP 2003
• Random constraint satisfaction: Flaws and structure

This page was built for publication: Reasoning from last conflict(s) in constraint programming