Completion procedures as semidecision procedures
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 206-232
- https://doi.org/10.1007/3-540-54317-1_92
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- Proof by consistency in equational theoriesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Automated proofs of the moufang identities in alternative ringsJournal of Automated Reasoning, 1990
- Heuristical criteria in refutational theorem provingPublished by Springer Nature ,1990
- On restrictions of ordered paramodulation with simplificationPublished by Springer Nature ,1990
- KBlab: An equational theorem prover for the MacintoshLecture Notes in Computer Science, 1989
- SbReve2: A term rewriting laboratory with (AC)-unfailing completionLecture Notes in Computer Science, 1989
- Termination of rewritingJournal of Symbolic Computation, 1987
- Completion for rewriting modulo a congruencePublished by Springer Nature ,1987
- Computing with rewrite systemsInformation and Control, 1985
- Proving termination with multiset orderingsCommunications of the ACM, 1979