Unifiability is complete for co-N Log Space

DOI10.1016/0020-0190(82)90121-1zbMATH Open0503.68031OpenAlexW2081848946MaRDI QIDQ1173403FDOQ1173403

Authors: 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

Analysis of algorithms and problem complexity (68Q25)

Cites Work

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

Cited In (1)

• On the logic of unification

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1173403)