Backdoors to Satisfaction (Q2908542): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 11:26, 25 November 2024

scientific article

Language	Label	Description	Also known as
English	Backdoors to Satisfaction	scientific article

Statements

scholarly article

0 references

Backdoors to Satisfaction (English)

0 references

0 references

0 references

The Multivariate Algorithmic Revolution and Beyond

0 references

publication date

5 September 2012

0 references

full work available at URL

https://arxiv.org/abs/1110.6387

0 references

describes a project that uses

Velev SAT Benchmarks

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

A kernelization algorithm for \(d\)-hitting set

0 references

A linear-time algorithm for testing the truth of certain quantified Boolean formulas

0 references

Argumentation in artificial intelligence

0 references

0 references

ON DISJOINT CYCLES

0 references

On problems without polynomial kernels

0 references

An abstract, argumentation-theoretic approach to default reasoning

0 references

Feedback Vertex Set in Mixed Graphs

0 references

Resolution for quantified Boolean formulas

0 references

Fixed-parameter approximation: conceptual framework and approximability results

0 references

On probabilistic inference by weighted model counting

0 references

On approximating minimum vertex cover for graphs with perfect matching

0 references

Improved algorithms for feedback vertex set problems

0 references

Vertex Cover: Further Observations and Further Improvements

0 references

Improved upper bounds for vertex cover

0 references

A fixed-parameter algorithm for the directed feedback vertex set problem

0 references

On Parameterized Approximability

0 references

0 references

Symbolic and Quantitative Approaches to Reasoning with Uncertainty

0 references

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

0 references

0 references

Variable and term removal from Boolean formulae

0 references

Subset Feedback Vertex Set Is Fixed-Parameter Tractable

0 references

A Computing Procedure for Quantification Theory

0 references

A machine program for theorem-proving

0 references

Tradeoffs in the Complexity of Backdoor Detection

0 references

Graph theoretical structures in logic programs and default theories

0 references

Parameterized Approximation Problems

0 references

On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games

0 references

Computational properties of argument systems satisfying graph-theoretic constraints

0 references

Coherence in finite argument systems.

0 references

On the computational cost of disjunctive logic programming: Propositional case

0 references

On finding short resolution refutations and small unsatisfiable subsets

0 references

A top-down approach to search-trees: Improved algorithmics for 3-hitting set

0 references

The Good, the Bad, and the Odd: Cycles in Answer-Set Programs

0 references

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

0 references

0 references

Backdoors to Acyclic SAT

0 references

Strong Backdoors to Nested Satisfiability

0 references

0 references

Parameterized and Exact Computation

0 references

3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General

0 references

CNF-Satisfiability Test by Counting and Polynomial Average Time

0 references

Fixed-parameter tractability for the subset feedback set problem and the \(S\)-cycle packing problem

0 references

Nested satisfiability

0 references

Conjunctive-query containment and constraint satisfaction

0 references

Renaming a Set of Clauses as a Horn Set

0 references

Parameterized complexity and local search approaches for the stable marriage problem with ties

0 references

Stable assignment with couples: parameterized complexity and local search

0 references

The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number

0 references

Logic programs with stable model semantics as a constraint programming paradigm

0 references

Solving \#SAT using vertex covers

0 references

Satisfiability of Acyclic and Almost Acyclic CNF Formulas.

0 references

Augmenting tractable fragments of abstract argumentation

0 references

0 references

Properties and Complexity of Some Formal Inter-agent Dialogues

0 references

On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems

0 references

How to reason defeasibly

0 references

Faster fixed parameter tractable algorithms for finding feedback vertex sets

0 references

Almost 2-SAT is fixed-parameter tractable

0 references

Finding odd cycle transversals.

0 references

0 references

Permanents, Pfaffian orientations, and even directed circuits

0 references

QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency

0 references

Backdoor sets of quantified Boolean formulas

0 references

Algorithms for propositional model counting

0 references

The complexity of satisfiability problems

0 references

0 references

Theory and Applications of Satisfiability Testing

0 references

Backdoor sets for DLL subsolvers

0 references

0 references

Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-30891-8_15

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

0 references

0 references

DBLP publication ID

conf/birthday/GaspersS12

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2908542

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2908542&oldid=37928834"