Skip to main content
Conference Proceedings

A time efficient KE based theorem prover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1999) 1617 313-318
DOI: 10.1007/3-540-48754-9_27
1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We present a proof procedure based on the KE calculus for propositional logic and its implementation as a short Prolog program. The procedure's time complexity is discussed and compared to that of an efficient Tableau based prover.

Cite

CITATION STYLE

APA

Endriss, U. (1999). A time efficient KE based theorem prover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1617, pp. 313–318). Springer Verlag. https://doi.org/10.1007/3-540-48754-9_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free