Abstract
In this paper we consider the problem Not-All-Equal satisfiability (NAESAT) for propositional formulas in conjunctive normal form (CNF). It asks whether there is a (satisfying) model for the input formula in no clause assigning truth value 1 to all its literals. NAESAT is NP-complete in general as well as restricted to formulas with either only negated or unnegated variables. After having pointed out that SAT and NAESAT in the unrestricted case are equivalent from the point of view of computational complexity, we propose linear time algorithms deciding NAESAT for restricted classes of CNF formulas. First we show that a NAESAT model (if existing) can be computed in linear time for formulas in which each variable occurs at most twice. Moreover we prove that this computation is in NC and hence can also be solved in parallel efficiently. Secondly, we show that NAESAT can be decided in linear time for monotone formulas in which each clause has length exactly k and each variable occurs exactly k times. Hence, bicolorability of k-uniform, k-regular hypergraphs is decidable in linear time.
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
Preview
Unable to display preview. Download preview PDF.
References
Achlioptas, D., Chtcherba, A., Istrate, G., Moore, C.: The Phase Transition in 1-in-k SAT and NAE 3-SAT. In: Proceedings of 12th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 2001), pp. 721–722 (2001)
Achlioptas, D., Moore, C.: The asymptotic order of the random k−SAT threshold. In: 43th Annual Symposium on Foundations of Computer Science, Vancouver, BC, IEEE Comput. Soc. Press, Los Alamitos (2002) (to appear)
Alon, N., Spencer, J.H., Erdös, P.: The Probabilistic Method. Series in Discrete Mathematics and Optimization. Wiley- Interscience, New York (1992)
Atallah, M., Vishkin, U.: Finding Euler tours in parallel. J. of Computer and System Sci. 29(30), 330–337 (1984)
Beck, J.: On 3-chromatic hypergraphs. Discrete Math. 24, 127–137 (1978)
Bondy, J.A., Murty, U.S.R.: Graph Theory and Applications. Macmillan/Elsevier, London/New York (1976)
Euler, L.: Solutio problematis ad geometriam situs pertinentis. Commentarii Academiae Petropolitanae 8, 128–140 (1736)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, San Francisco (1979)
Golumbic, M., Mintz, A., Rotics, U.: Factoring and Recognition of Read-Once Functions using Cographs and Normality. In: Proceedings of the 38th ACM Design Automation Conference, DAC 2001, Las Vegas, USA, June 18-22, pp. 109–114 (2001)
Hierholzer, C.: Über die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Math. Ann. 6, 30–32 (1873)
Kleine Büning, H., Lettman, T.: Aussagenlogik: Deduktion und Algorithmen. B. G. Teubner, Stuttgart (1994)
Knuth, D.E.: Axioms and Hulls. LNCS, vol. 606. Springer, Heidelberg (1992)
Kratochvil, J., Tuza, Z.: On the complexity of bicoloring clique hypergraphs of graphs. J. Algorithms 45, 40–54 (2002)
Monien, B., Speckenmeyer, E., Vornberger, O.: Upper Bounds for Covering Problems. Methods of Operations Research 43, 419–431 (1981)
Schaefer, T.J.: The complexity of satisfiability problems. In: Conference Record of the Tenth Annual ACM Symposium on Theory of Computing, San Diego, California, May 1-3, pp. 216–226 (1978)
Shiloach, Y., Vishkin, U.: An O(log n) parallel connectivity algorithm. J. Algorithms 2, 57–63 (1981)
Tovey, C.A.: A Simplified NP-Complete Satisfiability Problem. Discrete Appl. Math. 8, 85–89 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Porschen, S., Randerath, B., Speckenmeyer, E. (2004). Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. In: Giunchiglia, E., Tacchella, A. (eds) Theory and Applications of Satisfiability Testing. SAT 2003. Lecture Notes in Computer Science, vol 2919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24605-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-24605-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20851-8
Online ISBN: 978-3-540-24605-3
eBook Packages: Springer Book Archive