Using the Groebner basis algorithm to find proofs of unsatisfiability
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Short proofs are narrow—resolution made simple
Journal of the ACM (JACM)
A sharp threshold in proof complexity
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Real-Time Database and Information
Real-Time Database and Information
Complexity of Finding Short Resolution Proofs
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Minimum Propositional Proof Length is NP-Hard to Linearly Approximate
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Lower Bounds for Propositional Proofs and Independence Results in Bounded Arithmetic
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Combining Logic and Optimization in Cutting Plane Theory
FroCoS '00 Proceedings of the Third International Workshop on Frontiers of Combining Systems
Intriactability of Read-Once Resolution
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Simplified and improved resolution lower bounds
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Interest based negotiation automation
ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Minimum witnesses for unsatisfiable 2CNFs
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
In this article, we exploit the graphical structure of 2SAT formulas to show that the shortest tree-like resolution refutation of an unsatisfiable 2SAT formula can be determined in polynomial time.