On compiling system models for faster and more scalable diagnosis

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2005, Pages 300-306

  Huang, Jinbo ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPILED SYSTEM MODEL; DIAGNOSTIC ALGORITHMS; MODEL-BASED DIAGNOSIS;

ALGORITHMS; BOOLEAN ALGEBRA; MATHEMATICAL MODELS; PROGRAM DIAGNOSTICS;

PROGRAM COMPILERS;

EID: 29344446881     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Aloul, F.; Markov, I.; and Sakallah, K. 2001. Faster SAT and smaller BDDs via common function structure. In International Conference on Computer Aided Design (ICCAD), 443-448.
2. Bryant, R. E. 1986. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35:677-691.
3. Darwiche, A., and Marquis, P. 2002. A knowledge compilation map. Journal of Artificial Intelligence Research 17:229-264.
4. Darwiche, A. 1998. Model-based diagnosis using structured system descriptions. Journal of Artificial Intelligence Research 8:165-222.
5. Darwiche, A. 2001. Decomposable negation normal form. Journal of the ACM 48(4):608-647.
6. Darwiche, A. 2004. New advances in compiling CNF into decomposable negation normal form. In Proceedings of the 16th European Conference on Artificial Intelligence (ECAI), 328-332.
7. de Kleer, J. 1990. Compiling devices and processes. Presented at the Fourth International Workshop on Qualitative Physics, Lugano, Switzerland.
8. Dechter, R., and Mateescu, R. 2004a. The impact of AND/OR search spaces on constraint satisfaction and counting. In Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP), 731-736.
9. Dechter, R., and Mateescu, R. 2004b. Mixtures of deterministic- probabilistic networks and their AND/OR search spaces. In Proceedings of the 20th Conference on Uncertainty in Artificial Intelligence (UAI), 120-129.
10. Forbus, K. D., and de Kleer, J. 1993. Building Problem Solvers. MIT Press.
11. Huang, J., and Darwiche, A. 2004. Using DPLL for efficient OBDD construction. In Proceedings of the Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT), 127-136.
12. McMillan, K. L. 2002. Applying SAT methods in unbounded symbolic model checking. In Proceedings of the 14th International Conference on Computer Aided Verification (CAV), 250-264.
13. Somenzi, F. Release 2.4.0. CUDD: CU Decision Diagram Package. http://vlsi.colorado.edu/~fabio/CUDD/cuddIntro.html.
14. Sztipanovits, J., and Misra, A. 1996. Diagnosis of discrete-event systems using ordered binary decision diagrams. In Seventh International Workshop on Principles of Diagnosis (DX).
15. Torasso, P., and Torta, G. 2003. Computing minimum-cardinality diagnoses using OBDDs. In Proceedings of the 26th Annual German Conference on Artificial Intelligence (KI), 224-238.
16. Torta, G., and Torasso, P. 2004. The role of OBDDs in controlling the complexity of model-based diagnosis. In 15th International Workshop on Principles of Diagnosis (DX).