论文信息 - Leant a P: Lean Tableau-based Theorem Proving - 字舞流文

Leant a P: Lean Tableau-based Theorem Proving

implements a rst-order theorem prover based on free-variable semantic tableaux. It is complete, sound, and eecient.

Bernhard Beckert

[1] Elmar Eder,et al. Relative complexities of first order calculi , 1992, Artificial intelligence = Künstliche Intelligenz.

[2] Bernhard Beckert,et al. The Tableau – Based Theorem Prover 3 T AP for Multiple – Valued Logics ∗ , 1992 .

[3] Melvin Fitting,et al. First-Order Logic and Automated Theorem Proving , 1990, Graduate Texts in Computer Science.

[4] Joachim Posegga. Compiling Proof Search in Semantic Tableaux , 1993, ISMIS.

[5] Francis Jeffry Pelletier,et al. Seventy-five problems for testing automatic theorem provers , 1986, Journal of Automated Reasoning.

[6] Bernhard Beckert,et al. An Improved Method for Adding Equality to Free Variable Semantic Tableaux , 1992, CADE.

[7] François Bry,et al. SATCHMO: A Theorem Prover Implemented in Prolog , 1988, CADE.

[8] Mark E. Stickel. A Prolog technology theorem prover , 2009, New Generation Computing.