Network-based heuristics for constraint-satisfaction problems
From MaRDI portal
Publication:1102137
DOI10.1016/0004-3702(87)90002-6zbMath0643.68156MaRDI QIDQ1102137
Publication date: 1988
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(87)90002-6
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
Related Items
Constraint Satisfaction, Dynamic variable ordering in graph based backjumping algorithms for csps, Iterative coloring extension of a maximum clique, Improving ABT Performance by Adding Synchronization Points, Topological parameters for time-space tradeoff, Dynamic algorithms for classes of constraint satisfaction problems, A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\), Tractable constraints on ordered domains, On some partial line graphs of a hypergraph and the associated matroid, Fuzzy constraint networks for signal pattern recognition, Constraint solving in uncertain and dynamic environments: A survey, High-order consistency in valued constraint satisfaction, Mixed deterministic and probabilistic networks, Symbolic techniques in satisfiability solving, Distributed CSPs by graph partitioning, Decomposing a relation into a tree of binary relations, Fuzzy reasoning in a multidimensional space of hypotheses, A logic-based analysis of Dempster-Shafer theory, A unified theory of structural tractability for constraint satisfaction problems, AND/OR search spaces for graphical models, Parallel consistent labeling algorithms, Some fundamental properties of local constraint propagation, Tree clustering for constraint networks, No more ``Partial and ``Full Looking Ahead, Temporal constraint networks, A canonical form for generalized linear constraints, From local to global consistency, Integer programs for logic constraint satisfaction, A generic arc-consistency algorithm and its specializations, Scheduling with neural networks -- the case of the Hubble Space Telescope, Constraint reasoning based on interval arithmetic: The tolerance propagation approach, Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems, Structure identification in relational data, The job shop scheduling problem: Conventional and new solution techniques, Constraints, consistency and closure, Maintaining reversible DAC for Max-CSP, A methodology for the reduction of imprecision in the engineering process, A framework for decision support systems of scheduling problems, Counting representable sets on simple graphs, Decomposing constraint satisfaction problems using database techniques, Characterising tractable constraints, Investigating production system representations for non-combinatorial match, Experimental evaluation of preprocessing algorithms for constraint satisfaction problems, Problem solving by searching for models with a theorem prover, Local consistency in parallel constraint satisfaction networks, An optimal backtrack algorithm for tree-structured constraint satisfaction problems, Model-based inference in CHARME., Probability propagation, On computing minimal models, A statistical approach to adaptive problem solving, From local to global consistency in temporal constraint networks, Local and global relational consistency, Processing disjunctions in temporal constraint networks, Backtracking algorithms for disjunctions of temporal constraints, Constraint propagation techniques for the disjunctive scheduling problem, Querying temporal and spatial constraint networks in PTIME, A comparison of structural CSP decomposition methods, Backjump-based backtracking for constraint satisfaction problems, Compiling constraint satisfaction problems, A tabu search approach to the constraint satisfaction problem as a general problem solver, Constraint solving for proof planning, A new tractable class of constraint satisfaction problems, Tractable reasoning via approximation, Reduction operations in fuzzy or valued constraint satisfaction, Metaheuristics: A bibliography, Propositional semantics for disjunctive logic programs, The essence of constraint propagation, Polynomial algorithm of limited propositional deduction, Partition search for non-binary constraint satisfaction, Constraint relaxation may be perfect, Domain permutation reduction for constraint satisfaction problems, Semiring induced valuation algebras: exact and approximate local computation algorithms, A non-binary constraint ordering heuristic for constraint satisfaction problems, Linear-programming design and analysis of fast algorithms for Max 2-CSP, The complexity of reasoning with global constraints, Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering, Unifying tree decompositions for reasoning in graphical models, An optimal coarse-grained arc consistency algorithm, Asynchronous backtracking without adding links: a new member in the ABT family, Distributed personnel scheduling -- negotiation among scheduling agents, Combinatorial problems raised from 2-semilattices, Solving the minimum-weighted coloring problem, Tradeoffs in the Complexity of Backdoor Detection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- A method for computing heuristics in problem solving
- Consistency in networks of relations
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Networks of constraints: Fundamental properties and applications to picture processing
- Planning in a hierarchy of abstraction spaces
- Nonserial dynamic programming
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Intelligent Backtracking in Plan-Based Deduction
- A sufficient condition for backtrack-bounded search
- The average complexity of depth-first search with backtracking and cutoff
- A Sufficient Condition for Backtrack-Free Search
- Estimating the Efficiency of Backtrack Programs
