Compiling proof search in semantic tableaux
An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program that performs the search for a proof at runtime. This results in more efficient proof search, since the tableau needs not to be expanded any more, but the proof consists of determining whether it can be closed, only. It is shown how the method can be applied for compiling to the target language Prolog, although any other general purpose language can be used.
Unable to display preview. Download preview PDF.
- Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.Google Scholar
- Reiner Hähnle & Peter H. Schmitt. The liberalized δ-rule in free variable semantic tableaux. to appear, 1991.Google Scholar
- Francis Jeffry Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.Google Scholar
- Joachim Posegga & Bertram Ludäscher. Towards first-order deduction based on shannon graphs. In Proc. German Workshop on Artificial Intelligence, LNAI, Bonn, Germany, 1992. Springer.Google Scholar
- Joachim Posegga. First-order Deduction with Shannon Graphs. PhD thesis, University of Karlsruhe, Karlsruhe, FRG, forthcoming 1993.Google Scholar
- Mark E. Stickel. A Prolog Technology Theorem Prover. In E. Lusk & R. Overbeek, editors, 9th International Conference on Automated Deduction, Argonne, Ill., May 1988. Springer-Verlag.Google Scholar