Skip to main content
Springer Nature Link
Log in

A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas

  • Conference paper
  • First Online:
Advances in Soft Computing (MICAI 2020)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 12468))

Included in the following conference series:

Abstract

An \(O(m+n)\) time algorithm is presented for counting the number of models of a two Conjunctive Normal Form Boolean Formula whose constrained graph is represented by a Series-Parallel graph, where n is the number of variables and m is the number of clauses. To the best of our knowledge, no linear time algorithm has been developed for counting in this kind of formulas.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Winkler, P., Brifhtwell, G.: Counting linear extensions. Order, 8(e), 225–242 (1991)

    Google Scholar 

  2. López-Medina, M.A., Marcial-Romero, J.R., De Ita Luna, G., Montes-Venegas, H.A., Alejo, R.: A linear time algorithm for solving #2SAT on cactus formulas. CoRR, ams/1702.08581 (2017)

    Google Scholar 

  3. López, M.A., Marcial-Romero, J.R., De Ita, G., Moyao, Y.: A linear time algorithm for computing #2SAT for outerplanar 2-CNF formulas. In: Martínez-Trinidad, J.F., Carrasco-Ochoa, J.A., Olvera-López, J.A., Sarkar, S. (eds.) MCPR 2018. LNCS, vol. 10880, pp. 72–81. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92198-3_8

    Chapter  Google Scholar 

  4. Wahlström, M.: A tighter bound for counting max-weight solutions to 2SAT instances. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 202–213. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-79723-4_19

    Chapter  Google Scholar 

  5. Schoenmakers, L.A.M.: A new algorithm for the recognition of series parallel graphs. CWI (Centre for Mathematics and Computer Science) (1995)

    Google Scholar 

  6. Eppstein, D.: Parallel recognition of series-parallel graphs. Inf. Comput. 98, 41–55 (1992)

    Article  MathSciNet  Google Scholar 

  7. Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. Assoc. Comput. Mach. 29(3), 623–641 (1982)

    Article  MathSciNet  Google Scholar 

  8. Gross, J.L., Yellen, J., Zhang, P.: Handbook of Graph Theory. Chapman & Hall/CRC, New York (2013)

    Book  Google Scholar 

  9. Dieter, J.: Graphs, Networks and Algorithms., 4th edn. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-32278-5

    Book  MATH  Google Scholar 

  10. Jakoby, A., Liśkiewicz, M., Reischuk, R.: Space efficient algorithms for directed series-parallel graphs. J. Algorithms 60(2), 85–114 (2006)

    Article  MathSciNet  Google Scholar 

  11. Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 188–202. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24605-3_15

    Chapter  MATH  Google Scholar 

  12. Marcial-Romero, J.R., De Ita Luna, G., Hernández, J.A., Valdovinos, R.M.: A parametric polynomial deterministic algorithm for #2SAT. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 202–213. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-27060-9_16

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facultad de Ingeniería, UAEMex, Toluca, Mexico

    Marco A. López-Medina, J. Raymundo Marcial-Romero & José A. Hernández

  2. Facultad de Ciencias de la Computación, BUAP, Puebla, Mexico

    Guillermo De Ita-Luna

Authors
  1. Marco A. López-Medina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Raymundo Marcial-Romero
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Guillermo De Ita-Luna
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. José A. Hernández
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to J. Raymundo Marcial-Romero .

Editor information

Editors and Affiliations

  1. Facultad de Ingeniería, Universidad Panamericana, Mexico City, Mexico

    Lourdes Martínez-Villaseñor

  2. Universidad Autónoma Metropolitana, Mexico City, Mexico

    Oscar Herrera-Alcántara

  3. Facultad de Ingeniería, Universidad Panamericana, Mexico City, Mexico

    Hiram Ponce

  4. Universidad Autónoma del Estado de Hidalgo, Hidalgo, Mexico

    Félix A. Castro-Espinoza

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

López-Medina, M.A., Marcial-Romero, J.R., De Ita-Luna, G., Hernández, J.A. (2020). A Linear Time Algorithm for Counting #2SAT on Series-Parallel Formulas. In: Martínez-Villaseñor, L., Herrera-Alcántara, O., Ponce, H., Castro-Espinoza, F.A. (eds) Advances in Soft Computing. MICAI 2020. Lecture Notes in Computer Science(), vol 12468. Springer, Cham. https://doi.org/10.1007/978-3-030-60884-2_33

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-60884-2_33

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-60883-5

  • Online ISBN: 978-3-030-60884-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics