A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Topics in the complexity of combinatorial algorithms.
Topics in the complexity of combinatorial algorithms.
On the lengths of proofs in the propositional calculus.
On the lengths of proofs in the propositional calculus.
Many hard examples for resolution
Journal of the ACM (JACM)
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Modular coloring formulas are hard for cutting planes proofs
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A lower bound for DLL algorithms for k-SAT (preliminary version)
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
Regular resolution lower bounds for the weak pigeonhole principle
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Information and Computation
Size space tradeoffs for resolution
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Resolution lower bounds for the weak pigeonhole principle
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Hard examples for bounded depth frege
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Randomness conductors and constant-degree lossless expanders
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Solving difficult SAT instances in the presence of symmetry
Proceedings of the 39th annual Design Automation Conference
Some interesting research directions in satisfiability
Annals of Mathematics and Artificial Intelligence
The Complexity of Read-Once Resolution
Annals of Mathematics and Artificial Intelligence
Autarky Pruning in Propositional Model Elimination Reduces Failure Redundancy
Journal of Automated Reasoning
Proving Unsatisfiability of CNFs Locally
Journal of Automated Reasoning
IEEE Transactions on Knowledge and Data Engineering
An Optimal Lower Bound for Resolution with 2-Conjunctions
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
ASIAN '00 Proceedings of the 6th Asian Computing Science Conference on Advances in Computing Science
Homogenization and the Polynominal Calculus
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Complexity of Resolution with Bounded Conjunctions
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
A Compressed Breadth-First Search for Satisfiability
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Lower Bounds for Space in Resolution
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Monotone Proofs of the Pigeon Hole Principle
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Complexity of Semi-algebraic Proofs
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Shatter: efficient symmetry-breaking for boolean satisfiability
Proceedings of the 40th annual Design Automation Conference
Random CNF's are Hard for the Polynomial Calculus
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Resolution lower bounds for the weak functional pigeonhole principle
Theoretical Computer Science - Logic and complexity in computer science
Space complexity of random formulae in resolution
Random Structures & Algorithms
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
On the structure of some classes of minimal unsatisfiable formulas
Discrete Applied Mathematics - The renesse issue on satisfiability
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
A combinatorial characterization of treelike resolution space
Information Processing Letters
Resolution lower bounds for the weak pigeonhole principle
Journal of the ACM (JACM)
Hard examples for the bounded depth Frege proof system
Computational Complexity
Exploiting structure in symmetry detection for CNF
Proceedings of the 41st annual Design Automation Conference
A new family of Cayley expanders (?)
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Resolution lower bounds for perfect matching principles
Journal of Computer and System Sciences - Special issue on computational complexity 2002
Annals of Mathematics and Artificial Intelligence
On the complexity of resolution with bounded conjunctions
Theoretical Computer Science
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Complexity results on DPLL and resolution
ACM Transactions on Computational Logic (TOCL)
MUP: a minimal unsatisfiability prover
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Typical case complexity of satisfiability algorithms and the threshold phenomenon
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Efficient Symmetry Breaking for Boolean Satisfiability
IEEE Transactions on Computers
Narrow proofs may be spacious: separating space and width in resolution
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The probabilistic analysis of a greedy satisfiability algorithm
Random Structures & Algorithms
Smaller superconcentrators of density 28
Information Processing Letters
Artificial Intelligence
A combinatorial characterization of resolution width
Journal of Computer and System Sciences
Formula dissection: A parallel algorithm for constraint satisfaction
Computers & Mathematics with Applications
Towards an optimal separation of space and length in resolution
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
A Global Filtration for Satisfying Goals in Mutual Exclusion Networks
Recent Advances in Constraints
A Generalization of the Zig-Zag Graph Product by Means of the Sandwich Product
AAECC-18 '09 Proceedings of the 18th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dynamic Symmetry Breaking by Simulating Zykov Contraction
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
A simplified way of proving trade-off results for resolution
Information Processing Letters
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Efficient symmetry breaking for boolean satisfiability
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Typical case complexity of Satisfiability Algorithms and the threshold phenomenon
Discrete Applied Mathematics
Smaller superconcentrators of density 28
Information Processing Letters
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Solving difficult SAT instances using greedy clique decomposition
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
On threshold BDDs and the optimal variable ordering problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Symmetry-breaking answer set solving
AI Communications - Answer Set Programming
Parameterized complexity of DPLL search procedures
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
Sherali-Adams relaxations and indistinguishability in counting logics
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Boolean rings for intersection-based satisfiability
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Width versus size in resolution proofs
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Variable minimal unsatisfiability
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Simulating cutting plane proofs with restricted degree of falsity by resolution
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Resolution tunnels for improved SAT solver performance
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Lower bounds for myopic DPLL algorithms with a cut heuristic
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Finite Fields and Their Applications
Resolution vs. cutting plane solution of inference problems: Some computational experience
Operations Research Letters
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
Conflict-driven XOR-clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Relating proof complexity measures and practical hardness of SAT
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Strong ETH holds for regular resolution
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Some trade-off results for polynomial calculus: extended abstract
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Parameterized Complexity of DPLL Search Procedures
ACM Transactions on Computational Logic (TOCL)
Verifying refutations with extended resolution
CADE'13 Proceedings of the 24th international conference on Automated Deduction
The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
On the resolution complexity of graph non-isomorphism
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Towards an understanding of polynomial calculus: new separations and lower bounds
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Complexity issues related to propagation completeness
Artificial Intelligence
Semidefinite resolution and exactness of semidefinite relaxations for satisfiability
Discrete Applied Mathematics
Theory of Computing Systems
| Hi-index | 0.01 |
Exponential lower bounds are proved for the length-of-resolution refutations of sets of disjunctions constructed from expander graphs, using the method of Tseitin. Since these sets of clauses encode biconditionals, they have short (polynomial-length) refutations in a standard axiomatic formulation of propositional calculus.