Advertisement

Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis

  • Roberto Sebastiani
  • Michele Vescovi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5663)

Abstract

The recent quest for tractable logic-based languages arising from the field of bio-medical ontologies has raised a lot of attention on lightweight (i.e. less expressive but tractable) description logics, like \(\mathcal{EL}\) and its family. To this extent, automated reasoning techniques in these logics have been developed for computing not only concept subsumptions, but also to pinpoint the set of axioms causing each subsumption. In this paper we build on previous work from the literature and we propose and investigate a simple and novel approach for axiom pinpointing for the logic \(\mathcal{EL^{+}}\). The idea is to encode the classification of an ontology into a Horn propositional formula, and to exploit the power of Boolean Constraint Propagation and Conflict Analysis from modern SAT solvers to compute concept subsumptions and to perform axiom pinpointing. A preliminary empirical evaluation confirms the potential of the approach.

Keywords

Truth Assignment Horn Clause Rule Application Unit Clause Primitive Concept 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope. In: Proc. of IJCAI 2005, pp. 364–369. Morgan-Kaufmann Publishers, San Francisco (2005)Google Scholar
  2. 2.
    Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope Further. In: Proc. of OWLED 2008, DC Workshop (2008)Google Scholar
  3. 3.
    Baader, F., Lutz, C., Suntisrivaraporn, B.: Efficient Reasoning in \(\mathcal{EL}^+\). In: Proc. of DL 2006. CEUR-WS, vol. 189 (2006)Google Scholar
  4. 4.
    Baader, F., Penaloza, R.: Axiom pinpointing in general tableaux. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 11–27. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  5. 5.
    Baader, F., Peñaloza, R., Suntisrivaraporn, B.: Pinpointing in the Description Logic \(\mathcal{EL}^+\). In: Hertzberg, J., Beetz, M., Englert, R. (eds.) KI 2007. LNCS, vol. 4667, pp. 52–67. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  6. 6.
    Baader, F., Suntisrivaraporn, B.: Debugging SNOMED CT Using Axiom Pinpointing in the Description Logic \(\mathcal{EL}^+\). In: Proc. of KR-MED 2008: Representing and Sharing Knowledge Using SNOMED. CEUR-WS, vol. 410 (2008)Google Scholar
  7. 7.
    T. G. O. Consortium. Gene ontology: Tool for the unification of biology. Nature Genetics 25, 25–29 (2000)Google Scholar
  8. 8.
    Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. 9.
    Lahiri, S.K., Nieuwenhuis, R., Oliveras, A.: SMT techniques for fast predicate abstraction. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 424–437. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  10. 10.
    Lynce, I., Silva, J.P.M.: On Computing Minimum Unsatisfiable Cores. In: Proc. of SAT 2004 (2004), http://www.satisfiability.org/SAT04/programme/110.pdf
  11. 11.
    Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC 2001, pp. 530–535. ACM, New York (2001)Google Scholar
  12. 12.
    Rector, A., Horrocks, I.: Experience Building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions. In: Proc. of the Workshop on Ontological Engineering, AAAI 1997. AAAI Press, Menlo Park (1997)Google Scholar
  13. 13.
    Sebastiani, R.: Lazy Satisfiability Modulo Theories. Journal on Satisfiability, Boolean Modeling and Computation, JSAT 3, 141–224 (2007)MathSciNetzbMATHGoogle Scholar
  14. 14.
    Sebastiani, R., Vescovi, M.: Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis. Technical Report DISI-09-014, University of Trento (2009), http://disi.unitn.it/~rseba/elsat/
  15. 15.
    Sioutos, N., de Coronado, S., Haber, M.W., Hartel, F.W., Shaiu, W., Wright, L.W.: NCI Thesaurus: A semantic model integrating cancer-related clinical and molecular information. Journal of Biomedical Informatics 40(1), 30–43 (2007)CrossRefGoogle Scholar
  16. 16.
    Spackman, K.A.: Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED RT. Journal of American Medical Informatics Association (Fall Symposium Special Issue) (2000)Google Scholar
  17. 17.
    Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient Conflict Driven Learning in Boolean Satisfiability Solver. In: Proc. of ICCAD, pp. 279–285 (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Roberto Sebastiani
    • 1
  • Michele Vescovi
    • 1
  1. 1.DISIUniversità di TrentoItaly

Personalised recommendations