Skip to main content
Book cover

Ibero-American Conference on Artificial Intelligence

IBERAMIA 2014: Advances in Artificial Intelligence -- IBERAMIA 2014 pp 3–14Cite as

A Parsing Approach to SAT

  • 1509 Accesses

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

Abstract

We present a parsing approach to address the problem of propositional satisfiability (SAT). We use a very simple translation from formulae in conjunctive normal form (CNF) to strings to be parsed by an Earley type algorithm. The parsing approach enables both a SAT and an ALL-SAT solver. The parsing algorithm is based in a model of automata that uses multiple stacks, presented here with a grammar characterization. The time complexity of the algorithm is polynomial, where the degree of the polynomial is dependent on the number of stacks used. It is not dependent on the length of the input nor properties of the grammar. However the number of stacks used might be a function on the number of variables and this is an open question. The number of stacks effectively used in practice is dependent on ordering of variables and clauses. A prototype of the parser was implemented and tested.

Keywords

  • SAT
  • ALL-SAT
  • Multi-stack automata
  • Earley parsing

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-12027-0_1
  • Chapter length: 12 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-12027-0
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barton, G.E.: Computational complexity in two-level morphology. In: Proc. of the 24th ACL, pp. 53–59, New York (1986)

    Google Scholar 

  2. Biere, A., Heule, M., van Maaren H., Walsh, T. (eds): Handbook of Satisfiability. IOS Press (2009)

    Google Scholar 

  3. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik. Grund. Math., 66–92 (1960)

    Google Scholar 

  4. Castaño, J.: Global index grammars and descriptive power. Journal of Logic, Language and Information 13, 403–419 (2004)

    CrossRef  MATH  MathSciNet  Google Scholar 

  5. Cherubini, A., Breveglieri, L., Citrini, C., Reghizzi, S.: Multipushdown languages and grammars. International Journal of Foundations of Computer Science 7(3), 253–292 (1996)

    CrossRef  MATH  Google Scholar 

  6. Dassow, J., Păun, G., Salomaa, A.: Grammars with controlled derivations. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 2. Springer, Berlin (1997)

    Google Scholar 

  7. Earley, J.: An Efficient Context-free Parsing Algorithm. Communications of the ACM 13, 94–102 (1970)

    CrossRef  MATH  Google Scholar 

  8. Elgot, C.C.: Decision problems of automata design and related arithmetics. Transactions of the American Mathematical Society (1961)

    Google Scholar 

  9. Gómez-Rodríguez, C., Kuhlmann, M., Satta, G.: Efficient parsing of well-nested linear context-free rewriting systems. In: Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics, HLT 2010, pp. 276–284. Association for Computational Linguistics, Stroudsburg (2010)

    Google Scholar 

  10. Khabbaz, N.A.: A geometric hierarchy of languages. Journal of Computer and System Sciences 8(2), 142–157 (1974)

    CrossRef  MATH  MathSciNet  Google Scholar 

  11. Neuhaus, P., Broker, N.: The complexity of recognition of linguistically adequate dependency grammars. In: Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics, pp. 337–343. Association for Computational Linguistics, Madrid (1997)

    Google Scholar 

  12. Purdom Jr, P.W., Brown, C.A.: Parsing extended LR(k) grammars. Acta Informatica 15(2), 115–127 (1981)

    CrossRef  MATH  MathSciNet  Google Scholar 

  13. Ristad, E.S.: Computational complexity of current GPSG theory. In: Proc. of the 24th ACL, pp. 30–39, New York (1986)

    Google Scholar 

  14. Satta, G.: Recognition of Linear Context-Free Rewriting Systems. In: ACL, pp. 89–95 (1992)

    Google Scholar 

  15. Satta, G.: Some computational complexity results for synchronous context-free grammars. In: Proceedings of HLT/EMNLP 2005, pp. 803–810 (2005)

    Google Scholar 

  16. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer. Science, 191–229 (1991)

    Google Scholar 

  17. Shieber, S., Schabes, Y., Pereira, F.: Principles and implementation of deductive parsing. Journal of Logic Programming 24, 3–36 (1995)

    CrossRef  MATH  MathSciNet  Google Scholar 

  18. Sikkel, K.: Parsing schemata. Springer (1997)

    Google Scholar 

  19. Tomita, M.: An efficiente augmented-context-free parsing algorithm. Computational Linguistics 13, 31–46 (1987)

    Google Scholar 

  20. La Torre, S., Madhusudan, P., Parlato, G.: A robust class of context-sensitive languages. In: LICS, pp. 161–170. IEEE Computer Society (2007)

    Google Scholar 

  21. Vardi, M.Y.: Logic and Automata: A Match Made in Heaven. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 64–65. Springer, Heidelberg (2003)

    CrossRef  Google Scholar 

  22. Vardi, M.Y., Wolper, P.: Automata-theoretic techniques for modal logics of programs. J. Comput. Syst. Sci. 32, 183–221 (1986)

    CrossRef  MATH  MathSciNet  Google Scholar 

  23. Wartena, C.: Storage products and linear control of derivations. Theory of Computing Systems 42(2), 157–186 (2008)

    CrossRef  MATH  MathSciNet  Google Scholar 

  24. Weir, D.: A geometric hierarchy beyond context-free languages. Theoretical Computer Science 104(2), 235–261 (1992)

    CrossRef  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Depto. de Computación, FCEyN, UBA, Buenos Aires, Argentina

    José M. Castaño

Authors
  1. José M. Castaño
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to José M. Castaño .

Editor information

Editors and Affiliations

  1. Universidade Federal do Rio Grande do Sul, Porto Alegre, Brazil

    Ana L.C. Bazzan

  2. Pontifica Universidad Católica (PUC), Santiago de Chile, Chile

    Karim Pichara

Rights and permissions

Reprints and Permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Castaño, J.M. (2014). A Parsing Approach to SAT. In: Bazzan, A., Pichara, K. (eds) Advances in Artificial Intelligence -- IBERAMIA 2014. IBERAMIA 2014. Lecture Notes in Computer Science(), vol 8864. Springer, Cham. https://doi.org/10.1007/978-3-319-12027-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12027-0_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12026-3

  • Online ISBN: 978-3-319-12027-0

  • eBook Packages: Computer ScienceComputer Science (R0)