• Dec 30, 2021 News!Vol.13, No.1 & Vol.13, No.2 have been indexed by Inspec.   [Click]
  • Mar 29, 2022 News!IJCTE Vol.14, No.2 has been published.   [Click]
  • Jan 28, 2022 News!IJCTE had implemented online submission system   [Click]
General Information
Editor-in-chief
Prof. Mehmet Sahinoglu
Faculty at Computer Science Department, Troy University, USA
I'm happy to take on the position of editor in chief of IJCTE. We encourage authors to submit papers concerning any branch of computer theory and engineering.

IJCTE 2017 Vol.9(6): 412-416 ISSN: 1793-8201
DOI: 10.7763/IJCTE.2017.V9.1177

A Note for the Two Incremental Satisfiability Problem

Cristina López R., Guillermo De Ita L., and Pedro Bello L.
Abstract—Let K be a two conjunctive normal form and φ a three conjunctive normal form, both formulas are defined over the same set of variables. It is well known that SAT(K) is in the complexity class P, while SAT(φ) is a classic NP-Complete problem. We consider the computational complexity of determining SAT(Kφ) as an incremental satisfiability problem (2-ISAT). We show that this problem is NP-complete even if the number of occurrences of each variable in φ is one. Also, we propose a method to review SAT(Kφ). Our proposal is adequate to solve 2-ISAT problem. Our algorithm allows us to recognize tractable instances of 2-ISAT.

Index Terms—3-Coloring, incremental satisfiability roblem, 2-ISAT, NP-Complete problem, SAT problem.,

Cristina, López R. is with the Faculty of Computer Sciences in Benemérita Universidad Autónoma de Puebla, Puebla, México (mail: cristyna2001@hotmail.com).
Guillermo, De Ita. L. is with Faculty of Computer Sciences in Benemérita Universidad Autónoma de Puebla (e-mail: deita@ccc.inaoep.mx).
Pedro. Bello L. is with Faculty of Computer Sciences in Benemérita Universidad Autónoma de Puebla, Puebla, México (mail: pb5pbello@gmail.com).

[PDF]

Cite:Cristina López R., Guillermo De Ita L., and Pedro Bello L., "A Note for the Two Incremental Satisfiability Problem," International Journal of Computer Theory and Engineering vol. 9, no. 6, pp. 412-416, 2017.


Copyright © 2008-2022. International Association of Computer Science and Information Technology. All rights reserved.