Miglioli / Ornaghi / Moscato | Theorem Proving with Analytic Tableaux and Related Methods | Buch | 978-3-540-61208-7 | sack.de

Buch, Englisch, Band 1071, 336 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1080 g

Reihe: Lecture Notes in Computer Science

Miglioli / Ornaghi / Moscato

Theorem Proving with Analytic Tableaux and Related Methods

5th International Workshop, TABLEAUX '96, Terrasini (Palermo), Italy, May 15 - 17, 1996. Proceedings
1996
ISBN: 978-3-540-61208-7
Verlag: Springer Berlin Heidelberg

5th International Workshop, TABLEAUX '96, Terrasini (Palermo), Italy, May 15 - 17, 1996. Proceedings

Buch, Englisch, Band 1071, 336 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 1080 g

Reihe: Lecture Notes in Computer Science

ISBN: 978-3-540-61208-7
Verlag: Springer Berlin Heidelberg


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 this dynamic area of research. Besides more traditional aspects of tableaux reasoning, the collection also contains several papers dealing with other approaches to automated reasoning. The spectrum of logics dealt with covers several nonclassical logics, including modal, intuitionistic, many-valued, temporal and linear logic.
Miglioli / Ornaghi / Moscato Theorem Proving with Analytic Tableaux and Related Methods jetzt bestellen!

Zielgruppe


Research

Weitere Infos & Material


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.



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.