Backdoors to satisfaction

Authors:
Serge Gaspers;Stefan Szeider
Affiliations:
Institute of Information Systems, Vienna University of Technology, Vienna, Austria;Institute of Information Systems, Vienna University of Technology, Vienna, Austria
Venue:
The Multivariate Algorithmic Revolution and Beyond
Year:
2012

Citing 75
Cited 7

CNF satisfiability test by counting and polynomial average time

SIAM Journal on Computing
Nested satisfiability

Acta Informatica
Graph rewriting: an algebraic and logic approach

Handbook of theoretical computer science (vol. B)
How to reason defeasibly

Artificial Intelligence
Planning as satisfiability

ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Resolution for quantified Boolean formulas

Information and Computation
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games

Artificial Intelligence
On the hardness of approximate reasoning

Artificial Intelligence
Graph theoretical structures in logic programs and default theories

Theoretical Computer Science
Variable and term removal from Boolean formulae

Discrete Applied Mathematics
An abstract, argumentation-theoretic approach to default reasoning

Artificial Intelligence
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Renaming a Set of Clauses as a Horn Set

Journal of the ACM (JACM)
Conjunctive-query containment and constraint satisfaction

Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
A machine program for theorem-proving

Communications of the ACM
On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Vertex cover: further observations and further improvements

Journal of Algorithms
Propositional Logic: Deduction and Algorithms

Propositional Logic: Deduction and Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Logic programs with stable model semantics as a constraint programming paradigm

Annals of Mathematics and Artificial Intelligence
Coherence in finite argument systems

Artificial Intelligence
Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors

Journal of Symbolic Computation
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Algorithms and Complexity Results for #SAT and Bayesian Inference

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On approximating minimum vertex cover for graphs with perfect matching

Theoretical Computer Science
On finding short resolution refutations and small unsatisfiable subsets

Theoretical Computer Science - Parameterized and exact computation
Fixed-Parameter Hierarchies inside PSPACE

LICS '06 Proceedings of the 21st Annual IEEE Symposium on Logic in Computer Science
Faster fixed parameter tractable algorithms for finding feedback vertex sets

ACM Transactions on Algorithms (TALG)
Backdoor Sets for DLL Subsolvers

Journal of Automated Reasoning
Argumentation in artificial intelligence

Artificial Intelligence
Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
Solving #SAT using vertex covers

Acta Informatica
Counting truth assignments of formulas of bounded tree-width or clique-width

Discrete Applied Mathematics
On probabilistic inference by weighted model counting

Artificial Intelligence
Elements of Argumentation

Elements of Argumentation
Infeasibility of instance compression and succinct PCPs for NP

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A fixed-parameter algorithm for the directed feedback vertex set problem

Journal of the ACM (JACM)
Improved algorithms for feedback vertex set problems

Journal of Computer and System Sciences
Backdoor Sets of Quantified Boolean Formulas

Journal of Automated Reasoning
Argumentation in Artificial Intelligence

Argumentation in Artificial Intelligence
Performing Bayesian inference by weighted model counting

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Backdoor trees

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Constructing conditional plans by a theorem-prover

Journal of Artificial Intelligence Research
On problems without polynomial kernels

Journal of Computer and System Sciences
Almost 2-SAT is fixed-parameter tractable

Journal of Computer and System Sciences
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Algorithms for propositional model counting

Journal of Discrete Algorithms
A Top-Down Approach to Search-Trees: Improved Algorithmics for 3-Hitting Set

Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Fixed-Parameter Approximation: Conceptual Framework and Approximability Results

Algorithmica
Tradeoffs in the complexity of backdoor detection

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The complexity of finding subgraphs whose matching number equals the vertex cover number

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A kernelization algorithm for d-Hitting Set

Journal of Computer and System Sciences
Parameterized Complexity and Local Search Approaches for the Stable Marriage Problem with Ties

Algorithmica - Special Issue: Matching Under Preferences; Guest Editors: David F. Manlove, Robert W. Irving and Kazuo Iwama
Improved upper bounds for vertex cover

Theoretical Computer Science
Finding small backdoors in SAT instances

Canadian AI'11 Proceedings of the 24th Canadian conference on Advances in artificial intelligence
Subset feedback vertex set is fixed-parameter tractable

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Feedback vertex set in mixed graphs

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

FOCS '11 Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science
Erdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Symmetric argumentation frameworks

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On parameterized approximability

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Parameterized approximation problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
QBF modeling: exploiting player symmetry for simplicity and efficiency

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Backdoors to tractable answer-set programming

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Augmenting tractable fragments of abstract argumentation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Stable assignment with couples: Parameterized complexity and local search

Discrete Optimization
Finding odd cycle transversals

Operations Research Letters
Strong backdoors to nested satisfiability

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Backdoors to acyclic SAT

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity

Parameterized Complexity
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems

The Computer Journal

A basic parameterized complexity primer

The Multivariate Algorithmic Revolution and Beyond
Strong backdoors to nested satisfiability

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Backdoors to acyclic SAT

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
SIGACT News Complexity Theory Column 76: an atypical survey of typical-case heuristic algorithms

ACM SIGACT News
Upper and lower bounds for weak backdoor set detection

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Backdoors to abduction

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Crowdsourcing backdoor identification for combinatorial optimization

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

A backdoor set is a set of variables of a propositional formula such that fixing the truth values of the variables in the backdoor set moves the formula into some polynomial-time decidable class. If we know a small backdoor set we can reduce the question of whether the given formula is satisfiable to the same question for one or several easy formulas that belong to the tractable class under consideration. In this survey we review parameterized complexity results for problems that arise in the context of backdoor sets, such as the problem of finding a backdoor set of size at most k, parameterized by k. We also discuss recent results on backdoor sets for problems that are beyond NP.