Theorem proving with analytic tableaux and related methods : 4th International Workshop, TABLEAUX '95, Schloß Rheinfels, St. Goar, Germany, May 7-10, 1995 : proceedings
著者
書誌事項
Theorem proving with analytic tableaux and related methods : 4th International Workshop, TABLEAUX '95, Schloß Rheinfels, St. Goar, Germany, May 7-10, 1995 : proceedings
（Lecture notes in computer science, 918 . Lecture notes in artificial intelligence）
Springer Verlag, c1995
大学図書館所蔵 件 / 全54件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
この図書・雑誌をさがす
注記
Includes bibliographical references
内容説明・目次
内容説明
This volume constitutes the proceedings of the 4th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods, TABLEAU '95, held at Schloss 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
目次
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-.
「Nielsen BookData」 より