EXTENDING THE PROOF PLAN METHODOLOGY TO COMPUTER CONFIGURATION PROBLEMS
The work
| Authors | Helen Lowe |
|---|---|
| Editors | |
| Type | article |
| Year | 1991 |
| Citekey | lowe1991extending |
Where it appeared
| Published in | Applied Artificial Intelligence |
|---|---|
| Publisher | Taylor & Francis |
| Volume | 5 |
| Issue | 3 |
| Pages | 227--252 |
Identifiers
| DOI | 10.1080/08839519108927927 |
|---|---|
| OpenAlex | W1992786186 |
Access
| Landing page | https://doi.org/10.1080/08839519108927927 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
Can the technique of proof plans, developed originally for use in theorem proving, be successfully applied outside mathematics? We look at a problem associated with the configuration of large computer systems, namely that of checking orders drawn up by sales people on behalf of customers. Strategies exist for this task which may be explicitly encoded. We discuss the formation of plans for order checking and the factors involved in determining whether such plans can be guaranteed to succeed.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-25 12:06 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{lowe1991extending,
title = {EXTENDING THE PROOF PLAN METHODOLOGY TO COMPUTER CONFIGURATION PROBLEMS},
author = {Helen Lowe},
year = {1991},
journal = {Applied Artificial Intelligence},
publisher = {Taylor \& Francis},
volume = {5},
number = {3},
pages = {227--252},
doi = {10.1080/08839519108927927},
}
This record lives at https://refs.drheap.org/lowe1991extending/ and will keep doing so.