Computing and restoring global inverse consistency in interactive constraint satisfaction
From MaRDI portal
(Redirected from Publication:334804)
Recommendations
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Constraints, consistency and closure
- Generating Corrective Explanations for Interactive Constraint Satisfaction
- The complexity of reasoning with global constraints
- Compiling CSPs into tree-driven automata for interactive solving
Cites work
- scientific article; zbMATH DE number 140384 (Why is no real title available?)
- scientific article; zbMATH DE number 1149402 (Why is no real title available?)
- A sufficient condition for backtrack-bounded search
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Domain filtering consistencies
- From local to global consistency
- Networks of constraints: Fundamental properties and applications to picture processing
- On forward checking for non-binary constraint satisfaction.
- On minimal constraint networks
- Partition search for non-binary constraint satisfaction
- STR2: optimized simple tabular reduction for table constraints
- STR3: a path-optimal filtering algorithm for table constraints
Cited in
(4)- Compiling CSPs into tree-driven automata for interactive solving
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- Generating Corrective Explanations for Interactive Constraint Satisfaction
- Super-reparametrizations of weighted CSPs: properties and optimization perspective
This page was built for publication: Computing and restoring global inverse consistency in interactive constraint satisfaction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334804)
