Abstract
The techniques of clausal rewriting and completion are presented. The methods described provide several theorem proving techniques in first order logic with equality. The clausal completion procedure generates few new axioms and is compatible with the powerful clausal rewriting technique for simplification and deletion of redundant axioms.
Cite
CITATION STYLE
APA
Nieuwenhuis, R., & Orejas, F. (1991). Clausal rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 516 LNCS, pp. 246–258). Springer Verlag. https://doi.org/10.1007/3-540-54317-1_95
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free