Using rewriting rules for connection graphs to prove theorems

DOI10.1016/0004-3702(79)90015-8zbMath0429.68078OpenAlexW2037274636MaRDI QIDQ1137877

S. H. Smith

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0004-3702(79)90015-8

zbMATH Keywords

resolution principlerewriting rulesconnection graph procedure

Mathematics Subject Classification ID

Related Items (3)

Formula dissection: A parallel algorithm for constraint satisfaction ⋮ Reduction rules for resolution-based systems ⋮ A theory of abstraction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refutation graphs
• Resolution graphs
• Theorem proving with variable-constrained resolution
• An improved proof procedure1
• Refutations by Matings
• A Search Technique for Clause Interconnectivity Graphs
• A Proof Procedure Using Connection Graphs
• Theorem Proving by Covering Expressions
• A Machine-Oriented Logic Based on the Resolution Principle
• The Specialization of Programs by Theorem Proving

This page was built for publication: Using rewriting rules for connection graphs to prove theorems