Theorem proving with analytic tableaux and related methods : 4th international workshop, TABLEAUX '95, Schloß Reinfels, St. Goar, Germany, May 7 10, 1995 : proceedings
This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloß Rheinfels, St. Goar, Germany in May 1995. Originally tableau calculi and their relatives were favored primarily as a pedagogical d...
Enregistré dans:
| Hovedforfatter: | |
|---|---|
| Institution som forfatter: | |
| Andre forfattere: | , |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science. Lecture notes in artificial intelligence
918 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theorem proving with analytic tableaux and related methods, 4th international workshop, TABLEAUX '95, Schloss Rheinfels, St. Goar, Germany, May 7-10, 1995, proceedings, Peter Baumgartner, Reiner Hähnle, Joachim Posegga (eds.), Berlin, Springer, 1995, 1 vol. (X-352 p.), Lecture notes in computer science, 3-540-59338-1 • Theorem Proving with Analytic Tableaux and Related Methods, Texte imprimé, 9783662192030 |
Indholdsfortegnelse:
- Issues in theorem proving based on the connection method
- Rigid E-unification simplified
- Generating finite counter examples with semantic tableaux
- Semantic tableaus for inheritance nets
- Using connection method in modal logics: Some advantages
- Labelled tableaux for multi-modal logics
- Refutation systems for prepositional modal logics
- On transforming intuitionistic matrix proofs into standard-sequent proofs
- A connection based proof method for intuitionistic logic
- Tableau for intuitionistic predicate logic as metatheory
- Model building and interactive theory discovery
- Link deletion in model elimination
- Specifications of inference rules and their automatic translation
- Constraint model elimination and a PTTP-implementation
- Non-elementary speedups between different versions of tableaux
- Syntactic reduction of predicate tableaux to propositional tableaux
- Classical Lambek logic
- Linear logic with isabelle: Pruning the proof search tree
- Linear analytic tableaux
- Higher-order tableaux
- Propositional logics on the computer
- MacKE: Yet another proof assistant & automated pedagogic tool
- Using the theorem prover SETHEO for verifying the development of a communication protocol in FOCUS -A Case Study-.