Author:
Buresh-Oppenheim Joshua,Mitchell David
Publisher
Springer Berlin Heidelberg
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas;Annals of Mathematics and Artificial Intelligence;2021-06-29
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. Local Backbones;Theory and Applications of Satisfiability Testing – SAT 2013;2013
5. Redundancy in logic II: 2CNF and Horn propositional formulae;Artificial Intelligence;2008-02