Tractable constraints on ordered domains

DOI10.1016/0004-3702(95)00107-7OpenAlexW2016639451MaRDI QIDQ5925572

Peter G. Jeavons, Martin C. Cooper

Publication date: 21 September 2022

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

Full work available at URL: https://doi.org/10.1016/0004-3702(95)00107-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)

Related Items

An algebraic characterization of tractable constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Network-based heuristics for constraint-satisfaction problems
• From local to global consistency
• A generic arc-consistency algorithm and its specializations
• Structure identification in relational data
• Consistency in networks of relations
• Fast parallel constraint satisfaction
• Decomposing constraint satisfaction problems using database techniques
• Characterising tractable constraints
• Networks of constraints: Fundamental properties and applications to picture processing
• Constraint relaxation may be perfect
• A sufficient condition for backtrack-bounded search
• The complexity of satisfiability problems