The problem of guaranteeing the existence of a complete set of reductions

DOI10.1007/BF00248325zbMath0679.68176OpenAlexW2053416640WikidataQ114267058 ScholiaQ114267058MaRDI QIDQ1823015

Larry Wos

Publication date: 1989

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00248325

zbMATH Keywords

automated reasoningautomated theorem provinginference rulesreduction sets

Mathematics Subject Classification ID

Cites Work

• Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
• The Concept of Demodulation in Theorem Proving
• Ternary Boolean algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The problem of guaranteeing the existence of a complete set of reductions