A Search Technique for Clause Interconnectivity Graphs
From MaRDI portal
Publication:4096461
DOI10.1109/TC.1976.1674701zbMath0331.68053OpenAlexW1963804765MaRDI QIDQ4096461
Publication date: 1976
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.1976.1674701
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (9)
Inconsistency check of a set of clauses using Petri net reductions ⋮ Speeding up inferences using relevance reasoning: a formalism and algorithms ⋮ Using rewriting rules for connection graphs to prove theorems ⋮ Reduction rules for resolution-based systems ⋮ A new subsumption method in the connection graph proof procedure ⋮ Paramodulated connection graphs ⋮ A comparative study of several proof procedures ⋮ The linked conjunct method for automatic deduction and related search techniques ⋮ Rewrite systems on a lattice of types
This page was built for publication: A Search Technique for Clause Interconnectivity Graphs
