Advertisement

Exact Satisfiabitity with Jokers

  • Gordon Hoi
  • Sanjay JainEmail author
  • Sibylle Schwarz
  • Frank Stephan
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11436)

Abstract

The XSAT problem asks for solutions of a set of clauses where for every clause exactly one literal is satisfied. The present work investigates a variant of this well-investigated topic where variables can take a joker-value (which is preserved by negation) and a clause is satisfied iff either exactly one literal is true and no literal has a joker value or exactly one literal has a joker value and no literal is true. While JX2SAT is in polynomial time, the problem becomes NP-hard when one searches for a solution with the minimum number of jokers used and the decision problem X3SAT can be reduced to the decision problem of the JX2SAT problem with a bound on the number of jokers used. JX3SAT is in both cases, with or without optimisation of the number of jokers, NP-hard and X3SAT can be reduced to it without increasing the number of variables. Furthermore, the general JXSAT problem can be solved in the same amount of time as variable-weighted XSAT and the obtained solution has the minimum amount of number of jokers possible.

References

  1. 1.
    Accorsi, R.: MAX2SAT is NP-complete. WINS-ILLC, University of Amsterdam (1999)Google Scholar
  2. 2.
    Chen, H.: A rendezvous of logic, complexity, and algebra. SIGACT News (Logic Column). ACM (2006)Google Scholar
  3. 3.
    Gaspers, S., Sorkin, G.B.: Separate, measure and conquer: faster polynomial-space algorithms for Max 2-CSP and counting dominating sets. ACM Trans. Algorithms (TALG) 13(4), 44:1–44:36 (2017)MathSciNetzbMATHGoogle Scholar
  4. 4.
    Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. 5.
    Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations, pp. 85–103. Springer, Boston (1972).  https://doi.org/10.1007/978-1-4684-2001-2_9CrossRefGoogle Scholar
  6. 6.
    Kojevnikov, A., Kulikov, A.S.: A new approach to proving upper bounds for MAX-2-SAT. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, pp. 11–17. ACM (2006)Google Scholar
  7. 7.
    Lardeux, F., Saubion, F., Hao, J.-K.: Three truth values for the SAT and MAX-SAT problems. In: International Joint Conference on Artificial Intelligence, IJCAI 2005, vol. 19, p. 187. Lawrence Erlbaum Associates Ltd. (2005)Google Scholar
  8. 8.
    Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. J. Algorithms 36, 63–88 (2000)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)zbMATHGoogle Scholar
  10. 10.
    Porschen, S.: On variable-weighted exact satisfiability problems. Ann. Math. Artif. Intell. 51(1), 27–54 (2007)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Porschen, S., Plagge, G.: Minimizing variable-weighted X3SAT. In: Proceedings of the International Multiconference of Engineers and Computer Scientists, IMECS 2010, Hongkong, 17–19 March 2010, vol. 1, pp. 449–454 (2010)Google Scholar
  12. 12.
    Porschen, S., Schmidt, T.: On some SAT-variants over linear formulas. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 449–460. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-540-95891-8_41CrossRefGoogle Scholar
  13. 13.
    Raible, D., Fernau, H.: A new upper bound for max-2-SAT: a graph-theoretic approach. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 551–562. Springer, Heidelberg (2008).  https://doi.org/10.1007/978-3-540-85238-4_45CrossRefGoogle Scholar
  14. 14.
    Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, STOC 1978, pp. 216–226 (1978)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Gordon Hoi
    • 1
  • Sanjay Jain
    • 1
    Email author
  • Sibylle Schwarz
    • 2
  • Frank Stephan
    • 3
  1. 1.School of ComputingNational University of SingaporeSingaporeRepublic of Singapore
  2. 2.Fakultät Informatik, Mathematik und NaturwissenschaftenHochschule für Technik, Wirtschaft und Kultur LeipzigLeipzigGermany
  3. 3.Department of Mathematics and School of ComputingNational University of SingaporeSingaporeRepublic of Singapore

Personalised recommendations