Local consistency for extended CSPs

DOI10.1016/j.tcs.2009.07.042zbMath1187.68556OpenAlexW2140769824MaRDI QIDQ1035707

Michael J. Maher

Publication date: 4 November 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.07.042

zbMATH Keywords

constraint satisfaction problemconstraint programminglocal consistencyarc consistencypairwise consistency

Mathematics Subject Classification ID

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

Related Items

Contractibility for open global constraints

Uses Software

• CLAIRE
• CHIP
• RealPaver
• Numerica

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interval propagation to reason about sets: Definition and implementation of a practical language
• Temporal constraint networks
• A gentle introduction to Numerica
• Local and global relational consistency
• Introducing global constraints in CHIP
• Networks of constraints: Fundamental properties and applications to picture processing
• On the Desirability of Acyclic Database Schemes
• Algorithm 852
• On the complexity of join dependencies
• A sufficient condition for backtrack-bounded search
• Synthesizing constraint expressions
• Theory and practice of constraint handling rules
• Applying interval arithmetic to real, integer, and boolean constraints
• CLAIRE: combining sets, search and rules to better express algorithms
• Logic programming in the context of multiparadigm programming: the Oz experience
• Generalized constraint propagation over the CLP scheme
• Principles and Practice of Constraint Programming – CP 2003
• Principles and Practice of Constraint Programming – CP 2004