Skip to main content
SpringerLink
Log in

On Efficient Algorithms for SAT

  • Conference paper
Membrane Computing (CMC 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7762))

Included in the following conference series:

  • 739 Accesses

Abstract

There are several papers in which SAT is solved in linear time by various new computing paradigms, and specially by various membrane computing systems. In these approaches the used alphabet depends on the number of variables. That gives different classes of the problem by the number of the variables.In this paper we show that the set of valid SAT-formulae and n-SAT-formulae over finite sets of variables are regular languages. We show a construction of deterministic finite automata which accept the SAT and n-SAT languages in conjunctive normal form checking both their syntax and satisfiable evaluations. Thus, theoretically the words of the SAT languages can be accepted in linear time with respect to their lengths by a traditional computer.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A.: Solving SAT by Symport/Antiport P Systems with Membrane Division. In: ESF PESC Exploratory Workshop, Sevilla, pp. 1–6 (2005)

    Google Scholar 

  2. Alhazov, A.: Minimal Parallelism and Number of Membrane Polarizations. Computer Science Journal of Moldova 18, 149–170 (2010)

    MathSciNet  MATH  Google Scholar 

  3. Alhazov, A., Freund, R.: On the Efficiency of P Systems with Active Membranes and Two Polarizations. In: Mauri, G., Păun, G., Jesús Pérez-Jímenez, M., Rozenberg, G., Salomaa, A. (eds.) WMC 2004. LNCS, vol. 3365, pp. 146–160. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  4. Alhazov, A., Ishdorj, T.-O.: Membrane Operations in P Systems with Active Membranes. RGNC report 01/2004, Second BWMC, Sevilla, 37–44 (2004)

    Google Scholar 

  5. Brueggeman, T., Kern, W.: An improved deterministic local search algorithm for 3-SAT. Theoretical Computer Science 329, 303–313 (2004)

    Article  MathSciNet  Google Scholar 

  6. Castellanos, J., Păun, G., Rodríguez-Patón, A.: Computing with Membranes: P Systems with Worm-Objects. In: SPIRE 2000, pp. 65–74 (2000)

    Google Scholar 

  7. Ciobanu, G., Pan, L., Păun, G., Pérez-Jiménez, M.J.: P systems with minimal parallelism. Theoretical Computer Science 378, 117–130 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Czeizler, E.: Self-Activating P Systems. In: Păun, G., Rozenberg, G., Salomaa, A., Zandron, C. (eds.) WMC-CdeA 2002. LNCS, vol. 2597, pp. 234–246. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C.H., Raghavan, P., Schöning, U.: A deterministic (2 − 2/(k + 1))n algorithm for k-SAT based on local search. Theoretical Computer Science 289, 69–83 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  10. Dassow, J., Păun, G.: Regulated rewriting in Formal Language Theory. Akademie-Verlag, Berlin (1989)

    Book  Google Scholar 

  11. Frisco, P., Govan, G.: P Systems with Active Membranes Operating under Minimal Parallelism. In: Gheorghe, M., Păun, G., Rozenberg, G., Salomaa, A., Verlan, S. (eds.) CMC 2011. LNCS, vol. 7184, pp. 165–181. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Gutiérrez-Naranjo, M.A., Pérez-Jiménez, M.J., Romero-Campero, F.J.: A uniform solution to SAT using membrane creation. Theoretical Computer Science 371, 54–61 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Hirversalo, M.: Quantum Computing. Springer (2003)

    Google Scholar 

  14. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)

    MATH  Google Scholar 

  15. Ishdorj, T.-O.: Minimal Parallelism for Polarizationless P Systems. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol. 4287, pp. 17–32. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Johnson, D.S.: A Catalog of Complexity Classes. In: Handbook of Theoretical Computer Science, vol. A, Algorithms and Complexity. Elsevier (1990)

    Google Scholar 

  17. Karp, R.: Reducibility Among Combinatorial Problems. In: Symposium on the Complexity of Computer Computations, pp. 85–103. Plenum Press, New York (1972)

    Chapter  Google Scholar 

  18. Krishna, S.N., Lakshmanan, K., Rama, R.: On the power of P systems with contextual rules. Fundamenta Informaticae 49, 167–178 (2002)

    MathSciNet  MATH  Google Scholar 

  19. Kusper, G.: Solving the resolution-free SAT problem by submodel propagation in linear time. Ann. Math. Artif. Intell. 43, 129–136 (2005)

    MathSciNet  MATH  Google Scholar 

  20. Leporati, A., Mauri, G., Zandron, C.: Quantum Sequential P Systems with Unit Rules and Energy Assigned to Membranes. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 310–325. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  21. Leporati, A., Felloni, S.: Three “quantum” algorithms to solve 3-SAT. Theoretical Computer Science 372, 218–241 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  22. Linz, P.: An Introduction to Formal Languages and Automata. D.C. Heath and Co. (1990)

    Google Scholar 

  23. Lipton, R.J.: DNA solution of HARD computational problems. Science 268, 542–545 (1995)

    Article  Google Scholar 

  24. Manca, V.: DNA and Membrane Algorithms for SAT. Fundamenta Informaticae 49, 205–221 (2002)

    MathSciNet  MATH  Google Scholar 

  25. Murphy, N., Woods, D.: The computational complexity of uniformity and semi-uniformity in membrane systems. In: BWMC7, vol. 2, pp. 73–84 (2009)

    Google Scholar 

  26. Nagy, B.: The languages of SAT and n-SAT over finitely many variables are regular. Bulletin of the EATCS 82, 286–297 (2004)

    MATH  Google Scholar 

  27. Nagy, B.: An interval-valued computing device. In: CiE 2005, Computability in Europe: New Computational Paradigms (X-2005-01), pp. 166–177 (2005)

    Google Scholar 

  28. Nagy, B., Vályi, S.: Interval-valued computations and their connection with PSPACE. Theoretical Computer Science 394, 208–222 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  29. Nagy, B.: Effective Computing by Interval-values. In: 14th IEEE International Conference on Intelligent Engineering Systems, pp. 91–96 (2010)

    Google Scholar 

  30. Nagy, B., Vályi, S.: Prime factorization by interval-valued computing. Publicationes Mathematicae Debrecen 79, 539–551 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  31. Pan, L., Alhazov, A., Ishdorj, T.-O.: Further remarks on P systems with active membranes, separation, merging, and release rules. Soft Computing 9, 686–690 (2005)

    Article  MATH  Google Scholar 

  32. Pan, L., Alhazov, A.: Solving HPP and SAT by P Systems with Active Membranes and Separation Rules. Acta Informatica 43, 131–145 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  33. Papadimitriou, C.H.: Computational complexity. Addison-Wesley (1994)

    Google Scholar 

  34. Păun, G.: The propositional calculus languages versus the Chomsky hierarchy. Stud. Cerc. Mat. 33, 299–310 (1981) (in Romanian)

    MathSciNet  MATH  Google Scholar 

  35. Păun, G.: Computing with Membranes. Journal of Computer and System Sciences 61, 108–143 (2000); TUCS Report No. 208 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  36. Păun, G.: P-systems with active membranes: attacking NP complete problems. In: UMC, pp. 94–115 (2000)

    Google Scholar 

  37. Păun, G.: Membrane Computing: An introduction. Springer, Berlin (2002)

    Book  MATH  Google Scholar 

  38. Păun, G., Pérez-Jímenez, M.J., Riscos-Núñez, A.: P Systems with Tables of Rules. In: Karhumäki, J., Maurer, H., Păun, G., Rozenberg, G. (eds.) Theory Is Forever. LNCS, vol. 3113, pp. 235–249. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  39. Păun, G., Suzuki, Y., Tanaka, H., Yokomori, T.: On the power of membrane division in P systems. Theoretical Computer Science 324, 61–85 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  40. Pazos, J., Rodríguez-Patón, A., Silva, A.: Solving SAT in Linear Time with a Neural-Like Membrane System. In: Mira, J., Álvarez, J.R. (eds.) IWANN 2003. LNCS, vol. 2686, pp. 662–669. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  41. Pérez-Jiménez, M.J., Romero-Jiménez, A., Sancho-Caparrini, F.: Computationally hard problems addressed through P systems. In: Applications of Membrane Computing, pp. 315–346. Springer, Berlin (2006)

    Google Scholar 

  42. Pérez-Jiménez, M.J., Riscos-Núñez, A., Romero-Jiménez, A., Woods, D.: Complexity – Membrane Division, Membrane Creation, ch. 12, pp. 302–336 (2009)

    Google Scholar 

  43. P-system home page, old, http://psystems.disco.unimib.it/ , and new http://ppage.psystems.eu

  44. Schöning, U.: A Probabilistic Algorithm for k-SAT Based on Limited Local Search and Restart. Algorithmica 32, 615–623 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  45. The international SAT Competitions web page, http://www.satcompetition.org/

  46. Tagawa, H., Fujiwara, A.: Solving SAT and Hamiltonian Cycle Problem Using Asynchronous P Systems. IEICE Transactions on Information and Systems E95-D(3), 746–754 (2012)

    Google Scholar 

  47. Zandron, C., Ferretti, C., Mauri, G.: Solving NP-complete problems using P systems with active membranes. In: Unconventional Models of Computation (UMC), pp. 289–301 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Faculty of Informatics, University of Debrecen, Egyetem tér 1., 4032, Debrecen, Hungary

    Benedek Nagy

Authors
  1. Benedek Nagy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Algorithms and Their Applications, Eötvös Loránd University, , ,, Pázmány Péter sétány 1/c, 1117, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  2. Department of Computer Science, University of Sheffield, 211 Portobello Street, S1 4DP, Sheffield, UK

    Marian Gheorghe

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkaisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

  5. Department of Computer Science, University of Debrecen, Kassai út 26, 4028, Debrecen, Hungary

    György Vaszil

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nagy, B. (2013). On Efficient Algorithms for SAT. In: Csuhaj-Varjú, E., Gheorghe, M., Rozenberg, G., Salomaa, A., Vaszil, G. (eds) Membrane Computing. CMC 2012. Lecture Notes in Computer Science, vol 7762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36751-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36751-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36750-2

  • Online ISBN: 978-3-642-36751-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation