Constraint relaxation may be perfect

DOI10.1016/0004-3702(91)90059-SzbMath1117.68495MaRDI QIDQ2384384

Ugo Montanari, Francesca Rossi

Publication date: 20 September 2007

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

Mathematics Subject Classification ID

68T30: Knowledge representation

Related Items

Dynamic algorithms for classes of constraint satisfaction problems, Tractable constraints on ordered domains, Graph rewriting for a partial ordering semantics of concurrent constraints programming, The logic of constraint satisfaction, Constraints, consistency and closure, Fast parallel constraint satisfaction, Characterising tractable constraints, Model-based inference in CHARME., A new tractable class of constraint satisfaction problems, Constraints in vision. Outline of a set-theoretic approach., The essence of constraint propagation, Guaranteed non-linear estimation using constraint propagation on sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-based heuristics for constraint-satisfaction problems
• Consistency in networks of relations
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• Networks of constraints: Fundamental properties and applications to picture processing
• Nonserial dynamic programming: On the optimal strategy of variable elimination for the rectangular lattice
• Nonserial dynamic programming
• Graph expressions and graph rewritings
• A Sufficient Condition for Backtrack-Free Search
• Synthesizing constraint expressions