Constraint relaxation may be perfect

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

Francesca Rossi, Ugo Montanari

Publication date: 20 September 2007

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

Mathematics Subject Classification ID

Knowledge representation (68T30)

Related Items

Fast parallel constraint satisfaction ⋮ Model-based inference in CHARME. ⋮ From chaotic iteration to constraint propagation ⋮ An algebraic characterization of tractable constraints ⋮ The essence of constraint propagation ⋮ Graph rewriting for a partial ordering semantics of concurrent constraints programming ⋮ The logic of constraint satisfaction ⋮ Dynamic algorithms for classes of constraint satisfaction problems ⋮ A new tractable class of constraint satisfaction problems ⋮ An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects ⋮ Tractable constraints on ordered domains ⋮ Tractable constraints on ordered domains ⋮ Constraints in vision. Outline of a set-theoretic approach. ⋮ Constraints, consistency and closure ⋮ Fast parallel constraint satisfaction ⋮ Characterising tractable constraints ⋮ 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