zbMATH — the first resource for mathematics

Qualitative simulation. (English) Zbl 0624.68098
Qualitative simulation is a key inference process in qualitative causal reasoning. However, the precise meaning of the different proposals and their relation with differential equations is often unclear. In this paper, we present a precise definition of qualitative structure and behavior descriptions as abstractions of differential equations and continuously differentiable functions. We present a new algorithm for qualitative simulation that generalizes the best features of existing algorithms, and allows direct comparisons among alternate approaches. Starting with a set of constraints abstracted from a differential equation, we prove that the QSIM algorithm is guaranteed to produce a qualitative behavior corresponding to any solution to the original equation. We also show that any qualitative simulation algorithm will sometimes produce spurious qualitative behaviors: ones which do not correspond to any mechanism satisfying the given constraints. These observations suggest specific types of care that must be taken in designing applications of qualitative causal reasoning systems, and in constructing and validating a knowledge base of mechanism descriptions.

68U20 Simulation (MSC2010)
68T99 Artificial intelligence
Full Text: DOI
[1] Arnold, V.I., (), translated and edited by R.A. Silverman
[2] Chi, M.T.H.; Feltovich, P.J.; Glaser, R., Categorization and representation of physics problems by experts and novices, Cognitive sci., 5, 121-152, (1982)
[3] de Kleer, J., Multiple representations of knowledge in a mechanics problem-solver, ()
[4] de Kleer, J., Causal and teleological reasoning in circuit recognition, (1978), MIT Artificial Intelligence Laboratory TR-529 Cambridge, MA
[5] de Kleer, J., The origin and resolution of ambiguities in causal arguments, ()
[6] de Kleer, J.; Bobrow, D.G., Qualitative reasoning with higher-order derivatives, ()
[7] de Kleer, J.; Brown, J.S., The origin, form, and logic of qualitative physical laws, ()
[8] de Kleer, J.; Brown, J.S., A qualitative physics based on confluences, Artificial intelligence, 24, 7-83, (1984)
[9] Forbus, K.D., Qualitative reasoning about physical processes, ()
[10] Forbus, K.D., Qualitative process theory, (1982), MIT Artificial Intelligence Laboratory Memo 664 Cambridge, MA
[11] Forbus, K.D., Measurement interpretation in qualitative process theory, ()
[12] Forbus, K.D., Qualitative process theory, Artificial intelligence, 24, 85-168, (1984)
[13] ()
[14] Hayes, P.J., The naive physics manifesto, ()
[15] Kuipers, B.J., Getting the envisionment right, ()
[16] Kuipers, B.J., Commonsense reasoning about causality: deriving behavior from structure, Artificial intelligence, 24, 169-203, (1984)
[17] Kuipers, B.J., The limits of qualitative simulation, ()
[18] Kuipers, B.J.; Kassirer, J.P., How to discover a knowledge representation for causal reasoning by studying an expert Physician, ()
[19] Kuipers, B.J.; Kassirer, J.P., Causal reasoning in medicine: analysis of a protocol, Cognitive sci., 8, 363-385, (1984)
[20] Kuipers, B.J.; Kassirer, J.P., Qualitative simulation in medical physiology: A progress report, (1985), MIT Laboratory for Computer Science TM-280 Cambridge, MA
[21] Mackworth, A.K., Consistency in networks of relations, Artificial intelligence, 8, 99-118, (1977) · Zbl 0341.68061
[22] Mackworth, A.K.; Freuder, E.C., The complexity of some polynomial network consistency algorithms for constraint satisfaction problems, Artificial intelligence, 25, 65-74, (1985)
[23] Waltz, D., Understanding line drawings of scenes with shadows, ()
[24] Williams, B.C., The use of continuity in a qualitative physics, ()
[25] Williams, B.C., Qualitative analysis of MOS circuits, Artificial intelligence, 24, 281-346, (1984)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.