论文信息 - Hyper Tableaux - The Third Version

Hyper Tableaux - The Third Version

The first hyper tableau suffers from blind guessing in instancing the clauses, and evolves into the unification-driven style, the second version. However, we found a counterexample of it. We modify the calculus and a new hyper tableau is represented.

Shasha Feng | Jigui Sun | Xia Wu

[1] Reinhold Letz,et al. Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux , 2001, LPAR.

[2] Michael Kühn. Rigid Hypertableaux , 1997, KI.

[3] Daniel Brand. Analytic Resolution in Theorem Proving , 1976, Artif. Intell..

[4] Peter Baumgartner,et al. Hyper Tableau - The Next Generation , 1998, TABLEAUX.

[5] Peter Baumgartner,et al. FDPLL - A First Order Davis-Putnam-Longeman-Loveland Procedure , 2000, CADE.

[6] Christoph Goller,et al. Controlled integration of the cut rule into connection tableau calculi , 2004, Journal of Automated Reasoning.

[7] Peter Baumgartner,et al. The Model Evolution Calculus , 2003, CADE.

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

[9] Peter Baumgartner,et al. Hyper Tableaux , 1996, JELIA.

[10] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.