The problem of guaranteeing the existence of a complete set of reductions (Q1823015)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The problem of guaranteeing the existence of a complete set of reductions |
scientific article; zbMATH DE number 4114099
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The problem of guaranteeing the existence of a complete set of reductions |
scientific article; zbMATH DE number 4114099 |
Statements
The problem of guaranteeing the existence of a complete set of reductions (English)
0 references
1989
0 references
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.
0 references
automated reasoning
0 references
inference rules
0 references
reduction sets
0 references
automated theorem proving
0 references
