# SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies

Franz Baader, Stefan Borgwardt, Barbara Morawska
SAT Encoding of Unification in ELH_R^+ w.r.t. Cycle-Restricted Ontologies
Technical Report, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universität Dresden, volume 12-02, 2012. LTCS-Report
• KurzfassungAbstract
Unification in Description Logics has been proposed as an inference service that can, for example, be used to detect redundancies in ontologies. For the Description Logic EL, which is used to define several large biomedical ontologies, unification is NP-complete. An NP unification algorithm for EL based on a translation into propositional satisfiability (SAT) has recently been presented. In this report, we extend this SAT encoding in two directions: on the one hand, we add general concept inclusion axioms, and on the other hand, we add role hierarchies (H) and transitive roles (R+). For the translation to be complete, however, the ontology needs to satisfy a certain cycle restriction. The SAT translation depends on a new rewriting-based characterization of subsumption w.r.t. ELHR+-ontologies.
• Bemerkung: Note: See http://lat.inf.tu-dresden.de/research/reports.html.
• Forschungsgruppe:Research Group: Automatentheorie
@techreport{ BaBM-LTCS-12-02,
title = {{SAT} Encoding of Unification in {$\mathcal{ELH}_{R^+}$} w.r.t. Cycle-Restricted Ontologies},