From local to global consistency

DOI10.1016/0004-3702(92)90043-WzbMath0762.68053OpenAlexW2030985429MaRDI QIDQ1193482

Rina Dechter

Publication date: 27 September 1992

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

Full work available at URL: https://doi.org/10.1016/0004-3702(92)90043-w

zbMATH Keywords

reasoningconstraint networkslocal consistencymaintenance of consistent databases

Mathematics Subject Classification ID

Related Items (34)

Reduction operations in fuzzy or valued constraint satisfaction ⋮ On point-duration networks for temporal reasoning ⋮ Tractability in constraint satisfaction problems: a survey ⋮ Fast parallel constraint satisfaction ⋮ Model-based inference in CHARME. ⋮ Computing and restoring global inverse consistency in interactive constraint satisfaction ⋮ On minimal constraint networks ⋮ An automata-theoretic approach to constraint LTL ⋮ Incremental elicitation of Choquet capacities for multicriteria choice, ranking and sorting problems ⋮ Revisiting global constraint satisfaction ⋮ Ideal Membership Problem over 3-Element CSPs with Dual Discriminator Polymorphism ⋮ From local to global consistency in temporal constraint networks ⋮ Local and global relational consistency ⋮ On tree-preserving constraints ⋮ Processing disjunctions in temporal constraint networks ⋮ Hybrid Tractable Classes of Constraint Problems ⋮ Quantified Constraints in Twenty Seventeen ⋮ Constraint satisfaction -- algorithms and complexity analysis ⋮ On bijunctive predicates over a finite set ⋮ Combinatorial problems raised from 2-semilattices ⋮ Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning ⋮ Tractable constraints on ordered domains ⋮ Tractable constraints on ordered domains ⋮ On m-Junctive Predicates on a Finite Set ⋮ Constraints, consistency and closure ⋮ Linear-time temporal logics with Presburger constraints: an overview ★ ⋮ HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results ⋮ Backtracking algorithms for disjunctions of temporal constraints ⋮ On weak positive predicates over a finite set ⋮ A new approach to cyclic ordering of 2D orientations using ternary relation algebras ⋮ A Logical Approach to Constraint Satisfaction ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ Fast parallel constraint satisfaction ⋮ Characterising tractable constraints

Cites Work

• Maintaining knowledge about temporal intervals
• Network-based heuristics for constraint-satisfaction problems
• Tree clustering for constraint networks
• An optimal k-consistency algorithm
• Consistency in networks of relations
• Networks of constraints: Fundamental properties and applications to picture processing
• A Sufficient Condition for Backtrack-Free Search
• Synthesizing constraint expressions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: From local to global consistency