Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation
暂无分享,去创建一个
[1] Mark S. Boddy,et al. An Analysis of Time-Dependent Planning , 1988, AAAI.
[2] Shlomo Zilberstein,et al. Composing Real-Time Systems , 1991, IJCAI.
[3] David A. McAllester. Truth Maintenance , 1990, AAAI.
[4] Mark S. Boddy,et al. Solving Time-Dependent Planning Problems , 1989, IJCAI.
[5] C. Cordell Green,et al. Application of Theorem Proving to Problem Solving , 1969, IJCAI.
[6] Marco Schaerf,et al. Tractable Reasoning via Approximation , 1995, Artif. Intell..
[7] Dean Allemang,et al. The Computational Complexity of Abduction , 1991, Artif. Intell..
[8] Stanley J. Rosenschein,et al. Plan Synthesis: A Logical Perspective , 1981, IJCAI.
[9] Frank van Harmelen,et al. Computing Approximate Diagnoses By Using Approximate Entailment , 1996, KR.
[10] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.
[11] Raymond Reiter,et al. A Theory of Diagnosis from First Principles , 1986, Artif. Intell..
[12] Randall Davis,et al. Model-based reasoning: troubleshooting , 1988 .
[13] A.C.M. ten Teije,et al. Approximations in diagnosis: motivations and techniques , 1995 .
[14] Shlomo Zilberstein,et al. Optimal Composition of Real-Time Systems , 1996, Artif. Intell..
[15] Frank van Harmelen,et al. Exploiting Domain Knowledge for Approximate Diagnosis , 1997, IJCAI.
[16] Li Yang,et al. Preliminary Empirical Results on Anytime Propositional Reasoning (Abstract) , 1997 .
[17] Mukesh Dalal,et al. Semantics of an Anytime Family of Reasoners , 1996, ECAI.