Case-Based Planning in an Exploratory Discovery System

Ruediger Oehlmann, Derek Sleeman, Peter Edwards

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

It has been argued that the case-based reasoning method combined with case-based planning can be used to improve a machine discovery system (R. Oehlmann, D. Sleeman and P. Edwards, 1992). In contrast to the case-based approach, current machine discovery systems typically use experimental results to generate explanations without using previous experience. Furthermore, machine discovery systems do not employ strategies which support the controlled exploration of different options for experimentation. In the authors' implementation, IULIAN, case-based planners were used to generate self-questions, answers, and experiments, thus combining the two approaches. They argue that: the reasoning process represented by self-questions and answers can be planned and the index of a question plan should utilise information about previous failures of the reasoning process. The authors present a top level view of the IULIAN system and discuss their approach to planning the reasoning process. They use the example of question plans to describe important aspects of IULIAN's memory organisation and the related indexing problem. They also evaluate the approach and discuss various options for future work.
Original languageEnglish
Title of host publicationProceedings of IEE Colloquium on Case Based Reasoning
EditorsMax Bramer
Place of PublicationLondon
PublisherIET
Pages1/1 - 1/3
Publication statusPublished - 1993

Fingerprint

Planning
Case based reasoning
Data storage equipment
Experiments

Cite this

Oehlmann, R., Sleeman, D., & Edwards, P. (1993). Case-Based Planning in an Exploratory Discovery System. In M. B. (Ed.), Proceedings of IEE Colloquium on Case Based Reasoning (pp. 1/1 - 1/3). London: IET.

Case-Based Planning in an Exploratory Discovery System. / Oehlmann, Ruediger; Sleeman, Derek; Edwards, Peter.

Proceedings of IEE Colloquium on Case Based Reasoning. ed. / Max Bramer. London : IET, 1993. p. 1/1 - 1/3.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Oehlmann, R, Sleeman, D & Edwards, P 1993, Case-Based Planning in an Exploratory Discovery System. in MB (ed.), Proceedings of IEE Colloquium on Case Based Reasoning. IET, London, pp. 1/1 - 1/3.
Oehlmann R, Sleeman D, Edwards P. Case-Based Planning in an Exploratory Discovery System. In MB, editor, Proceedings of IEE Colloquium on Case Based Reasoning. London: IET. 1993. p. 1/1 - 1/3
Oehlmann, Ruediger ; Sleeman, Derek ; Edwards, Peter. / Case-Based Planning in an Exploratory Discovery System. Proceedings of IEE Colloquium on Case Based Reasoning. editor / Max Bramer. London : IET, 1993. pp. 1/1 - 1/3
@inproceedings{ce24dd706e23402a9d4b66323a8f581e,
title = "Case-Based Planning in an Exploratory Discovery System",
abstract = "It has been argued that the case-based reasoning method combined with case-based planning can be used to improve a machine discovery system (R. Oehlmann, D. Sleeman and P. Edwards, 1992). In contrast to the case-based approach, current machine discovery systems typically use experimental results to generate explanations without using previous experience. Furthermore, machine discovery systems do not employ strategies which support the controlled exploration of different options for experimentation. In the authors' implementation, IULIAN, case-based planners were used to generate self-questions, answers, and experiments, thus combining the two approaches. They argue that: the reasoning process represented by self-questions and answers can be planned and the index of a question plan should utilise information about previous failures of the reasoning process. The authors present a top level view of the IULIAN system and discuss their approach to planning the reasoning process. They use the example of question plans to describe important aspects of IULIAN's memory organisation and the related indexing problem. They also evaluate the approach and discuss various options for future work.",
author = "Ruediger Oehlmann and Derek Sleeman and Peter Edwards",
year = "1993",
language = "English",
pages = "1/1 -- 1/3",
editor = "{Max Bramer}",
booktitle = "Proceedings of IEE Colloquium on Case Based Reasoning",
publisher = "IET",

}

TY - GEN

T1 - Case-Based Planning in an Exploratory Discovery System

AU - Oehlmann, Ruediger

AU - Sleeman, Derek

AU - Edwards, Peter

PY - 1993

Y1 - 1993

N2 - It has been argued that the case-based reasoning method combined with case-based planning can be used to improve a machine discovery system (R. Oehlmann, D. Sleeman and P. Edwards, 1992). In contrast to the case-based approach, current machine discovery systems typically use experimental results to generate explanations without using previous experience. Furthermore, machine discovery systems do not employ strategies which support the controlled exploration of different options for experimentation. In the authors' implementation, IULIAN, case-based planners were used to generate self-questions, answers, and experiments, thus combining the two approaches. They argue that: the reasoning process represented by self-questions and answers can be planned and the index of a question plan should utilise information about previous failures of the reasoning process. The authors present a top level view of the IULIAN system and discuss their approach to planning the reasoning process. They use the example of question plans to describe important aspects of IULIAN's memory organisation and the related indexing problem. They also evaluate the approach and discuss various options for future work.

AB - It has been argued that the case-based reasoning method combined with case-based planning can be used to improve a machine discovery system (R. Oehlmann, D. Sleeman and P. Edwards, 1992). In contrast to the case-based approach, current machine discovery systems typically use experimental results to generate explanations without using previous experience. Furthermore, machine discovery systems do not employ strategies which support the controlled exploration of different options for experimentation. In the authors' implementation, IULIAN, case-based planners were used to generate self-questions, answers, and experiments, thus combining the two approaches. They argue that: the reasoning process represented by self-questions and answers can be planned and the index of a question plan should utilise information about previous failures of the reasoning process. The authors present a top level view of the IULIAN system and discuss their approach to planning the reasoning process. They use the example of question plans to describe important aspects of IULIAN's memory organisation and the related indexing problem. They also evaluate the approach and discuss various options for future work.

M3 - Conference contribution

SP - 1/1 - 1/3

BT - Proceedings of IEE Colloquium on Case Based Reasoning

A2 - null, Max Bramer

PB - IET

CY - London

ER -