A Search Technique for Clause Interconnectivity Graphs

DOI10.1109/TC.1976.1674701zbMATH Open0331.68053OpenAlexW1963804765MaRDI QIDQ4096461FDOQ4096461

Authors: Sharon Sickel 

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

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Cited In (9)

• Inconsistency check of a set of clauses using Petri net reductions
• Paramodulated connection graphs
• A new subsumption method in the connection graph proof procedure
• Speeding up inferences using relevance reasoning: a formalism and algorithms
• Rewrite systems on a lattice of types
• Reduction rules for resolution-based systems
• Using rewriting rules for connection graphs to prove theorems
• A comparative study of several proof procedures
• The linked conjunct method for automatic deduction and related search techniques

This page was built for publication: A Search Technique for Clause Interconnectivity Graphs

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