Constraint reasoning
From MaRDI portal
Publication:6602253
DOI10.1007/978-3-030-06167-8_6zbMATH Open1547.68702MaRDI QIDQ6602253FDOQ6602253
Authors: Christian Bessiere
Publication date: 11 September 2024
Recommendations
Cites Work
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- Handbook of constraint programming.
- Consistency in networks of relations
- A Sufficient Condition for Backtrack-Free Search
- The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory
- Principles and Practice of Constraint Programming – CP 2004
- Itemset mining: a constraint programming perspective
- Reformulation of global constraints based on constraints checkers
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Network-based heuristics for constraint-satisfaction problems
- Constraints, consistency and closure
- Constraint satisfaction over connected row-convex constraints
- Decomposing constraint satisfaction problems using database techniques
- Characterising tractable constraints
- A comparison of structural CSP decomposition methods
- Partition search for non-binary constraint satisfaction
- The complexity of reasoning with global constraints
- An optimal coarse-grained arc consistency algorithm
- Domain filtering consistencies
- STR2: optimized simple tabular reduction for table constraints
- On the minimality and global consistency of row-convex constraint networks
- Arc consistency and friends
- A Simple Algorithm for Mal'tsev Constraints
- Tractable constraints on ordered domains
- Propagation via lazy clause generation
- A new approach to computing optimal schedules for the job-shop scheduling problem
- Optimal speedup of Las Vegas algorithms
- Networks of constraints: Fundamental properties and applications to picture processing
- A language and a program for stating and solving combinatorial problems
- Radio link frequency assignment
- Tree clustering for constraint networks
- Backtrack Programming
- Principles and Practice of Constraint Programming – CP 2004
- Consistency restoration and explanations in dynamic CSPs---Application to configuration
- STR3: a path-optimal filtering algorithm for table constraints
- A sufficient condition for backtrack-bounded search
- Constrained clustering by constraint programming
- Open constraint programming
- MDD propagation for sequence constraints
- Local and global relational consistency
- Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
- Empirical decision model learning
- Synthesizing constraint expressions
- Using constraint metaknowledge to reduce arc consistency computation
- REF-ARF: A system for solving problems stated as procedures
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Title not available (Why is that?)
- Statistical regimes across constrainedness regions
- The power of propagation: when GAC is enough
This page was built for publication: Constraint reasoning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602253)