Theorem Proving with Analytic Tableaux and Related Methods

4th International Workshop, TABLEAUX-95, Schloß Rheinfels, St. Goar, Germany, May 7 - 10, 1995. Proceedings
Buch | Softcover
XI, 361 Seiten
1995 | 1995
Springer Berlin (Verlag)
978-3-540-59338-6 (ISBN)

Lese- und Medienproben

Theorem Proving with Analytic Tableaux and Related Methods -
53,49 inkl. MwSt
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 device because of their advantages at the presentation level. The 23 full revised papers in this book bear witness that these methods have now gained fundamental importance in theorem proving, particularly as competitors for resolution methods. The book is organized in sections on extensions, modal logic, intuitionistic logic, the connection method and model elimination, non-clausal proof procedures, linear logic, higher-order logic, and applications

Peter Baumgartner, geboren 1969, lebt in Gmunden am Traunsee, Österreich. Er ist Redner und Autor, Wirtschaftsingenieur und Dipl. Pädagoge. Er wurde ausgezeichnet mit dem Wirtschaftsliteraturpreis & Wirtschaftsbuch des Jahres. Er ist Redner auf Kongressen und Tagungen zu: Grenzgänge am Limit, Manager müssen Mut machen und Leadership.

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-.

Erscheint lt. Verlag 26.4.1995
Reihe/Serie Lecture Notes in Artificial Intelligence
Lecture Notes in Computer Science
Zusatzinfo XI, 361 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 233 mm
Gewicht 491 g
Themenwelt Informatik Theorie / Studium Künstliche Intelligenz / Robotik
Mathematik / Informatik Mathematik Logik / Mengenlehre
Schlagworte Analytic Tableaus • Analytische Tableaus • Automatisches Beweisverfahren • Beweis (Mathematik) • Beweistheorie • Classical Logics • extension • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Klassische Logikes • Logic • Mathematische Logik • Nicht-klassische Logiken • Nonclassical Logics • proving • Resolution • Tableau Calculi • Tableau-Kalküle • theorem proving
ISBN-10 3-540-59338-1 / 3540593381
ISBN-13 978-3-540-59338-6 / 9783540593386
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Eine kurze Geschichte der Informationsnetzwerke von der Steinzeit bis …

von Yuval Noah Harari

Buch | Hardcover (2024)
Penguin (Verlag)
28,00