2014
DOI: 10.1613/jair.4503
|View full text |Cite
|
Sign up to set email alerts
|

A Novel SAT-Based Approach to Model Based Diagnosis

Abstract: This paper introduces a novel encoding of Model Based Diagnosis (MBD) to Boolean Satisfaction (SAT) focusing on minimal cardinality diagnosis. The encoding is based on a combination of sophisticated MBD preprocessing algorithms and the application of a SAT compiler which optimizes the encoding to provide more succinct CNF representations than obtained with previous works. Experimental evidence indicates that our approach is superior to all published algorithms for minimal cardinality MBD. In particular, we can… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
58
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(58 citation statements)
references
References 33 publications
0
58
0
Order By: Relevance
“…These methods guarantee sound diagnoses (i.e., they return only valid diagnoses), and some of them are even complete (i.e., all diagnoses are returned). However, they tend to fail for large systems due to infeasible runtime or space requirements [5].…”
Section: Sdmentioning
confidence: 99%
See 2 more Smart Citations
“…These methods guarantee sound diagnoses (i.e., they return only valid diagnoses), and some of them are even complete (i.e., all diagnoses are returned). However, they tend to fail for large systems due to infeasible runtime or space requirements [5].…”
Section: Sdmentioning
confidence: 99%
“…The limitation of this approach is that there is no guarantee that the size of the compiled representation will not be exponential in the number of system components. Another approach is SATbD, a compilation-based MBD algorithm that compiles MBD into Boolean satisfiability problem (SAT) [5,67], and then uses state-of-the-art SAT solvers to find the possible diagnoses. We follow a similar line of work here, but instead of a classical SAT solver we use a conflict-directed algorithm, which allows us to find conflicts in polynomial time in our domain by using a Logic-based Truth Maintaining System [68].…”
Section: Sdmentioning
confidence: 99%
See 1 more Smart Citation
“…Given the vector C as COMPS and the system description SD it is possible to employ any diagnosis algorithm such as CDA* (Williams and Ragno 2007), GDE (Reiter 1987), or SATbD (Metodi et al 2014) to find minimum cardinality diagnoses. Here we have used Reiter's diagnosis lattice.…”
Section: Definition 4 (Satisfiability Modulo Linear Arithmetic)mentioning
confidence: 99%
“…This is computationally more difficult than finding a single diagnosis, but also more realistic from the perspective of applications. Again, state-of-the-art performance in the weak fault model is achieved using a SAT-solver [33]. The hardware's natural ability to rapidly generate low-energy samples lends itself to applications in which a diverse set of optimal solutions are required.…”
Section: Generating Diverse Solutionsmentioning
confidence: 99%