Theorem proving with analytic tableaux and related methods : 5th international workshop, TABLEAUX '96, Terrasini, Palermo, Italy, May 15 17, 1996 : proceedings
This books presents the refereed proceedings of the Fifth International Workshop on Analytic Tableaux and Related Methods, TABLEAUX '96, held in Terrasini near Palermo, Italy, in May 1996. The 18 full revised papers included together with two invited papers present state-of-the-art results in t...
সংরক্ষণ করুন:
| প্রধান লেখক: | |
|---|---|
| সংস্থা লেখক: | |
| অন্যান্য লেখক: | , |
| বিন্যাস: | Livre numérique |
| ভাষা: | Anglais |
| প্রকাশিত: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| মালা: | Lecture notes in computer science. Lecture notes in artificial intelligence
1071 |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| টীকা: |
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, 5th international workshop, TABLEAUX '96, Terrasini, Palermo, Italy, 15-17th, 1996, proceedings, P. Miglioli, U. Moscato, D. Mundici ... [et al.], eds, 1996, Berlin, Springer, 1 vol. (X-329 p.), Lecture notes in computer science, 3-540-61208-4 • Theorem Proving with Analytic Tableaux and Related Methods, Texte imprimé, 9783662175521 |
সূচিপত্রের সারণি:
- On sets, types, fixed points, and checkerboards
- Fibred tableaux for multi-implication logics
- Interpolation for a sequent calculus of generalized quantifiers
- Almost duplication-free tableau calculi for prepositional lax logics
- Combining many-valued and intuitionistic tableaux
- Cyclic connections
- Incremental theory reasoning methods for semantic tableaux
- The disconnection method
- Sequent calculi for default and autoepistemic logics
- Minimal model generation with positive unit hyper-resolution tableaux
- Distributed modal theorem proving with KE
- A simple tableau system for the logic of elsewhere
- Situational Calculus, linear connection proofs and STRIPS-like planning: An experimental comparison
- Efficient loop-check for backward proof search in some non-classical propositional logics
- Strong normalization for all-style LKtq
- T-string unification: Unifying prefixes in non-classical proof methods
- A timing refinement of intuitionistic proofs and its application to the timing analysis of combinational circuits
- A tableau calculus for minimal model reasoning
- On the intuitionistic force of classical search (Extended abstract)
- Proof-search in intuitionistic logic based on constraint satisfaction.