ヒント: 日本語の検索結果のみ表示します。検索言語は [表示設定] で指定できます
TPS is a theorem proving system for first- and higher-order logic which runs in Common Lisp and can operate in automatic, semi-automatic, and interactive ...
Theorem Proving System
Theorem Proving System は、一次および高次ロジック用の自動化された定理証明システムです。 TPS は、カーネギー メロン大学で開発されました。その教育版は ETPS として知られています。 ウィキペディア（英語)
プログラミング言語： Common Lisp
TPS is a theorem proving environment for first- and higher-order logic. It provides for automatic, semi-automatic, and interactive modes of proof, ...
TPS is a theorem proving system for first- and higher-order logic. It provides for automatic, semi-automatic, and interactive modes of proof, and contains ...
自動定理証明（じどうていりしょうめい、英: automated theorem proving, ATP）とは、自動推論 (AR) の中でも最も成功している分野であり、コンピュータプログラム ...
Contents. Proceedings of the 9th International Conference on Automated Deduction. The TPS Theorem Proving System. Pages 760 - 761. PREVIOUS ARTICLE. ZPLAN.
The TPS Theorem Proving System · Contents. Proceedings of the 10th International Conference on Automated Deduction. The TPS Theorem Proving System. Pages 641 - ...
The Theorem Proving System (TPS) is an automated theorem proving system for first-order and higher-order logic. TPS has been developed at Carnegie Mellon ...
This is a description of TPS, a theorem proving system for classical type theory (Church's typed λ-calculus). TPS has been designed to be a general research ...
In automatic mode, TPS first searches for an expansion proof, which expresses in a nonredundant way the fundamental logical structure underlying various proofs ...
TPS: A Theorem Proving System for Type Theory - ResearchGate
www.researchgate.net › ... › Type Theory
Introduction This is a brief update on the Tps automated theorem proving system for classical type theory, which was described in [3].