Paramodulated connection graphs
From MaRDI portal
Publication:1257912
DOI10.1007/BF00288537zbMath0407.05070OpenAlexW2075155148MaRDI QIDQ1257912
Graham Wrightson, Jörg H. Siekmann
Publication date: 1980
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00288537
Related Items (3)
Link inheritance in abstract clause graphs ⋮ Reduction rules for resolution-based systems ⋮ Paramodulated connection graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New decision algorithms for finitely presented commutative semigroups
- Refutation graphs
- Paramodulated connection graphs
- Resolution graphs
- A Search Technique for Clause Interconnectivity Graphs
- Proving Theorems with the Modification Method
- A Proof Procedure Using Connection Graphs
- A Machine-Oriented Logic Based on the Resolution Principle
- The word problem
This page was built for publication: Paramodulated connection graphs
