Renamable paramodulation for automatic theorem proving with equality

DOI10.1016/0004-3702(70)90010-XMaRDI QIDQ2542996zbMATH OpenFDO

Authors Yanyan Li

Publication date 1970

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0004-3702(70)90010-X

Mathematics Subject Classification ID

Cites work

• Automatic Theorem Proving With Renamable and Semantic Resolution
• scientific article; zbMATH DE number 3278281 (Why is no real title available?)
• scientific article; zbMATH DE number 3310921 (Why is no real title available?)
• scientific article; zbMATH DE number 3332500 (Why is no real title available?)
• scientific article; zbMATH DE number 3339447 (Why is no real title available?)
• scientific article; zbMATH DE number 3349331 (Why is no real title available?)
• The Concept of Demodulation in Theorem Proving
• Theorem-Proving for Computers: Some Results on Resolution and Renaming

Cited in

(1)

• Theorem proving with variable-constrained resolution

This page was built for publication: Renamable paramodulation for automatic theorem proving with equality

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