Abstract
The diagnosis of a discrete-event system is the problem of computing possible behaviors of the system given observations of the actual behavior, and testing whether the behaviors are normal or faulty. We show how the diagnosis problems can be translated into the propositional satisfiability problem (SAT) and solved by algorithms for SAT. Our experiments demonstrate that current SAT algorithms can solve much bigger diagnosis problems than traditional diagnosis algorithms can.
Original language | English |
---|---|
Title of host publication | AAAI-07/IAAI-07 Proceedings |
Subtitle of host publication | 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference |
Pages | 305-310 |
Number of pages | 6 |
Publication status | Published - 2007 |
Event | AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference - Vancouver, BC, Canada Duration: 22 Jul 2007 → 26 Jul 2007 |
Publication series
Name | Proceedings of the National Conference on Artificial Intelligence |
---|---|
Volume | 1 |
Conference
Conference | AAAI-07/IAAI-07 Proceedings: 22nd AAAI Conference on Artificial Intelligence and the 19th Innovative Applications of Artificial Intelligence Conference |
---|---|
Country/Territory | Canada |
City | Vancouver, BC |
Period | 22/07/07 → 26/07/07 |