In this paper, we argue that KBS validation should not be limited to testing functional properties of the system, such as its input - output behavior, but must also address its dynamic properties, such as its run-time performance. We describe an automated procedure, which under certain limitations can recognize relations between rules, typically expressed as “meta-rules” or “control heuristics” and hardwired in the KBS’s control strategy. The presented procedure takes as an input the operational version of the knowledge base theory generated by a CTMS-based verification tool, and returns a reordered set of rules which when applied to a specific problem generates possible solutions of that problem in order according to a specified criterion, for example the length of the path leading to the solution. We show an example to illustrate the proposed procedure.
[1]
Neli P. Zlatareva,et al.
A framework for verification, validation, and refinement of knowledge bases: The VVR system
,
1994,
Int. J. Intell. Syst..
[2]
Frank van Harmelen,et al.
Formally Verifying Dynamic Properties of Knowledge Based Systems
,
1999,
EKAW.
[3]
Dieter Fensel,et al.
The essence of problem-solving methods: making assumptions to gain efficiency
,
1998,
Int. J. Hum. Comput. Stud..
[4]
Susan Craw,et al.
Representing Problem-Solving for Knowledge Refinement
,
1999,
AAAI/IAAI.
[5]
Shlomo Zilberstein,et al.
Composing Real-Time Systems
,
1991,
IJCAI.