Unifiability is complete for co-N Log Space

DOI10.1016/0020-0190(82)90121-1zbMath0503.68031OpenAlexW2081848946MaRDI QIDQ1173403

Harry R. Lewis, Richard Statman

Publication date: 1982

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(82)90121-1

zbMATH Keywords

provingfirst-order termscommon substitution-instancemechanical theoremnondeterministic logarithmic spaceunification computation

Mathematics Subject Classification ID

Related Items (1)

On the logic of unification

Cites Work

• Space-bounded reducibility among combinatorial problems
• Linear unification
• A Machine-Oriented Logic Based on the Resolution Principle

This page was built for publication: Unifiability is complete for co-N Log Space