Author:
Buresh-Oppenheim Joshua,Mitchell David
Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. Alekhnovich, M., et al.: Minimum propositional proof length is NP-hard to linearly approximate. JSL: Journal of Symbolic Logic 66 (2001)
2. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Information Processing Letters 8(3), 121–123 (1979)
3. Lecture Notes in Computer Science;J. Buresh-Oppenheim,2006
4. Cook, S.A.: The complexity of theorem proving procedures. In: Proc. 3rd Ann. ACM Symp. on Theory of Computing, pp. 151–158. ACM Press, New York (1971)
5. del Val, A.: On 2-SAT and Renamable Horn. In: AAAI’2000, Proc. 17th (U.S.) National Conference on Artificial Intelligence, MIT Press, Cambridge (2000)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling;Algorithmica;2022-10-11
2. Computing Shortest Resolution Proofs;Progress in Artificial Intelligence;2019
3. Minimal Unsatisfiability and Minimal Strongly Connected Digraphs;Theory and Applications of Satisfiability Testing – SAT 2018;2018
4. The Incremental Satisfiability Problem for a Two Conjunctive Normal Form;Electronic Notes in Theoretical Computer Science;2016-12
5. Local Backbones;Theory and Applications of Satisfiability Testing – SAT 2013;2013