The Concept of Weak Substitution in Theorem-Proving

DOI10.1145/321784.321792zbMath0273.68059OpenAlexW2042066678MaRDI QIDQ5180874

Rona B. Stillman

Publication date: 1973

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321784.321792

Mathematics Subject Classification ID

Related Items (7)

On the time and tape complexity of weak unification ⋮ Removing redundancy from a clause ⋮ A new subsumption method in the connection graph proof procedure ⋮ An efficient subsumption test pipeline for BS(LRA) clauses ⋮ Thue trees ⋮ Properties of substitutions and unifications ⋮ Subsumption algorithms based on search trees

This page was built for publication: The Concept of Weak Substitution in Theorem-Proving