Experiments with a heuristic theorem-proving program for predicate calculus with equality

DOI10.1016/0004-3702(71)90013-0zbMath0234.68035OpenAlexW2013565918MaRDI QIDQ2551695

Lewis M. Norton

Publication date: 1971

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

Full work available at URL: https://doi.org/10.1016/0004-3702(71)90013-0

Mathematics Subject Classification ID

Related Items (5)

The practicality of generating semantic trees for proofs of unsatisfiability ⋮ A relaxation approach to splitting in an automatic theorem prover ⋮ Non-resolution theorem proving ⋮ Splitting and reduction heuristics in automatic theorem proving ⋮ MRPPS?An interactive refutation proof procedure system for question-answering

Cites Work

• Unnamed Item
• Unnamed Item
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• A Machine-Oriented Logic Based on the Resolution Principle
• The Unit Proof and the Input Proof in Theorem Proving
• Experiments in automatic learning for a multipurpose hueristic program
• Completeness of Linear Refutation for Theories with Equality

This page was built for publication: Experiments with a heuristic theorem-proving program for predicate calculus with equality