First-Order Tableaux in Applications (Extended Abstract)

  • Ulrich Furbach
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6793)


High performance first-order theorem proving is dominated by saturation-based proof procedures. This is true, at least when one looks at competitions like the yearly CASC, the CADE ATP System Competition, where the winners in the CNF division (conjunctive normal form, non-propositional problems) usually use superposition-based calculi. This was different in the early days of CASC, when a tableau prover (SETHEO) even won the MIX category.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Baumgartner, P., Furbach, U., Gross-Hardt, M., Sinner, A.: Living Book – Deduction, Slicing, and Interaction. Journal of Automated Reasoning 32(3), 259–286 (2004)CrossRefGoogle Scholar
  2. 2.
    Baumgartner, P., Furbach, U., Niemelä, I.: Hyper tableaux. In: Alferes, J.J., Pereira, L.M., Orlowska, E. (eds.) JELIA 1996. LNCS, vol. 1126, pp. 1–17. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  3. 3.
    Baumgartner, P., Furbach, U., Pelzer, B.: Hyper tableaux with equality. In: Pfenning, F. (ed.) CADE 2007. LNCS (LNAI), vol. 4603, pp. 492–507. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  4. 4.
    Dong, T., Furbach, U., Glöckner, I., Pelzer, B.: A natural language question answering system as a participant in human Q&A portals. To appear in IJCAI (2011)Google Scholar
  5. 5.
    Furbach, U., Glöckner, I., Pelzer, B.: An application of automated reasoning in natural language question answering. AI Commun. 23(2-3), 241–265 (2010)MathSciNetzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Ulrich Furbach
    • 1
  1. 1.Department of Computer ScienceUniversity of Koblenz-LandauGermany

Personalised recommendations