Using constraint metaknowledge to reduce arc consistency computation

DOI10.1016/S0004-3702(98)00105-2zbMath0911.68192OpenAlexW1994652641MaRDI QIDQ1277773

Eugene C. Freuder, Jean-Charles Régin, Christian Bessiere

Publication date: 2 March 1999

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00105-2

zbMATH Keywords

constraint satisfactionarc consistency

Mathematics Subject Classification ID

Knowledge representation (68T30) Parallel algorithms in computer science (68W10)

Related Items (11)

Reformulation of global constraints based on constraints checkers ⋮ Theoretical analysis of singleton arc consistency and its extensions ⋮ On the speed of constraint propagation and the time complexity of arc consistency testing ⋮ An optimal coarse-grained arc consistency algorithm ⋮ Constraint satisfaction -- algorithms and complexity analysis ⋮ A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems ⋮ Integrating operations research in constraint programming ⋮ Integrating operations research in constraint programming ⋮ Constraint propagation techniques for the disjunctive scheduling problem ⋮ STR3: a path-optimal filtering algorithm for table constraints ⋮ Backjump-based backtracking for constraint satisfaction problems

Cites Work

• Unnamed Item
• Arc consistency for factorable relations.
• A generic arc-consistency algorithm and its specializations
• Consistency in networks of relations
• The complexity of constraint satisfaction revisited
• Synthesizing constraint expressions

This page was built for publication: Using constraint metaknowledge to reduce arc consistency computation