References in zbMATH (referenced in 13 articles )

Showing results 1 to 13 of 13.
Sorted by year (citations)

  1. Petrukhin, Yaroslav; Shangin, Vasilyi: Automated proof-searching for strong Kleene logic and its binary extensions via correspondence analysis (2019)
  2. Letz, Reinhold; Stenz, Gernot: The disconnection tableau calculus (2007)
  3. Ahrendt, Wolfgang; Beckert, Bernhard; Hähnle, Reiner; Menzel, Wolfram; Reif, Wolfgang; Schellhorn, Gerhard; Schmitt, Peter H.: Integrating automated and interactive theorem proving (1998)
  4. Reif, Wolfgang; Schellhorn, Gerhard: Theorem proving in large theories (1998)
  5. Beckert, Bernhard; Goré, Rajeev: Free variable tableaux for propositional modal logics (1997)
  6. Hähnle, Reiner; Pape, Christian: Ordered tableaux: extensions and applications (1997)
  7. Baumgartner, Peter; Furbach, Ulrich; Niemelä, Ilkka: Hyper tableaux (1996)
  8. Beckert, Bernhard; Hähnle, Reiner; Oel, Peter; Sulzmann, Martin: The tableau-based theorem prover (_3\mkern-4mu T^\mkern-5mu A\mkern-5mu P) Version 4.0 (1996)
  9. Beckert, Bernhard; Pape, Christian: Incremental theory reasoning methods for semantic tableaux (1996)
  10. Degtyarev, Anatoli; Voronkov, Andrei: What you always wanted to know about rigid (E)-unification (1996)
  11. Beckert, Bernhard: A completion-based method for mixed universal and rigid (E)-unification (1994)
  12. Beckert, Bernhard; Posegga, Joachim: (\mathsfleanT^AP): lean tableau-based theorem proving (1994)
  13. Beckert, Bernhard; Hähnle, Reiner; Schmitt, Peter H.: The even more liberalized (\delta)-rule in free variable semantic tableaux (1993)