Simplifying diagnosis using LSAT: A propositional approach to reasoning from first principles

Lecture Notes in Computer Science

Volumn 3524, Issue , 2005, Pages 49-63

  Bauer, Andreas ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Formal specification; Model based diagnosis; Model based reasoning; SAT solving; System monitoring

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; METADATA; PROBLEM SOLVING;

FORMAL SPECIFICATION; MODEL BASED DIAGNOSIS; MODEL BASED REASONING; SAT-SOLVING; SYSTEM MONITORING;

LINEAR PROGRAMMING;

EID: 26444438151     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11493853_6     Document Type: Conference Paper

References (24)

1. M. Ali, A. Veneris, S. Safarpour, M. Abadir, R. Drechsler, and A. Smith. Debugging Sequential Circuits Using Boolean Satisfiability. In 5th International Workshop on Microprocessor Test and Verification (MTV'04), Austin, 2004.
2. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Semantically Guided Theorem Proving for Diagnosis Applications, pages 460-465.
3. P. Baumgartner, P. Fröhlich, U. Furbach, and W. Nejdl. Tableaux for Diagnosis Applications. Technical Report 23-96, Universität Koblenz-Landau, Institut für Informatik, Rheinau 1, D-56075 Koblenz, 1996.
4. R. Ben-Eliyahu-Zohary. Yet some more complexity results for default logic. Artificial Intelligence, 139(1):1-20, 2002.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theoremproving. Communications of the ACM, 5(7):394-397, 1962.
6. J. de Kleer and B. C. Williams. Diagnosing multiple faults. Artificial Intelligence, 32(1):97-130, 1987.
7. T. Eiter and T. Lukasiewicz. Complexity results for explanations in the structural-model approach. Artif. Intell., 154(1-2):145-198, 2004.
8. R. Greiner, B. A. Smith, and R. W. Wilkerson. A correction to the algorithm in Reiter's theory of diagnosis. Artificial Intelligence, 41:79-88, 1989.
9. J. Håkansson, B. Jonsson, and O. Lundqvist. Generating online test oracles from temporal logic specifications. STTT, 4(4):456-471, 2003.
10. K. Havelund and G. Rosu. Monitoring Java Programs with Java PathExplorer. Electronic Notes Theoretical Computer Science, 55(2), 2001.
11. K. Havelund and G. Rosu. Synthesizing Monitors for Safety Properties. In Tools and Algorithms for Construction and Analysis of Systems, pages 342-356, 2002.
12. Y. C. Kim, K. K. Saluja, and V. D. Agrawal. Multiple faults: Modeling, simulation and test. In Proceedings of the 2002 conference on Asia South Pacific design automation/VLSI Design, page 592. IEEE Computer Society, 2002.
13. C. M. Li and Anbulagan. Look-ahead versus look-back for satisfiability problems. In CP, pages 341-355, 1997.
14. L. Li and Y. F. Jiang. Computing minimal hitting sets with genetic algorithms. Algorithmica, 32(1):95-106, 2002.
15. I. Lynce and J. P. Marques-Silva. Efficient data structures for backtrack search SAT solvers. In Proceedings of the 5th International Symposium on the Theory and Applications of Satisfiability Testing (SAT), May 2002.
16. J. McCarthy. Circumscription - a form of non-monotonic reasoning. Artificial Intelligence, 13:27-39, 1980.
17. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), 2001.
18. A. Nonnengart and C. Weidenbach. Computing small clause normal forms. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning, volume I, chapter 6, pages 335-367. Elsevier Science B.V., 2001.
19. R. Reiter. A theory of diagnosis from first principles. Artificial Intelligence, 32(1):57-95, 1987.
20. P. Torasso, L. Console, L. Portinale, and D. T. Dupré. On the role of abduction. ACM Comput. Surv., 27(3):353-355, 1995.
21. Y. L. Traon, F. Ouabdesselam, C. Robach, and B. Baudry. From diagnosis to diagnosability: axiomatization, measurement and application. J. Syst. Softw., 65(1):31-50, 2003.
22. F. Vatan. The complexity of the diagnosis problem. Technical Support Package (TSP) NPO-30315, NASA Jet Propulsion Laboratory, Apr. 2002.
23. A. Veneris. Fault Diagnosis and Logic Debugging Using Boolean Satisfiability. In Fourth International Workshop on Microprocessor Test and Verification Common Challenges and Solutions, Austin, Texas, May 2003.
24. H. Zhang. SATO: an efficient prepositional prover. In Proceedings of the International Conference on Automated Deduction (CADE'97), volume 1249 of LNAI, pages 272-275, 1997.