Optimal length tree-like resolution refutations for 2SAT formulas-Reference-Cited by-同舟云学术

Optimal length tree-like resolution refutations for 2SAT formulas

Published:2004-04 Issue:2 Volume:5 Page:316-320
ISSN:1529-3785
Container-title:ACM Transactions on Computational Logic
language:en
Short-container-title:ACM Trans. Comput. Logic

Author:

Subramani K.¹

Affiliation:

1. LDCSEE, West Virginia University, Morgantown, WV

Abstract

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.

Publisher

Association for Computing Machinery (ACM)

Subject

Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/976706.976711

Reference16 articles.

1. A linear-time algorithm for testing the truth of certain quantified Boolean formulas;Aspvall B.;Inf. Proc. Lett. 3.,1979

2. Propositional proof complexity: Past, present, future;Beame P.;Bull. EATCS,1998

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Integer Feasibility and Refutations in UTVPI Constraints Using Bit-Scaling;Algorithmica;2022-10-11

2. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints;Discrete Applied Mathematics;2021-12

3. Finding read-once resolution refutations in systems of 2CNF clauses;Theoretical Computer Science;2018-06

4. Optimal Length Tree-Like Refutations of Linear Feasibility in UTVPI Constraints;Frontiers in Algorithmics;2018

5. Improved algorithms for optimal length resolution refutation in difference constraint systems;Formal Aspects of Computing;2013-03