Synthesizing constraint expressions
From MaRDI portal
Cited in
(53)- Local consistency for extended CSPs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Constraint propagation with interval labels
- Some fundamental properties of local constraint propagation
- Tree clustering for constraint networks
- An optimal k-consistency algorithm
- Revisiting global constraint satisfaction
- Temporal constraint networks
- From local to global consistency
- A generic arc-consistency algorithm and its specializations
- Reasoning about qualitative temporal information
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Using constraint metaknowledge to reduce arc consistency computation
- Decomposing constraint satisfaction problems using database techniques
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Problem solving by searching for models with a theorem prover
- Improving the efficiency of a hyperlinking-based theorem prover by incremental evaluation with network structures
- Interactive scheduling as a constraint satisfiability problem
- From local to global consistency in temporal constraint networks
- Local and global relational consistency
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- Backtracking algorithms for disjunctions of temporal constraints
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras
- Constraint propagation techniques for the disjunctive scheduling problem
- Backjump-based backtracking for constraint satisfaction problems
- Accelerating filtering techniques for numeric CSPs
- Compiling constraint satisfaction problems
- On tree-preserving constraints
- Reduction operations in fuzzy or valued constraint satisfaction
- CoLab: A hybrid knowledge representation and compilation laboratory
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Constraint relaxation may be perfect
- Theoretical analysis of singleton arc consistency and its extensions
- Properties of tree convex constraints
- Modelling and solving temporal reasoning as propositional satisfiability
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- A constraint programming primer
- The combinatorics of object recognition in cluttered environments using constrained search
- Implicates and prime implicates in random 3-SAT
- On the CSP Dichotomy Conjecture
- RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†
- Learning solution preferences in constraint problems
- Handling contingency in temporal constraint networks: from consistency to controllabilities
- A review of tree convex sets test
- The power of linear programming for general-valued CSPs
- A Logical Approach to Constraint Satisfaction
- Interpolation coding: A representation for numbers in neural models
- Dynamic algorithms for classes of constraint satisfaction problems
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Constraint reasoning
- Constraint satisfaction -- algorithms and complexity analysis
- A logic language for combinatorial optimization
- Reasoning about cardinal directions between extended objects
This page was built for publication: Synthesizing constraint expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4167597)
