Renamable paramodulation for automatic theorem proving with equality

DOI10.1016/0004-3702(70)90010-XzbMath0207.02203MaRDI QIDQ2542996

Yanyan Li

Publication date: 1970

Published in: Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items (1)

Theorem proving with variable-constrained resolution

Cites Work

• Automatic Theorem Proving With Renamable and Semantic Resolution
• The Concept of Demodulation in Theorem Proving
• Theorem-Proving for Computers: Some Results on Resolution and Renaming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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