The University of Edinburgh -
Division of Informatics
Forrest Hill & 80 South Bridge

Research Paper #537

Title:Extending the Proof Plan Methodology to Computer Configuration Problems
Date: 1991
Presented:To appear in AI Applications, Vol. 5, 1991
Abstract:This paper examines whether the technique of proof plans, developed originally for use in theorem proving, can be successfully applied outwith 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.

[Search These Pages] [DAI Home Page] [Comment]