Networks of constraints: Fundamental properties and applications to picture processing
From MaRDI portal
Publication:1844713
DOI10.1016/0020-0255(74)90008-5zbMath0284.68074OpenAlexW2119456262MaRDI QIDQ1844713
Publication date: 1974
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Networks_of_constraints_fundamental_properties_and_applications_to_picture_processing/6607673
Related Items
The Complexity of General-Valued CSPs, Partition search for non-binary constraint satisfaction, The combinatorics of object recognition in cluttered environments using constrained search, Constraint relaxation may be perfect, Theoretical analysis of singleton arc consistency and its extensions, Domain permutation reduction for constraint satisfaction problems, Properties of tree convex constraints, Path consistency in clp(FD), On the hardness of approximate reasoning, The complexity of approximating bounded-degree Boolean \(\#\)CSP, The complexity of constraint satisfaction revisited, Uncovering trees in constraint networks, Combining qualitative and quantitative constraints in temporal reasoning, Super-reparametrizations of weighted CSPs: properties and optimization perspective, RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks, An algebraic characterization of tractable constraints, Constraint and Logic Programming: Ugo Montanari’s Main Contributions and Introduction to the Volume Section, Semiring-Based Soft Constraints, SPREADSPACES: Mathematically-Intelligent Graphical Spreadsheets, Computing partial hypergraphs of bounded width, Binarisation for Valued Constraint Satisfaction Problems, Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems, A new order relation on fuzzy soft sets and its application, The essence of constraint propagation, On Sparse Discretization for Graphical Games, Bounds of graph parameters for global constraints, On the arc consistency problem, The sheaf-theoretic structure of non-locality and contextuality, Backdoor Sets for CSP., A branch and prune algorithm for the computation of generalized aspects of parallel robots, The complexity of soft constraint satisfaction, The algebra \(\text{IA}^{\text{fuz}}\): a framework for qualitative fuzzy temporal reasoning, Incremental qualitative temporal reasoning: Algorithms for the point algebra and the ORD-Horn class, A REVIEW OF TREE CONVEX SETS TEST, Group planning with time constraints, A hybrid setup for a hybrid scenario: combining heuristics for the home health care problem, From binary temporal relations to non-binary ones and back, Dynamic algorithms for classes of constraint satisfaction problems, Combinatorial problems raised from 2-semilattices, Computational complexity relationship between compaction, vertex-compaction, and retraction, Learning solution preferences in constraint problems, Tractable constraints on ordered domains, A constraint programming primer, Tractable constraints on ordered domains, Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints, Branching interval algebra: an almost complete picture, Soft Constraints Processing over Divisible Residuated Lattices, On-line algorithms for networks of temporal constraints, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, RECONSTRUCTABILITY ANALYSIS: Overview and Bibliography†, On a new extension of BTP for binary CSPs, From MDD to BDD and arc consistency, On the relations between SAT and CSP enumerative algorithms, The Power of Linear Programming for General-Valued CSPs, Models and emerging trends of concurrent constraint programming, Dynamic variable ordering in graph based backjumping algorithms for csps, The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side, On point-duration networks for temporal reasoning, Solving multi-granularity temporal constraint networks, On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning, Non-local configuration of component interfaces by constraint satisfaction, In praise of homomorphisms, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Using OBDDs to handle dynamic constraints, Computing leximin-optimal solutions in constraint networks, Model-based inference in CHARME., Solving connected row convex constraints by variable elimination, A hypergraph model for constraint logic programming and applications to bus drivers' scheduling, On topological consistency and realization, Interactive scheduling as a constraint satisfiability problem, Network-based heuristics for constraint-satisfaction problems, The TV-break packing problem, Parallel consistent labeling algorithms, Computing and restoring global inverse consistency in interactive constraint satisfaction, Predicting and detecting symmetries in FOL finite model search, Refinements of the maximum approach to decision-making in a fuzzy environment, Tree clustering for constraint networks, On minimal constraint networks, Dualities and dual pairs in Heyting algebras, An optimal k-consistency algorithm, Algorithms for partition of some class of graphs under compaction and vertex-compaction, Towards a dichotomy theorem for the counting constraint satisfaction problem, Classes of submodular constraints expressible by graph cuts, No more ``Partial and ``Full Looking Ahead, \textit{Helios}: A modeling language for global optimization and its implementation in \textit{Newton}, From local to global consistency in temporal constraint networks, Solving linear, min and max constraint systems using CLP based on relational interval arithmetic, Local and global relational consistency, On redundant topological constraints, On tree-preserving constraints, A theoretical evaluation of selected backtracking algorithms., Relational consistency algorithms and their application in finding subgraph and graph isomorphisms, Twenty-one large tractable subclasses of Allen's algebra, Fundamental properties of neighbourhood substitution in constraint satisfaction problems, A condensed semantics for qualitative spatial reasoning about oriented straight line segments, Solving job shop scheduling with setup times through constraint-based iterative sampling: an experimental analysis, A global constraint for over-approximation of real-time streams, New algorithms for max restricted path consistency, Decomposing a relation into a tree of binary relations, Dealing with satisfiability and \(n\)-ary CSPs in a logical framework, Accelerating exact and approximate inference for (distributed) discrete optimization with GPUs, Fuzzy reasoning in a multidimensional space of hypotheses, A logic language for combinatorial optimization, A survey of constraint-based programming paradigms, Colouring, constraint satisfaction, and complexity, Comments on Mohr and Henderson's path consistency algorithm, Temporal constraint networks, Qualitative constraint satisfaction problems: an extended framework with landmarks, A constraint propagation approach to structural model based image segmentation and recognition, Soft constraint abstraction based on semiring homomorphism, Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms, Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class, From local to global consistency, Integer programs for logic constraint satisfaction, On some partial line graphs of a hypergraph and the associated matroid, A generic arc-consistency algorithm and its specializations, The expressive power of valued constraints: Hierarchies and collapses, The logic of constraint satisfaction, Constraint satisfaction using constraint logic programming, Structure identification in relational data, Reasoning about qualitative temporal information, Decidability of infinite-state timed CCP processes and first-order LTL, Computing the minimal relations in point-based qualitative temporal reasoning through metagraph closure, Recognizing frozen variables in constraint satisfaction problems, A new tractable class of constraint satisfaction problems, Consistency in networks of relations, Relation algebras and their application in temporal and spatial reasoning, A note on some collapse results of valued constraints, Pushing the frontier of minimality, Resource-constrained project scheduling: Notation, classification, models, and methods, Affine systems of equations and counting infinitary logic, Constraint satisfaction problems: Algorithms and applications, A computational study of constraint satisfaction for multiple capacitated job shop scheduling, The job shop scheduling problem: Conventional and new solution techniques, Reduction operations for constraint satisfaction, The SAT-UNSAT transition for random constraint satisfaction problems, Constraints, consistency and closure, A gentle introduction to Numerica, On the algebraic structure of combinatorial problems, Local consistency for extended CSPs, Backtracking algorithms for disjunctions of temporal constraints, A combinatorial constraint satisfaction problem dichotomy classification conjecture, Interval propagation and search on directed acyclic graphs for numerical constraint solving, A new approach to cyclic ordering of 2D orientations using ternary relation algebras, Constraint propagation techniques for the disjunctive scheduling problem, Decomposable constraints, Conjunctive-query containment and constraint satisfaction, Computing improved optimal solutions to max-min flexible constraint satisfaction problems, Counting representable sets on simple graphs, Backjump-based backtracking for constraint satisfaction problems, Compiling constraint satisfaction problems, Decomposing constraint satisfaction problems using database techniques, Characterising tractable constraints, Arc-consistency for continuous variables, Hybrid backtracking bounded by tree-decomposition of constraint networks, Fuzzy constraint networks for signal pattern recognition, Temporal scenario modelling and recognition based on possibilistic logic
Uses Software
Cites Work
- Consistent properties of composite formation under a binary relation
- Finding Picture Edges Through Collinearity of Feature Points
- Separable graphs, planar graphs and web grammars
- Parsing of Graph-Representable Pictures
- On the optimal detection of curves in noisy pictures
- A Theorem on Boolean Matrices
- Unnamed Item
- Unnamed Item
