Consistency in networks of relations
From MaRDI portal
Publication:1231783
DOI10.1016/0004-3702(77)90007-8zbMATH Open0341.68061DBLPjournals/ai/Mackworth77OpenAlexW2135432705WikidataQ63090281 ScholiaQ63090281MaRDI QIDQ1231783
Publication date: 1977
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(77)90007-8
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Theorem on Boolean Matrices
- Some simplified NP-complete graph problems
- Nondeterministic Algorithms
- Networks of constraints: Fundamental properties and applications to picture processing
- Scene Labeling by Relaxation Operations
- Proving Properties of Programs by Structural Induction
- REF-ARF: A system for solving problems stated as procedures
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
- A Multistage Solution of the Template-Layout Problem
Cited In (only showing first 100 items - show all)
- Constraint propagation techniques for the disjunctive scheduling problem
- STR3: a path-optimal filtering algorithm for table constraints
- Properties of tree convex constraints
- Theoretical analysis of singleton arc consistency and its extensions
- Optimization in temporal qualitative constraint networks
- General game playing with stochastic CSP
- A survey of constraint-based programming paradigms
- Qualitative simulation
- \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
- The essence of constraint propagation
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- MiniCP: a lightweight solver for constraint programming
- A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem
- Asynchronous aggregation and consistency in distributed constraint satisfaction
- Portfolio approaches for constraint optimization problems
- Forward checking and intelligent backtracking
- Modelling and solving temporal reasoning as propositional satisfiability
- Interval propagation to reason about sets: Definition and implementation of a practical language
- STR2: optimized simple tabular reduction for table constraints
- A condensed semantics for qualitative spatial reasoning about oriented straight line segments
- Qualitative reasoning about relative direction of oriented points
- A REVIEW OF TREE CONVEX SETS TEST
- SUNNY: a Lazy Portfolio Approach for Constraint Solving
- Qualitative reasoning with directional relations
- Tractable constraints on ordered domains
- Temporal constraint networks
- Fundamental properties of neighbourhood substitution in constraint satisfaction problems
- A unified theory of structural tractability for constraint satisfaction problems
- Network-based heuristics for constraint-satisfaction problems
- A conservative scheme for parallel interval narrowing
- Localized planning with action-based constraints
- From local to global consistency
- 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
- Qualitative representation of positional information
- On topological consistency and realization
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras
- Computing improved optimal solutions to max-min flexible constraint satisfaction problems
- Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
- A new tractable class of constraint satisfaction problems
- Solving weighted CSP by maintaining arc consistency
- Resource-constrained project scheduling: Notation, classification, models, and methods
- \textsc{NeVer}: a tool for artificial neural networks verification
- Partition search for non-binary constraint satisfaction
- A hybrid soft computing approach for subset problems
- New algorithms for bidirectional singleton arc consistency
- Domain filtering consistencies for non-binary constraints
- Domain permutation reduction for constraint satisfaction problems
- An optimal coarse-grained arc consistency algorithm
- Combinatorial problems raised from 2-semilattices
- The job shop scheduling problem: Conventional and new solution techniques
- Random constraint satisfaction: easy generation of hard (satisfiable) instances
- Domain consistency with forbidden values
- Multiset variable representations and constraint propagation
- Abstracting soft constraints: framework, properties, examples
- Consistency checking within local search applied to the frequency assignment with polarization problem
- Modularity-based decompositions for valued CSP
- Efficient algorithms for singleton arc consistency
- Spatial reasoning with rectangular cardinal relations. The convex tractable subalgebra
- Reduction operations in fuzzy or valued constraint satisfaction
- Efficient handling of universally quantified inequalities
- Interval propagation and search on directed acyclic graphs for numerical constraint solving
- Constraint propagation with interval labels
- Constraint propagation as information maximization
- Constraint satisfaction problems: Algorithms and applications
- A generic arc-consistency algorithm and its specializations
- Disjunctions, independence, refinements
- A branch and bound algorithm for numerical Max-CSP
- On the parallel complexity of discrete relaxation in constraint satisfaction networks
- Affine systems of equations and counting infinitary logic
- On the arc consistency problem
- \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}
- A gentle introduction to Numerica
- Path Consistency by Dual Consistency
- Backjump-based backtracking for constraint satisfaction problems
- Algorithms for partition of some class of graphs under compaction and vertex-compaction
- An optimal k-consistency algorithm
- Combining topological and size information for spatial reasoning
- Simulation of hybrid circuits in constraint logic programming
- Non-local configuration of component interfaces by constraint satisfaction
- Decomposing a relation into a tree of binary relations
- Safe starting regions by fixed points and tightening
- Parsing as non-Horn deduction
- Local and global relational consistency
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- The fixed point property for ordered sets
- On point-duration networks for temporal reasoning
- Using constraint metaknowledge to reduce arc consistency computation
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Dynamic Analysis of Bounds Versus Domain Propagation
- Image interpretation with a conceptual graph: labeling over-segmented images and detection of unexpected objects
- Solving connected row convex constraints by variable elimination
- Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure
- Backtracking algorithms for disjunctions of temporal constraints
- Prioritised fuzzy constraint satisfaction problems: Axioms, instantiation and validation
- Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
- A probabilistic approach to solving crossword puzzles
Uses Software
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)