Abstract
In this paper, we analyze boolean formulas in conjunctive normal form (CNF) from the perspective of read-once resolution (ROR) refutation. A read-once (resolution) refutation is one in which each input clause is used at most once. It is well-known that read-once resolution is not complete, i.e., there exist unsatisfiable formulas for which no read-once resolution exists. Likewise, the problem of checking if a 3CNF formula has a read-once refutation is NP-complete. This paper is concerned with a variant of satisfiability called Not-All-Equal Satisfiability (NAE-Satisfiability). NAE-Satisfiability is the problem of checking whether an arbitrary CNF formula has a satisfying assignment in which at least one literal in each clause is set to false. It is well-known that NAE-satisfiability is NP-complete. Clearly, the class of CNF formulas which are NAE-satisfiable is a proper subset of the class of satisfiable CNF formulas. It follows that traditional resolution cannot always find a proof of NAE-unsatisfiability. Thus, traditional resolution is not a sound procedure for checking NAE-satisfiability. In this paper, we introduce a variant of resolution called NAE-resolution, which is a sound and complete procedure for checking NAE-satisfiability in CNF formulas. We focus on a variant of NAE-resolution called read-once NAE-resolution, in which each input clause can be part of at most one NAE-resolution step. Our principal result is that read-once NAE-resolution is a sound and complete procedure for checking the NAE-satisfiability of 2CNF formulas; we also provide a polynomial time algorithm to determine the shortest read-once NAE-resolution of a 2CNF formula. Finally, we establish that the problem of checking whether a 3CNF formula has a read-once NAE-resolution is NP-complete.
P. Wojciechowski—This research is supported in part by the National Science Foundation under Award CCF-0827397.
K. Subramani—This work was supported by the Air Force Research Laboratory under US Air Force contract FA8750-16-3-6003. The views expressed are those of the authors and do not reflect the official policy or position of the Department of Defense or the U.S. Government.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Beame, P., Pitassi, T.: Propositional proof complexity: past, present, future. Bull. EATCS 65, 66–89 (1998)
Buss, S.R.: Propositional proof complexity: an introduction. http://www.math.ucsd.edu/~sbuss/ResearchWeb/marktoberdorf97/paper.pdf
Cook, S.A., Reckhow, R.A.: On the lengths of proofs in the propositional calculus (preliminary version). In: Proceedings of the 6th Annual ACM Symposium on Theory of Computing, Seattle, Washington, USA, 30 April – 2 May 1974, pp. 135–148 (1974)
Harrison, J.: Handbook of Practical Logic and Automated Reasoning, 1st edn. Cambridge University Press, Cambridge (2009)
Iwama, K., Miyano, E.: Intractability of read-once resolution. In: Proceedings of the 10th Annual Conference on Structure in Complexity Theory (SCTC 1995), CA, USA, pp. 29–36. IEEE Computer Society Press, Los Alamitos, June 1995
Kleine Büning, H., Wojciechowski, P., Subramani, K.: On the computational complexity of read once resolution decidability in 2CNF formulas. https://arxiv.org/abs/1610.04523
Moore, C., Mertens, S.: The Nature of Computation, 1st edn. Oxford University Press, Oxford (2011)
Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, New York (1994)
Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965)
Schaefer, T.: The complexity of satisfiability problems. In: Aho, A. (ed.) Proceedings of the 10th Annual ACM Symposium on Theory of Computing, pp. 216–226. ACM Press, New York City (1978)
Urquhart, A.: The complexity of propositional proofs. Bull. Symbolic Logic 1(4), 425–467 (1995)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer-Verlag GmbH Germany
About this paper
Cite this paper
Büning, H.K., Wojciechowski, P., Subramani, K. (2017). The Complexity of Finding Read-Once NAE-Resolution Refutations. In: Ghosh, S., Prasad, S. (eds) Logic and Its Applications. ICLA 2017. Lecture Notes in Computer Science(), vol 10119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-54069-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-662-54069-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-54068-8
Online ISBN: 978-3-662-54069-5
eBook Packages: Computer ScienceComputer Science (R0)