A sufficient condition for backtrack-bounded search
From MaRDI portal
Publication:3771663
Recommendations
- An overview of backtrack search satisfiability algorithms
- Backjump-based backtracking for constraint satisfaction problems
- Bounded backtracking for the valued constraint satisfaction problems
- scientific article; zbMATH DE number 2102781
- Random backtracking in backtrack search algorithms for satisfiability
- Backtracking and random constraint satisfaction
- Hybrid backtracking bounded by tree-decomposition of constraint networks
- scientific article; zbMATH DE number 1786154
- scientific article; zbMATH DE number 18751
Cited in
(54)- Dynamic algorithms for classes of constraint satisfaction problems
- An algebraic characterization of tractable constraints
- Fugitive-search games on graphs and related parameters
- Tradeoffs in the Complexity of Backdoor Detection
- Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
- Uniform Constraint Satisfaction Problems and Database Theory
- Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
- Hypertree decompositions and tractable queries
- Constraint satisfaction with bounded treewidth revisited
- Tractable constraints on ordered domains
- Branch \& Sample: A simple strategy for constraint satisfaction
- A unified theory of structural tractability for constraint satisfaction problems
- A polynomial relational class of binary CSP
- Network-based heuristics for constraint-satisfaction problems
- Binary constraint satisfaction problems defined by excluded topological minors
- Constraints, consistency and closure
- Characterising tractable constraints
- Decomposing constraint satisfaction problems using database techniques
- Neighborhood singleton consistencies
- Counting representable sets on simple graphs
- Propositional semantics for disjunctive logic programs
- Constraint reasoning
- Lower bounds for subgraph detection in the CONGEST model
- A comparison of structural CSP decomposition methods
- Weighted hypertree decompositions and optimal query plans
- A new tractable class of constraint satisfaction problems
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search
- Principles and Practice of Constraint Programming – CP 2004
- Generalized hypertree decomposition for solving non binary CSP with compressed table constraints
- Hybrid tractable classes of constraint problems
- Galois connections for patterns: an algebra of labelled graphs
- Resource-constrained project scheduling: Notation, classification, models, and methods
- On computing minimal models
- Fugitive-search games on graphs and related parameters
- Computing and restoring global inverse consistency in interactive constraint satisfaction
- Accelerating filtering techniques for numeric CSPs
- Local consistency for extended CSPs
- LP formulations for polynomial optimization problems
- Domain filtering consistencies for non-binary constraints
- ILP models for the allocation of recurrent workloads upon heterogeneous multiprocessors
- Tractable constraints on ordered domains
- Model-based inference in CHARME.
- Fixed-parameter complexity in AI and nonmonotonic reasoning
- Representing and solving finite-domain constraint problems using systems of polynomials
- New limits of treewidth-based tractability in optimization
- Disjunctions, independence, refinements
- Fast parallel constraint satisfaction
- Algorithms and complexity results for persuasive argumentation
- On the minimal constraint satisfaction problem: complexity and generation
- Default reasoning using classical logic
- Fast parallel constraint satisfaction
- On the power of structural decompositions of graph-based representations of constraint problems
- Expected Performance of m-Solution Backtracking
- Decomposable constraints
This page was built for publication: A sufficient condition for backtrack-bounded search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3771663)
