default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th TABLEAUX 1995: Schloß Rheinfels, St. Goar, Germany
- Peter Baumgartner, Reiner Hähnle
, Joachim Posegga:
Theorem Proving with Analytic Tableaux and Related Methods, 4th International Workshop, TABLEAUX '95, Schloß Rheinfels, St. Goar, Germany, May 7-10, 1995, Proceedings. Lecture Notes in Computer Science 918, Springer 1995, ISBN 3-540-59338-1
Invited Talk I
- Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath:
Issues in Theorem Proving Based on the Connection Method. 1-16
Classical Logic - Extensional
- Eric de Kogel:
Rigid E-Unification Simplified. 17-30 - Stefan Klingenbeck:
Generating Finite Counter Examples with Semantic Tableaux. 31-46 - Ingrid Neumann:
Semantic Tableaus for Inheritance Nets. 47-62
Modal Logic
- Stéphane Demri:
Using Connection Method in Modal Logics: Some Advantages. 63-78 - Guido Governatori:
Labelled Tableaux for Multi-Modal Logics. 79-94 - Pierangelo Miglioli, Ugo Moscato, Mario Ornaghi:
Refutation Systems for Propositional Modal Logics. 95-105
Intuitionistic Logic
- Stephan Schmitt, Christoph Kreitz:
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs. 106-121 - Jens Otten:
A Connection Based Proof Method for Intuitionistic Logic. 122-137 - Judith L. Underwood:
Tableaux for Intuitionistic Predicate Logic as Metatheory. 138-153
Invited Talk II
- Ricardo Caferra, Nicolas Peltier:
Model Building and Interactive Theory Discovery. 154-168
Classical Logic - Connection Method and Model Elimination
- Klaus Mayr:
Link Deletion in Model Elimination. 169-184 - Gerd Neugebauer, Uwe Petermann:
Specifications of Inference Rules and Their Automatic Translation. 185-200 - Peter Baumgartner, Frieder Stolzenburg:
Constraint Model Elimination and a PTTP-Implementation. 201-216
Classical Logic - Non-Clausal Proof Procedures
- Matthias Baaz, Christian G. Fermüller:
Non-elementary Speedups between Different Versions of Tableaux. 217-230 - Ján Komara, Paul J. Voda:
Syntactic Reduction of Predicate Tableaux to Propositional Tableaux. 231-246
Linear Logic
- Jörg Hudelmaier, Peter Schroeder-Heister:
Classical Lambek Logic. 247-262 - Philippe de Groote:
Linear Logic with Isabelle: Pruning the Proof Search Tree. 263-277 - Robert K. Meyer, Michael A. McRobbie, Nuel Belnap:
Linear Analytic Tableaux. 278-293
Higher-order Logic
- Michael Kohlhase:
Higher-Order Tableaux. 294-309
Applications
- Alain Heuerding, Gerhard Jäger, Stefan Schwendimann, Michael Seyfried:
Propositional Logics on the Computer. 310-323 - Jeremy V. Pitt:
MacKE: Yet Another Proof Assistant & Automated Pedagogic Tool. 324-337 - Johann Schumann:
Using the Theorem Prover SETHEO for Verifying the Development of a Communication Protocol in FOCUS: A Case Study. 338-352
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-04 00:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
