The problem of guaranteeing the existence of a complete set of reductions
type: Item
instance of: scholarly article
title: The problem of guaranteeing the existence of a complete set of reductions
zbMATH Open document ID: 0679.68176
DOI: 10.1007/BF00248325
author: Larry Wos
published in: Journal of Automated Reasoning
publication date: 1989-01-01T00:00:00Z
review text: In these and in the following two papers the problems mentioned in their title are discussed. The problems already have been listed earlier by the author [Automated Reasoning: 33 Research Problems; Prentice-Hall (1987; Zbl 0663.68102)], they all are connected with the field of automated theorem proving, and each one of the three problems is explained with hints on its relevance as well as on possible tests for (partial) solutions.
reviewed by: Siegfried J. Gottwald
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 03B35
zbMATH DE Number: 4114099
zbMATH Keywords: automated reasoning
zbMATH Keywords: inference rules
zbMATH Keywords: reduction sets
zbMATH Keywords: automated theorem proving
Wikidata QID: Q114267058
MaRDI profile type: Publication
cites work: Q3721811
cites work: Ternary Boolean algebra
cites work: Q5581665
cites work: Q5624683
cites work: Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
cites work: Q3994754
cites work: Q3829089
cites work: Q4770009
cites work: The Concept of Demodulation in Theorem Proving
full work available at URL: https://doi.org/10.1007/bf00248325
OpenAlex ID: W2053416640
description: scientific article; zbMATH DE number 4114099