1. TABLEAUX 1992:
Lautenbach near Karlsruhe,
Germany
Bertram Fronhöfer,
Reiner Hähnle,
Thomas Käufl (Eds.):
Workshop Theorem Proving with Analytic Tableaux and Related Methods,
March 18-20,
1992,
Lautenbach. Universität Karlsruhe,
Fakultät für Informatik,
Institut für Logik,
Komplexität und Deduktionssysteme,
Interner Bericht 8/92
- Marcello D'Agostino, Marco Mondadori:
An Improvement of Analytic Tableaux.
1-3
- Tadashi Araragi:
A Uniform Prefixed Tableau Method for Positive First-Order Definable Systems.
4-6
- Peter Baumgartner:
A Model Elimination Calculus with Built-in Theories (Extended Abstract).
7-10
- Peter Baumgartner, Ulrich Furbach:
Consolution as a Framework for Comparing Calculi.
11-14
- Oliver Bittel:
The Lambda-Tableau Calculus: A New Approach to Theorem Proving in the Intuitionistic Logic (Extended Abstract).
15-18
- Toni Bollinger:
A Model Elimination Calculus for Generalized Clauses.
19-22
- Jim Cunningham, Marcello D'Agostino, Jeremy V. Pitt:
Towards Tableau Theorem-Proving with Analytic Cut.
23-25
- Roderic A. Girle:
Possible Worlds Tableaux without Explicit Accessibility.
27-28
- Mark Grundy:
Toward an Efficient Tableau Metaprover (Extended Abstract).
29-31
- Reiner Hähnle:
Analytic Tableau and Integer Programming (Extended Abstract).
33-35
- Robert Johnson, Steve Reeves:
Necessary and Possible Set Reconciliation and Unification in Semantic Tableau Systems (Extended Abstract).
37-39
- Thomas Käufl:
The Prover of the Program Verification System Tatzelwurm.
40-42
- Aleksandar Krapez, Miodrag Kapetanovic, Zoran Ognjanovic, Tatjana Petrovic:
Prover 91 - A Parallel Theorem Prover (Extended Abstract).
43-45
- Jürgen Lehmann:
A Workbench for Model Elimination (Abstract).
46-48
- Reinhold Letz, Klaus Mayr:
SETHEO II - The System and its Calculi.
49-51
- Philippe Lamarre:
A Tableau Like Theorem Prover for Conditional Logics (Extended Abstract).
52-55
- Charles G. Morgan:
An Automated Theorem Prover for Relational Logic (Abstract).
56-58
- Wilfried Neitz:
A Connection Method based Theorem Prover with Selective Backtracking (Extended Abstract).
59-60
- Zoran Ognjanovic, Dragan Urosevic, Tatjana Petrovic, Zorana Ristovic:
A Tableaux Retlated Method for Modal Theorem Proving (Extended Abstract).
61-63
- Uwe Petermann:
Proving Completeness of Connection and Other First-Order Calculi with Built-In Theories (Extended Abstract).
64-66
- Joachim Posegga:
First-Order Shannon Graphs (Extended Abstract).
67-69
- Regimantas Pliuskevicius:
The Analityc Tableaux for Linear Temporal Logic.
70-72
- Anavai Ramesh, George Becker, Neil V. Murray:
On Computing Prime Implicants and Prime Implicates.
73-75
- Vincent Risch, Camilla Schwind:
Tableaux-Based Theorem Proving and Non-Standard Reasoning.
76-78
- Raoul Vorc'h:
Generalization and Abstraction Using Tableaux-Based Proof Systems.
79-81
- Wolfgang Wernecke:
Tableau Calculus and Equational Reasoning (Extended Abstract).
82-84
- Graham Wrightson:
Research into Analytic Tableaux.
85-87
- Nicolas Zabel:
Deciding Fragments of the First Order Logic within an Extended Tableau Method.
88-91
Copyright © Mon Nov 2 21:15:39 2009
by Michael Ley (ley@uni-trier.de)
