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

  • Authors:
  • Andreas Bauer

  • Affiliations:
  • Institut für Informatik, Technische Universität München, Garching b. München, Germany

  • Venue:
  • CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In face of the unwieldiness of non-monotonic logic engines, or Prolog/CLP meta interpreters as they are commonly used for model based reasoning and diagnosis, this paper proposes a simple, but effective improvement for performing the complex diagnostic task. The chosen approach is twofold: firstly, the problem of contradicting first order system descriptions with a set of observations is reduced to propositional logic using the notion of symptoms, and secondly, the determination of conflict sets and minimal diagnoses is mapped to a problem whose technical solution has experienced a sheer boost over the past years, namely k-satisfiability using state-of-the-art SAT-solvers. Since the involved problems are (mostly) $\mathcal{NP}$-complete, the ideas for additional improvements for a more diagnosis-specific SAT-solver are also sketched and their implementation by means of a non-destructive solver, LSAT, evaluated.