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.
The first author is partly supported by SRC under GRC Custom Research Project 2009-TJ-1880 WOLFLING, and by MIUR under PRIN project 20079E5KM8_002.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
Baader, F., Brandt, S., Lutz, C.: Pushing the \(\mathcal{EL}\) Envelope Further. In: Proc. of OWLED 2008, DC Workshop (2008)
Baader, F., Lutz, C., Suntisrivaraporn, B.: Efficient Reasoning in \(\mathcal{EL}^+\). In: Proc. of DL 2006. CEUR-WS, vol. 189 (2006)
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)
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)
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)
T. G. O. Consortium. Gene ontology: Tool for the unification of biology. Nature Genetics 25, 25–29 (2000)
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)
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)
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
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)
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)
Sebastiani, R.: Lazy Satisfiability Modulo Theories. Journal on Satisfiability, Boolean Modeling and Computation, JSAT 3, 141–224 (2007)
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/
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)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sebastiani, R., Vescovi, M. (2009). Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis. In: Schmidt, R.A. (eds) Automated Deduction – CADE-22. CADE 2009. Lecture Notes in Computer Science(), vol 5663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02959-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-02959-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02958-5
Online ISBN: 978-3-642-02959-2
eBook Packages: Computer ScienceComputer Science (R0)