Fine-grained conflict resolution in constraint satisfaction problems

DOI10.1080/095281398146897MaRDI QIDQ4420771zbMATH OpenOpenAlexFDO

Authors Walter Hower, Stephan Jacobi

Publication date 1998

Published in Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/095281398146897

zbMATH Keywords

Constraint relaxation

Mathematics Subject Classification ID

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

Recommendations

• Constraint relaxation may be perfect
• Constraint updating
• scientific article; zbMATH DE number 1059310
• Constraint propagation for ordering, abstraction, and aggregation relations
• scientific article; zbMATH DE number 4166931

Cites work

• Constraint satisfaction -- algorithms and complexity analysis
• Constraint updating
• Exploiting the deep structure of constraint problems
• Tractable constraints on ordered domains

Cited in

(7)

• Reasoning from last conflict(s) in constraint programming
• Revisiting global constraint satisfaction
• Constraint relaxation may be perfect
• Capturing Conflict and Confusion in CSP
• scientific article; zbMATH DE number 1059310 (Why is no real title available?)
• Constraint updating
• Conflict resolution: a first-order resolution calculus with decision literals and conflict-driven clause learning

This page was built for publication: Fine-grained conflict resolution in constraint satisfaction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420771)