EXTENDING THE PROOF PLAN METHODOLOGY TO COMPUTER CONFIGURATION PROBLEMS
Author:
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in Applied Artificial Intelligence
- Vol. 5 (3) , 227-252
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.Keywords
This publication has 3 references indexed in Scilit:
- Expert systems for configuration at Digital: XCON and beyondCommunications of the ACM, 1989
- R1: A rule-based configurer of computer systemsArtificial Intelligence, 1982
- Planning with constraints (MOLGEN: Part 1)Artificial Intelligence, 1981