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 (only showing first 100 items - show all)
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 ⋮ Modeling and solving constraint satisfaction problems through Petri nets ⋮ 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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 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
This page was built for publication: Networks of constraints: Fundamental properties and applications to picture processing
