Tree clustering for constraint networks
From MaRDI portal
Publication:1116363
DOI10.1016/0004-3702(89)90037-4zbMath0665.68084OpenAlexW1999038767MaRDI QIDQ1116363
Publication date: 1989
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(89)90037-4
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Information storage and retrieval of data (68P20)
Related Items
Binary vs. non-binary constraints, On point-duration networks for temporal reasoning, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, The Power of Local Consistency in Conjunctive Queries and Constraint Satisfaction Problems, Four Shorts Stories on Surprising Algorithmic Uses of Treewidth, Binary constraint satisfaction problems defined by excluded topological minors, Computational social choice for coordination in agent networks, Constraint satisfaction with bounded treewidth revisited, Approximation algorithms for treewidth, Reformulation of global constraints based on constraints checkers, Constraint models for the covering test problem, Domain permutation reduction for constraint satisfaction problems, Accelerating new product development by overcoming complexity constraints, Default reasoning using classical logic, On computing minimal models, Focusing on independent diagnosis problems, Propositional semantics for disjunctive logic programs, Tree projections and structural decomposition methods: minimality and game-theoretic characterization, Structure-driven algorithms for truth maintenance, Local and global relational consistency, Fugitive-search games on graphs and related parameters, The complexity of approximating bounded-degree Boolean \(\#\)CSP, The complexity of constraint satisfaction revisited, Combining qualitative and quantitative constraints in temporal reasoning, Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width., Coalition structure generation: a survey, Linear-programming design and analysis of fast algorithms for Max 2-CSP, Computing a partition function of a generalized pattern-based energy over a semiring, The power of propagation: when GAC is enough, STR2: optimized simple tabular reduction for table constraints, Combining restarts, nogoods and bag-connected decompositions for solving csps, Dynamic Management of Heuristics for Solving Structured CSPs, Binarisation for Valued Constraint Satisfaction Problems, Constraint satisfaction with succinctly specified relations, Learning cluster-based structure to solve constraint satisfaction problems, Guarantees and limits of preprocessing in constraint satisfaction and reasoning, Bounded-width QBF is PSPACE-complete, A unified theory of structural tractability for constraint satisfaction problems, The complexity of reasoning with global constraints, Unifying tree decompositions for reasoning in graphical models, Partition-based logical reasoning for first-order and propositional theories, Temporal constraint networks, LP Formulations for Polynomial Optimization Problems, Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms, Using artificial neural networks for constraint satisfaction problem, From local to global consistency, Integer programs for logic constraint satisfaction, Counting truth assignments of formulas of bounded tree-width or clique-width, A REVIEW OF TREE CONVEX SETS TEST, The expressive power of valued constraints: Hierarchies and collapses, Fugitive-search games on graphs and related parameters, Constraint reasoning based on interval arithmetic: The tolerance propagation approach, Structure identification in relational data, Hypertree decompositions and tractable queries, A sufficiently fast algorithm for finding close to optimal clique trees, Topological parameters for time-space tradeoff, Recursive conditioning, Diagnosing tree-structured systems, Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination, Parameterized Complexity Results in Symmetry Breaking, Consistency restoration and explanations in dynamic CSPs---Application to configuration, Generalized Hypertree Decomposition for solving non binary CSP with compressed table constraints, Finding and counting permutations via CSPs, Galois connections for patterns: an algebra of labelled graphs, Constraint Satisfaction, AND/OR search spaces for graphical models, Optimization of a recursive conveyor by reduction to a constraint satisfaction problem, Exploiting Separators for Guiding VNS, A new branch-and-filter exact algorithm for binary constraint satisfaction problems, On a new extension of BTP for binary CSPs, A Logical Approach to Constraint Satisfaction, Decomposable constraints, A comparison of structural CSP decomposition methods, Conjunctive-query containment and constraint satisfaction, STR3: a path-optimal filtering algorithm for table constraints, Structural tractability of enumerating CSP solutions, Large hypertree width for sparse random hypergraphs, Fixed-parameter complexity in AI and nonmonotonic reasoning, Backjump-based backtracking for constraint satisfaction problems, Dynamic variable ordering in graph based backjumping algorithms for csps, Compiling constraint satisfaction problems, Decomposing constraint satisfaction problems using database techniques, Hybrid backtracking bounded by tree-decomposition of constraint networks, Compiling propositional weighted bases, New limits of treewidth-based tractability in optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Network-based heuristics for constraint-satisfaction problems
- Networks of constraints: Fundamental properties and applications to picture processing
- Nonserial dynamic programming
- On the Desirability of Acyclic Database Schemes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Complexity of Finding Embeddings in a k-Tree
- A Sufficient Condition for Backtrack-Free Search
- Synthesizing constraint expressions
