Hostname: page-component-78c5997874-xbtfd Total loading time: 0 Render date: 2024-11-10T16:53:23.220Z Has data issue: false hasContentIssue false
  • English
  • Français

Proof planning for maintainable configuration systems

Published online by Cambridge University Press:  01 September 1998

HELEN LOWE ,
MICHAL PECHOUCEK  and
ALAN BUNDY
HELEN LOWE
Affiliation:
Department of Computer Studies, Glasgow Caledonian University, Cowcaddens Road, Glasgow, Scotland
MICHAL PECHOUCEK
Affiliation:
Gerstner Laboratory for Intelligent Decision Making, Czech Technical University in Prague
ALAN BUNDY
Affiliation:
Department of Artificial Intelligence, University of Edinburgh, England
Get access Rights & Permissions [Opens in a new window]

Abstract

Configuration is a complex task generally involving varying measures of constraint satisfaction, optimization, and the management of soft constraints. Although many successful systems have been developed, these are often difficult to maintain and to generalize in rapidly changing domains. In this paper, we consider building intelligent knowledge-based systems with maintainability well to the fore in our requirements for such systems. We introduce two case studies: the initial proof of concept, which was in the domain of computer configuration, and a further field-tested study, the configuration of compressors. Central to our approach is the use of the proof planning technique, and the clean separation of different kinds of knowledge: factual, heuristic, and strategic.

Keywords

ConfigurationProof PlanningMaintainabilityKnowledge-based Systems
Type
ARTICLES
Information
AI EDAM , Volume 12 , Issue 4 , September 1998 , pp. 345 - 356
Copyright
© 1998 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)