Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
tree-like resolution
Description:
Tree-like resolution is a proof system in computational logic where each derived clause is used at most once.
Primary topic:
Complexity and Algorithms in Graphs (55%)
Related topics:
Complexity and Algorithms in Graphs (55%),
Advanced Graph Theory Research (21%),
Constraint Satisfaction and Optimization (14%)
OpenAlex ID:
keywords/tree-like-resolution
Short proofs are narrow—resolution made simple
2001
·
Eli Ben-Sasson
, Avi Wigderson
·
Journal of the ACM
·
536
Using the Groebner basis algorithm to find proofs of unsatisfiability
1996
·
Matthew Clegg
, Jeffery Edmonds
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
388
PDF
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
2000
·
Maria Luisa Bonet
, Juan Luis Esteban
, et al.
·
SIAM Journal on Computing
·
137
Short proofs are narrow—resolution made simple
1999
·
Eli Ben-Sasson
, Avi Wigderson
·
ACM Symposium on Theory of Computing (STOC)
·
136
PDF
Many hard examples in exact phase transitions
2006
·
Ke Xu
, Wei Li
·
Theoretical Computer Science
·
115
PDF
Near Optimal Separation Of Tree-Like And General Resolution
2004
·
Eli Ben-Sasson*
, Russell Impagliazzo†
, et al.
·
COMBINATORICA
·
115
Resolution Is Not Automatizable Unless W[P] Is Tractable
2008
·
Michael Alekhnovich
, Alexander A. Razborov
·
SIAM Journal on Computing
·
80
Resolution is not automatizable unless W[P] is tractable
2001
·
M. Alekhnovich
, A.A. Razboro
·
Annual Symposium on Foundations of Computer Science
·
80
Resolution and the weak pigeonhole principle
1998
·
Sam Buss
, Toniann Pitassi
·
Lecture notes in computer science
·
80
Near-Optimal Separation of Treelike and General Resolution
2000
·
Eli Ben‐Sasson
, Russell Impagliazzo
, et al.
·
Electronic colloquium on computational complexity
·
68
2 -Way vs.d -Way Branching for CSP
2005
·
Joey Hwang
, David G. Mitchell
·
Lecture notes in computer science
·
61
A characterization of tree-like Resolution size
2013
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
59
On Relativisation and Complexity Gap for Resolution-Based Proof Systems
2003
·
Stefan Dantchev
, Søren Riis
·
Lecture notes in computer science
·
53
Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas
2004
·
Michael Alekhnovich
, Edward A. Hirsch
, et al.
·
Lecture notes in computer science
·
48
Resolution over linear equations modulo two
2019
·
Dmitry Itsykson
, Dmitry Sokolov
·
Annals of Pure and Applied Logic
·
46
PDF
Relating Proof Complexity Measures and Practical Hardness of SAT
2012
·
Matti Järvisalo
, Arie Matsliah
, et al.
·
Lecture notes in computer science
·
37
On Linear Resolution
2017
·
Sam Buss
, Jan Johannsen
·
Journal on Satisfiability Boolean Modeling and Computation
·
33
PDF
Memoization and DPLL: formula caching proof systems
2004
·
P. Beame
, R. Impagliazzo
, et al.
·
IEEE Conference on Computational Complexity (CCC)
·
32
Implicit Resolution
2013
·
Zi Chao Wang
·
Logical Methods in Computer Science
·
30
PDF
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games
2010
·
Olaf Beyersdorff
, Nicola Galesi
, et al.
·
Information Processing Letters
·
27
Lifting to Parity Decision Trees Via Stifling
2022
·
Chattopadhyay, Arkadev
, Mande, Nikhil S.
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
22
PDF
Are Short Proofs Narrow? QBF Resolution is not Simple
2016
·
Beyersdorff, Olaf
, Chew, Leroy
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
20
PDF
On the Resolution Complexity of Graph Non-isomorphism
2013
·
Jacobo Torán
·
Lecture notes in computer science
·
20
Are Short Proofs Narrow? QBF Resolution Is Not So Simple
2017
·
Olaf Beyersdorff
, Leroy Chew
, et al.
·
ACM Transactions on Computational Logic
·
19
On the Pseudo-Deterministic Query Complexity of NP Search Problems
2021
·
Goldwasser, Shafi
, Impagliazzo, Russell
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
18
PDF
Show more works
View as search
Works count:
105
Citation count:
2,508
Year
Topic
Type