A Sufficient Condition for Backtrack-Free Search
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Approximated consistency for the automatic recording constraint
- Determining the consistency of partial tree descriptions
- Network-based heuristics for constraint-satisfaction problems
- Tree clustering for constraint networks
- Branch \& Sample: A simple strategy for constraint satisfaction
- No more ``Partial and ``Full Looking Ahead
- Temporal constraint networks
- From local to global consistency
- Integer programs for logic constraint satisfaction
- Constraint reasoning based on interval arithmetic: The tolerance propagation approach
- Constraints, consistency and closure
- Fast parallel constraint satisfaction
- Decomposing constraint satisfaction problems using database techniques
- Characterising tractable constraints
- Arc-consistency for continuous variables
- Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
- Local consistency in parallel constraint satisfaction networks
- An optimal backtrack algorithm for tree-structured constraint satisfaction problems
- Model-based inference in CHARME.
- Treewidth for graphs with small chordality
- From local to global consistency in temporal constraint networks
- Local and global relational consistency
- Fugitive-search games on graphs and related parameters
- Networked bubble propagation: a polynomial-time hypothetical reasoning method for computing near-optimal solutions
- A probabilistic analysis of randomly generated binary constraint satisfaction problems.
- On the monotonicity of games generated by symmetric submodular functions.
- Backtracking algorithms for disjunctions of temporal constraints
- A new approach to cyclic ordering of 2D orientations using ternary relation algebras
- Decomposable constraints
- Querying temporal and spatial constraint networks in PTIME
- A comparison of structural CSP decomposition methods
- Backjump-based backtracking for constraint satisfaction problems
- A tabu search approach to the constraint satisfaction problem as a general problem solver
- On point-duration networks for temporal reasoning
- Binary constraint satisfaction problems defined by excluded topological minors
- Efficiently enumerating all maximal cliques with bit-parallelism
- On tree-preserving constraints
- The power of propagation: when GAC is enough
- Combining restarts, nogoods and bag-connected decompositions for solving csps
- Exact algorithms for maximum clique: a computational study
- On singleton arc consistency for CSPs defined by monotone patterns
- Resource-constrained project scheduling: Notation, classification, models, and methods
- Salt: A knowledge acquisition language for propose-and-revise systems
- On-line algorithms for networks of temporal constraints
- How to survive while visiting a graph
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- Model-based computing: Developing flexible machine control software
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Locally defined independence systems on graphs
- Variable ordering for decision diagrams: a portfolio approach
- Classes of linear programs solvable by coordinate-wise minimization
- On a new extension of BTP for binary CSPs
- Constraint relaxation may be perfect
- Theoretical analysis of singleton arc consistency and its extensions
- Modelling and solving temporal reasoning as propositional satisfiability
- A non-binary constraint ordering heuristic for constraint satisfaction problems
- The complexity of reasoning with global constraints
- Locally consistent constraint satisfaction problems
- The combinatorics of object recognition in cluttered environments using constrained search
- Projection, consistency, and George Boole
- Structure-driven algorithms for truth maintenance
- Combining qualitative and quantitative constraints in temporal reasoning
- Achieving consistency with cutting planes
- Solving the minimum-weighted coloring problem
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
- Degree reduction in labeled graph retrieval
- Parameterized complexity results in symmetry breaking
- On singleton arc consistency for CSPs defined by monotone patterns
- Tradeoffs in the Complexity of Backdoor Detection
- Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems
- Dynamic variable ordering in graph based backjumping algorithms for csps
- Iterative coloring extension of a maximum clique
- A review of literature on parallel constraint solving
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- Fast parallel constraint satisfaction
- Hybrid tractable classes of constraint problems
- Consistency for counting quantifiers
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- Why is maximum clique often easy in practice?
- A naive algorithm for feedback vertex set
- SampleSearch: importance sampling in presence of determinism
- A Logical Approach to Constraint Satisfaction
- Fusion, propagation, and structuring in belief networks
- Topological parameters for time-space tradeoff
- Dynamic algorithms for classes of constraint satisfaction problems
- Tractable disjunctions of linear constraints: Basic results and applications to temporal reasoning
- Constructing an asymptotic phase transition in random binary constraint satisfaction problems
- Fugitive-search games on graphs and related parameters
- Learning cluster-based structure to solve constraint satisfaction problems
- Constraint reasoning
- Graph coloring via degeneracy in streaming and other space-conscious models
- On some partial line graphs of a hypergraph and the associated matroid
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- Fuzzy constraint networks for signal pattern recognition
- Dense trees: a new look at degenerate graphs
- A constraint-based approach to fast and exact structure prediction in three-dimensional protein models
- Decision-support with preference constraints
- Distributed CSPs by graph partitioning
- A hybrid tractable class for non-binary CSPs
- A fuzzy constraint satisfaction approach for signal abstraction
This page was built for publication: A Sufficient Condition for Backtrack-Free Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3933756)
