Abstract
The task of model-based diagnosis is to find a suitable assignment to the behavior modes of components (and/or transition variables) in a system given some observations made on it. A complete diagnosis-candidate is an assignment of behavior modes to all the components in the system and a partial diagnosis-candidate is an assignment of behavior modes to only a subset of them. Corresponding to different characterizations of complete diagnosis-candidates (Bayesian model selection, consistency-based, model counting etc.), partial diagnosis-candidates play different roles. In the Bayesian model selection framework for example, they signify marginal probabilities, while in the consistency-based framework they are used to “represent” complete diagnosis-candidates. In this paper, we provide an information-theoretic characterization of diagnosis-candidates in a more general form — viz. “disjunction of partial assignments”. This approach is motivated by attempting to bridge the gap between previous formalizations and to address the problems associated with them. We argue that the task of diagnosis actually consists of two separate problems, the second of which occurs more generally in hypothesis selection — (1) to characterize the space of complete or partial assignments (like in a posterior probability distribution), and (2) to abstract and approximate the information content of such a space into a representational form that can support tractable answering of diagnosis-queries and decision-making.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bayard, R. J. and Pehoushek, J. D. 2000. Counting Models using Connected Components. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000).
Console, L. and Torasso, P. 1991. A Spectrum of Logical Definitions of Model-Based Diagnosis. Computational Intelligence 7(3): 133–141.
Darwiche, A. 2001. On the Tractable Counting of Theory Models and its Applications to Belief Revision and Truth Maintenance. To appear in Journal of Applied Non-Classical Logics.
Dechter, R. 1992. Constraint Networks. Encyclopedia of Artificial Intelligence, second edition, Wiley and Sons, pp 276–285, 1992.
de Kleer, J. 1986. An Assumption Based TMS. Artificial Intelligence 28 (1986).
de Kleer, J. and Williams, B. C. 1987. Diagnosis with Behavioral Modes. Artificial Intelligence 32 (1987) 97–130.
de Kleer, J. Mackworth, A. K. and Reiter, R. 1992. Characterizing Diagnoses and Systems. Artificial Intelligence 56 (1992) 197–222.
Forbus, K. D. and de Kleer, J. 1992. Building Problem Solvers (MIT Press, Cambridge, MA, 1992).
Hamscher, W. Console, L. and de Kleer J. 1992. Readings in Model-Based Diagnosis. Morgan Kaufmann, 1992.
Karp, R. Luby, M. and Madras N. 1989. Monte-Carlo Approximation Algorithms for Enumeration Problems. Journal of Algorithms 10 429–448. 1989.
Kohlas, J., Anrig, B., Haenni, R., and Monney, P. A. Model-Based Diagnosis and Probabilistic Assumption-Based Reasoning. Artificial Intelligence, 104 (1998) 71–106.
Kumar, T. K. S. 2001. QCBFS: Leveraging Qualitative Knowledge in Simulation-Based Diagnosis. Proceedings of the Fifteenth International Workshop on Qualitative Reasoning.
Kumar, T. K. S. 2002a. A Model Counting Characterization of Diagnoses. Proceedings of the Thirteenth International Workshop on Principles of Diagnosis (DX 2002).
Kumar, T. K. S. 2002b. HCBFS: Combining Structure-Based and TMS-Based Approaches in Model-Based Diagnosis. Proceedings of the Thirteenth International Workshop on Principles of Diagnosis (DX 2002).
Kumar, T. K. S. and Dearden, R. 2002. The Oracular Constraints Method. Proceedings of the Fifth International Symposium on Abstraction, Reformulation and Approximation (SARA 2002).
Kurien, J. and Nayak, P. P. 2000. Back to the Future for Consistency-Based Trajectory Tracking. Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000).
Lucas, P. J. F. 1998. Analysis of Notions of Diagnosis. Artificial Intelligence, 105(1–2) (1998) 293–341.
Lucas, P. J. F. 2001. Bayesian Model-Based Diagnosis. International Journal of Approximate Reasoning, 27 (2001) 99–119.
MacKay, D. J. C. 1991. Bayesian Interpolation. Neural Computation 4(3): 415–447, 1991.
McIlraith, S. 1998. Explanatory Diagnosis: Conjecturing Actions to Explain Observations. Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR’98).
Mosterman, P. J. and Biswas, G. 1999. Diagnosis of Continuous Valued Systems in Transient Operating Regions. IEEE Transactions on Systems, Man, and Cybernetics, 1999. Vol. 29, no. 6, pp. 554–565, 1999.
Nayak, P. P. and Williams, B. C. 1997. Fast Context Switching in Real-time Propositional Reasoning. In Proceedings of AAAI-97.
Peng, Y. and Reggia, J. A. 1990. Abductive Inference Models for Diagnostic Problem Solving. New York: Springer-Verlag
Poole, D. 1994. Representing Diagnosis Knowledge. Annals of Mathematics and Artificial Intelligence 11 (1994) 33–50.
Raiman, O. 1989. Diagnosis as a Trial: The Alibi Principle, IBM scientific center (1989).
Reiter, R. 1987. A Theory of Diagnosis from First Principles. Artificial Intelligence 32 (1987) 57–95.
Shanahan, M. 1993. Explanation in the Situation Calculus. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (IJCAI-93), 160–165.
Struss, P. 1998. Extensions to ATMS-based Diagnosis, in: J. S. Gero (ed.), Artificial Intelligence in Engineering: Diagnosis and Learning, Southampton, 1988.
Struss, P. and Dressler, O. 1989. “Physical Negation”-Integrating Fault Models into the General Diagnosis Engine, in: Proceedings IJCAI-89 Detroit, MI (1989) 1318–1323.
Williams B. C. and Nayak, P. P. 1996. A Model-Based Approach to Reactive Self-Configuring Systems. In Proceedings of AAAI-96, 971–978.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kumar, T.K.S. (2002). An Information-Theoretic Characterization of Abstraction in Diagnosis and Hypothesis Selection. In: Koenig, S., Holte, R.C. (eds) Abstraction, Reformulation, and Approximation. SARA 2002. Lecture Notes in Computer Science(), vol 2371. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45622-8_10
Download citation
DOI: https://doi.org/10.1007/3-540-45622-8_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43941-7
Online ISBN: 978-3-540-45622-3
eBook Packages: Springer Book Archive