Consistency in networks of relations
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3464885 (Why is no real title available?)
- scientific article; zbMATH DE number 3464890 (Why is no real title available?)
- scientific article; zbMATH DE number 3449757 (Why is no real title available?)
- scientific article; zbMATH DE number 3421895 (Why is no real title available?)
- A Multistage Solution of the Template-Layout Problem
- A Theorem on Boolean Matrices
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
- Networks of constraints: Fundamental properties and applications to picture processing
- Nondeterministic Algorithms
- Proving Properties of Programs by Structural Induction
- REF-ARF: A system for solving problems stated as procedures
- Scene Labeling by Relaxation Operations
- Some simplified NP-complete graph problems
Cited in
(only showing first 100 items - show all)- Propagation algorithms for lexicographic ordering constraints
- Non-local configuration of component interfaces by constraint satisfaction
- Dynamic algorithms for classes of constraint satisfaction problems
- Constraint propagation techniques for the disjunctive scheduling problem
- Propositional calculus problems in CHIP
- Decomposing a relation into a tree of binary relations
- STR3: a path-optimal filtering algorithm for table constraints
- Short term scheduling and control in the batch process industry using hybrid knowledge based simulation
- Parsing as non-Horn deduction
- Safe starting regions by fixed points and tightening
- Properties of tree convex constraints
- Optimization in temporal qualitative constraint networks
- General game playing with stochastic CSP
- Theoretical analysis of singleton arc consistency and its extensions
- A survey of constraint-based programming paradigms
- Local and global relational consistency
- An algebraic characterization of tractable constraints
- Solving linear, min and max constraint systems using CLP based on relational interval arithmetic
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- The fixed point property for ordered sets
- Solving the minimum-weighted coloring problem
- Path consistency in clp(FD)
- Qualitative simulation
- View-based propagator derivation
- A Dempster-Shafer approach for recognizing machine features from CAD models
- The essence of constraint propagation
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Using constraint metaknowledge to reduce arc consistency computation
- On point-duration networks for temporal reasoning
- MiniCP: a lightweight solver for constraint programming
- An algorithm-independent measure of progress for linear constraint propagation
- Constraint retraction in FD
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Image interpretation with a conceptual graph: labeling over-segmented images and detection of unexpected objects
- Solving connected row convex constraints by variable elimination
- Portfolio approaches for constraint optimization problems
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- From MDD to BDD and arc consistency
- On a new extension of BTP for binary CSPs
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Backtracking algorithms for disjunctions of temporal constraints
- Forward checking and intelligent backtracking
- Parallel consistent labeling algorithms
- Some fundamental properties of local constraint propagation
- Dynamic Analysis of Bounds Versus Domain Propagation
- Enhanced multiple-point statistical simulation with backtracking, forward checking and conflict-directed backjumping
- Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation
- Modelling and solving temporal reasoning as propositional satisfiability
- STR2: optimized simple tabular reduction for table constraints
- Interval propagation to reason about sets: Definition and implementation of a practical language
- A condensed semantics for qualitative spatial reasoning about oriented straight line segments
- Qualitative reasoning about relative direction of oriented points
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- Undirected forest constraints
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- The power of linear programming for general-valued CSPs
- A fuzzy constraint based model for bilateral, multi-issue negotiations in semi-competitive environments
- A probabilistic approach to solving crossword puzzles
- Enhancing set constraint solvers with lexicographic bounds
- Qualitative reasoning with directional relations
- Local search with constraint propagation and conflict-based heuristics
- A fine-grained arc-consistency algorithm for non-normalized constraint satisfaction problems
- Constructive generation of very hard 3-colorability instances
- Binary vs. non-binary constraints
- Propagation engine prototyping with a domain specific language
- Temporal constraint networks
- Bracketing backward reach sets of a dynamical system
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- Tractable constraints on ordered domains
- Branch \& Sample: A simple strategy for constraint satisfaction
- A unified theory of structural tractability for constraint satisfaction problems
- Arc consistency for factorable relations.
- Optimization of a recursive conveyor by reduction to a constraint satisfaction problem
- The transformational creativity hypothesis
- A conservative scheme for parallel interval narrowing
- Network-based heuristics for constraint-satisfaction problems
- Twenty-one large tractable subclasses of Allen's algebra
- Localized planning with action-based constraints
- From local to global consistency
- Underconstrained knowledge-intensive constraint satisfaction search
- No more ``Partial and ``Full Looking Ahead
- Planning parallel actions
- Solving multi-granularity temporal constraint networks
- Reasoning about qualitative temporal information
- Constraints, consistency and closure
- Characterising tractable constraints
- Decomposing constraint satisfaction problems using database techniques
- Recognition mechanisms for schema-based knowledge representations
- Arc-consistency for continuous variables
- Dualities and dual pairs in Heyting algebras
- Qualitative representation of positional information
- On topological consistency and realization
- Timetable planning using the constraint-based reasoning
- The complexity of constraint satisfaction revisited
- A constraint programming-based approach to the crew scheduling problem of the Taipei mass rapid transit system
- NACRE -- a nogood and clause reasoning engine
- scientific article; zbMATH DE number 1759706 (Why is no real title available?)
- Constraint reasoning
This page was built for publication: Consistency in networks of relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1231783)
