Skip to main content
SpringerLink
Log in

A Bottom-Up Approach to Clausal Tableaux

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2007)

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

  • 367 Accesses

Abstract

We present a new proof procedure for first-order logic. It is close in spirit to the usual tableaux-based procedures, but uses a more compact representation of the search space. Roughly speaking, it constructs the tableau from the leaves to the root, and tries to factorize common subtrees when possible.

We study the complexity of our procedure for several propositional classes and we show that it is polynomial for all these classes.

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. Baumgartner, P., Furbach, U., Niemelä, I.: Hyper-tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol. 1126, Springer, Heidelberg (1996)

    Google Scholar 

  2. Beckert, B.: Depth-first proof search without backtracking for free-variable clausal tableaux. Journal of Symbolic Computation 36, 117–138 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  3. Beckert, B., Posegga, J.: Lean-TAP: Lean tableau-based deduction. Journal of Automated Reasoning 15(3), 339–358 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  4. Benoist, E., Hébrard, J.J.: Ordered formulas. Technical Report 14, Université de Caen, Les cahiers du CGREYC (1999)

    Google Scholar 

  5. Bibel, W.: On matrices with connections. Journal of the Association of Computing Machinery 28, 633–645 (1981)

    MATH  MathSciNet  Google Scholar 

  6. Billon, J.-P.: The disconnection method: a confluent integration of unification in the analytic framework. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol. 1071, Springer, Heidelberg (1996)

    Google Scholar 

  7. Boros, E., Crama, Y., Hammer, P.L.: Polynomial-time inference of all valid implications for Horn and related formulae. Ann. Mathematics and Artificial Intelligence 1, 21–32 (1990)

    Article  MATH  Google Scholar 

  8. Bry, F., Yahya, A.: Minimal model generation with positive unit hyper-resolution tableaux. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol. 1071, Springer, Heidelberg (1996)

    Google Scholar 

  9. Chandru, V., Hooker, J.N.: Extended horn sets in propositional logic. J. ACM 38(1), 205–221 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  10. Giese, M.: Incremental Closure of Free Variable Tableaux. In: Goré, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol. 2083, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Hähnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, Elsevier Science vol. I, ch. 3, pp. 100–178 (2001)

    Google Scholar 

  12. Letz, R., Stenz, G.: Model elimination and connection tableau procedures, pp. 2015–2112 (2001)

    Google Scholar 

  13. Letz, R., Stenz, G.: Proof and model generation with disconnection tableaux. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol. 2250, Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Peltier, N.: Some techniques for branch-saturation in free-variable tableaux. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, Springer, Heidelberg (2004)

    Google Scholar 

  15. Schlipf, J.S., Annexstein, F.S., Franco, J.V., Swaminathan, R.P.: On Finding Solutions for Extended Horn Formulas. Information Processing Letters 54(3), 133–137 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  16. Swaminathan, R.P., Wagner, D.K.: The arborescence-realization problem. Discrete Appl. Math 59(3), 267–283 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  17. Yamasaki, S., Doshita, S.: The satisfiability problem for a class consisting of Horn sentences and some non-Horn sentences in propositional logic. Information and Control 59, 1–12 (1983)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIG, CNRS, 46, avenue Félix Viallet, 38031 Grenoble Cedex, France

    Nicolas Peltier

Authors
  1. Nicolas Peltier
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Nicola Olivetti

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Peltier, N. (2007). A Bottom-Up Approach to Clausal Tableaux. In: Olivetti, N. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2007. Lecture Notes in Computer Science(), vol 4548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73099-6_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73099-6_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73098-9

  • Online ISBN: 978-3-540-73099-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation