Resolution graphs

DOI10.1016/0004-3702(70)90011-1zbMath0207.02204OpenAlexW4246345775MaRDI QIDQ2543000

B. Raphael, T. P. Hart, R. A. Yates

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)90011-1

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Exploiting Resolution-Based Representations for MaxSAT Solving ⋮ Using rewriting rules for connection graphs to prove theorems ⋮ Refutation graphs ⋮ Paramodulated connection graphs ⋮ Linear resolution with selection function ⋮ A note on linear resolution strategies in consequence-finding

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theorem Proving by Covering Expressions
• Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
• A Machine-Oriented Logic Based on the Resolution Principle
• Automatic Theorem Proving With Renamable and Semantic Resolution
• The Concept of Demodulation in Theorem Proving
• Semi-Automated Mathematics
• Resolution With Merging
• A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness