Skip to main content
Conference Proceedings

Semantic trees revisited: Some new completeness results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1104 568-582
DOI: 10.1007/3-540-61511-3_114
0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The method of proving refutational completeness via semantic trees is extended to cope with some new proof search refinements of resolution. It is also shown that a broad class of refinements can be combined with various deletion rules and a strong restriction on factoring without loosing completeness.

Cite

CITATION STYLE

APA

Fermüller, C. G. (1996). Semantic trees revisited: Some new completeness results. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1104, pp. 568–582). Springer Verlag. https://doi.org/10.1007/3-540-61511-3_114

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