Skip to main content
Conference Proceedings

UNICOM: A refined completion based inductive theorem prover

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1990) 449 LNAI 655-656
DOI: 10.1007/3-540-52885-7_127
4Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Gramlich, B. (1990). UNICOM: A refined completion based inductive theorem prover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 449 LNAI, pp. 655–656). Springer Verlag. https://doi.org/10.1007/3-540-52885-7_127

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