Name
Title | ||
|---|---|---|
A new use of an automated reasoning assistant: open questions in equivalential calculus and the study of infinite domains |
Abstract | ||
|---|---|---|
The field of automated reasoning is an outgrowth of the field of automated theorem proving. The difference in the two fields is not so much in the procedures on which they rest, but rather in the way the corresponding programs are used. Here we present a comprehensive treatment of the use of an automated reasoning program to answer certain previously open questions from equivalential calculus. The questions are answered with a uniform method that employs schemata to study the infinite domain of theorems deducible from certain formulas. We include sufficient detail both to permit the work to be duplicated and to enable one to consider other applications of the techniques. Perhaps more important than either the results or the methodology is the demonstration of how an automated reasoning program can be used as an assistant and a colleague. Precise evidence is given of the nature of this assistance. |
Year | DOI | Venue |
|---|---|---|
1984 | 10.1016/0004-3702(84)90054-7 | Artif. Intell. |
Keywords | Field | DocType |
new use,automated reasoning assistant,open question,infinite domain,equivalential calculus,automated reasoning | Automated reasoning,Computer science,Automated theorem proving,Automated proof checking,Schema (psychology),Calculus | Journal |
Volume | Issue | ISSN |
22 | 3 | 0004-3702 |
Citations | PageRank | References |
24 | 8.21 | 12 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| L Wos | 1 | 115 | 29.69 |
| S Winker | 2 | 79 | 24.44 |
| B Smith | 3 | 24 | 8.21 |
| Robert Veroff | 4 | 37 | 9.73 |
| L Henschen | 5 | 24 | 8.21 |