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

DOI10.1016/0004-3702(71)90013-0zbMATH Open0234.68035OpenAlexW2013565918MaRDI QIDQ2551695FDOQ2551695

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

Cites Work

• A Machine-Oriented Logic Based on the Resolution Principle
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• Title not available (Why is that?)
• The Unit Proof and the Input Proof in Theorem Proving
• Title not available (Why is that?)
• Experiments in automatic learning for a multipurpose hueristic program
• Completeness of Linear Refutation for Theories with Equality

Cited In (5)

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

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

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