3773 search results - page 302 / 755 » Logical Reasoning |
159
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we repor...
176
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
In the "little theories" version of the axiomatic method, different portions of mathematics are developed in various different formal axiomatic theories. Axiomatic theor...
194
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
network of theories. Results are typically proved in compact, abstract theories, and then transported as needed to more concrete theories, or indeed to Supported by the MITRE-Spon...
161
click to vote
CADE
1992
Springer
15 years 10 months ago
1992
Springer
There are syntactically identifiable situations in which reduction does not occur in chain format linear deduction systems, i.e. situations in which linear-input subdeductions are ...
152
click to vote
CADE
1990
Springer
15 years 10 months ago
1990
Springer
In automated deduction systems that are intended for human use, the presentation of a proof is no less important than its discovery. For most of today's automated theorem pro...