Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1110.6387
Cited By
v1
v2 (latest)
Backdoors to Satisfaction
28 October 2011
Serge Gaspers
Stefan Szeider
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Backdoors to Satisfaction"
11 / 11 papers shown
Title
Computational Short Cuts in Infinite Domain Constraint Satisfaction
Peter Jonsson
Victor Lagerkvist
S. Ordyniak
55
0
0
18 Nov 2022
The Complexity of Limited Belief Reasoning -- The Quantifier-Free Case
Yijia Chen
Abdallah Saffidine
C. Schwering
LRM
105
2
0
08 May 2018
Backdoors into Heterogeneous Classes of SAT and CSP
Serge Gaspers
Neeldhara Misra
S. Ordyniak
Stefan Szeider
Stanislav Živný
59
37
0
18 Sep 2015
SAT-based Analysis of Large Real-world Feature Models is Easy
J. Liang
Vijay Ganesh
Venkatesh Raman
Krzysztof Czarnecki
24
69
0
17 Jun 2015
Guarantees and Limits of Preprocessing in Constraint Satisfaction and Reasoning
Serge Gaspers
Stefan Szeider
41
15
0
12 Jun 2014
Backdoors to Abduction
A. Pfandler
Stefan Rümmele
Stefan Szeider
65
32
0
22 Apr 2013
Backdoors to Normality for Disjunctive Logic Programs
Johannes Fichte
Stefan Szeider
LRM
62
36
0
08 Jan 2013
Strong Backdoors to Bounded Treewidth SAT
Serge Gaspers
Stefan Szeider
79
33
0
27 Apr 2012
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
Johannes Fichte
74
7
0
15 Feb 2012
Augmenting Tractable Fragments of Abstract Argumentation
S. Ordyniak
Stefan Szeider
169
64
0
14 Apr 2011
Backdoors to Tractable Answer-Set Programming
Johannes Fichte
Stefan Szeider
104
56
0
14 Apr 2011
1