02037nas a2200229 4500008004100000245004200041210004200083300001400125490000600139520143400145653002401579653001501603653002201618653000801640653002001648653001701668653002601685100002101711700001201732700002001744856004301764 2013 eng d00aParaconsistent OWL and Related Logics0 aParaconsistent OWL and Related Logics a395–4270 v43 aThe Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies. However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL. This is so despite the fact that inconsistencies are bound to occur in many realistic cases, e.g., when multiple ontologies are merged or when ontologies are created by machine learning or data mining tools. In this paper, we present four-valued paraconsistent description logics which can reason over inconsistencies. We focus on logics corresponding to OWL DL and its profiles. We present the logic SROIQ4, showing that it is both sound relative to classical SROIQ and that its embedding into SROIQ is consequence preserving. We also examine paraconsistent varieties of EL++, DL-Lite, and Horn-DLs. The general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Truth-value gaps and gluts can also be selectively eliminated from models (by inserting additional axioms into knowledge bases). If gaps but not gluts are eliminated, additional classical conclusions can be drawn without affecting paraconsistency.10aAutomated Deduction10aComplexity10aDescription Logic10aOWL10aParaconsistency10aSemantic Web10aWeb Ontology Language1 aMaier, Frederick1 aMa, Yue1 aHitzler, Pascal uhttp://dx.doi.org/10.3233/SW-2012-006601833nas a2200253 4500008004100000245005100041210004900092260003900141300001200180490000900192520112700201653002301328653000801351653001001359100002001369700001801389700002001407700002101427700002101448700001501469700002201484700002201506856005101528 2012 eng d00aRecent Advances in Integrating {OWL} and Rules0 aRecent Advances in Integrating OWL and Rules aAustria, ViennabSpringerc09/2012 a225-2280 v74973 aAs part of the quest for a unifying logic for the Semantic Web Technology Stack, a central issue is finding suitable ways of integrating description logics based on the Web Ontology Language (OWL) with rule-based approaches based on logic programming. Such integration is difficult since naive approaches typically result in the violation of one or more desirable design principles. For example, while both OWL 2 DL and RIF Core (a dialect of the Rule Interchange Format RIF) are decidable, their naive union is not, unless carefully chosen syntactic restrictions are applied. We report on recent advances and ongoing work by the authors in integrating OWL and rulesWe take an OWL-centric perspective, which means that we take OWL 2 DL as a starting point and pursue the question of how features of rulebased formalisms can be added without jeopardizing decidability. We also report on incorporating the closed world assumption and on reasoning algorithms. This paper essentially serves as an entry point to the original papers, to which we will refer throughout, where detailed expositions of the results can be found.10adescription logics10aOWL10aRules1 aKnorr, Matthias1 aCarral, David1 aHitzler, Pascal1 aKrisnadhi, Adila1 aMaier, Frederick1 aWang, Cong1 aKrötzsch, Markus1 aStraccia, Umberto uhttp://dx.doi.org/10.1007/978-3-642-33203-6_2001450nas a2200241 4500008004100000245006500041210006400106260003500170300001400205490000800219520072100227100002000948700002000968700002100988700001801009700002501027700001901052700002101071700002001092700002001112700002401132856005201156 2012 eng d00aReconciling OWL and Non-monotonic Rules for the Semantic Web0 aReconciling OWL and Nonmonotonic Rules for the Semantic Web aMontpellier, FrancebIOS Press a474–4790 v2423 a
We propose a description logic extending SROIQ (the description logic underlying OWL 2 DL) and at the same time encompassing some of the most prominent monotonic and nonmonotonic rule languages, in particular Datalog extended with the answer set semantics. Our proposal could be considered a substantial contribution towards fulfilling the quest for a unifying logic for the Semantic Web. As a case in point, two non-monotonic extensions of description logics considered to be of distinct expressiveness until now are covered in our proposal. In contrast to earlier such proposals, our language has the “look and feel” of a description logic and avoids hybrid or first-order syntaxes.
1 aKnorr, Matthias1 aHitzler, Pascal1 aMaier, Frederick1 aDe Raedt, Luc1 aBessière, Christian1 aDubois, Didier1 aDoherty, Patrick1 aFrasconi, Paolo1 aHeintz, Fredrik1 aLucas, Peter, J. F. uhttp://dx.doi.org/10.3233/978-1-61499-098-7-47401446nas a2200313 4500008004100000020002200041245008300063210006900146260001700215300001200232520051700244653001200761653002200773653003100795653001000826653001700836653002600853100002200879700002100901700002100922700002000943700002600963700002400989700001601013700002101029700001901050700001601069856004701085 2011 eng d a978-1-4503-0632-400aA Better Uncle for {OWL}: Nominal Schemas for Integrating Rules and Ontologies0 aBetter Uncle for OWL Nominal Schemas for Integrating Rules and O bACMc03/2011 a645-6543 aWe propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV3(\cap, x) that is versatile enough to capture the lightweight languages OWL EL and OWL RL.10adatalog10aDescription Logic10aSemantic Web Rule Language10aSROIQ10atractability10aWeb Ontology Language1 aKrötzsch, Markus1 aMaier, Frederick1 aKrisnadhi, Adila1 aHitzler, Pascal1 aSrinivasan, Sadagopan1 aRamamritham, Krithi1 aKumar, Arun1 aRavindra, M., P.1 aBertino, Elisa1 aKumar, Ravi uhttp://doi.acm.org/10.1145/1963405.196349601014nas a2200193 4500008004100000245006500041210006500106260002500171490000800196520041700204100002200621700002100643700002100664700002000685700002100705700002300726700002700749856004400776 2011 eng d00aNominal Schemas for Integrating Rules and Description Logics0 aNominal Schemas for Integrating Rules and Description Logics bCEUR-WS.orgc07/20110 v7453 aWe propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal schemas.1 aKrötzsch, Markus1 aMaier, Frederick1 aKrisnadhi, Adila1 aHitzler, Pascal1 aRosati, Riccardo1 aRudolph, Sebastian1 aZakharyaschev, Michael uhttp://ceur-ws.org/Vol-745/paper_39.pdf01164nas a2200253 4500008004100000020002200041245002000063210001800083260002200101300001200123490000900135520050100144100002100645700002100666700002000687700001900707700002100726700002000747700002500767700001800792700002100810700003100831856004800862 2011 eng d a978-3-642-23031-800a{OWL} and Rules0 aOWL and Rules bSpringerc08/2011 a382-4150 v68483 aThe relationship between the Web Ontology Language OWL and rule-based formalisms has been the subject of many discussions and research investigations, some of them controversial. From the many attempts to reconcile the two paradigms, we present some of the newest developments. More precisely, we show which kind of rules can be modeled in the current version of OWL, and we show how OWL can be extended to incorporate rules. We finally give references to a large body of work on rules and OWL. 1 aKrisnadhi, Adila1 aMaier, Frederick1 aHitzler, Pascal1 aPolleres, Axel1 ad'Amato, Claudia1 aArenas, Marcelo1 aHandschuh, Siegfried1 aKroner, Paula1 aOssowski, Sascha1 aPatel-Schneider, Peter, F. uhttp://dx.doi.org/10.1007/978-3-642-23032-501230nas a2200133 4500008004100000245005200041210005000093260004500143520075900188100002100947700002300968700002000991856008501011 2010 eng d00aDistributed Reasoning with EL++ Using MapReduce0 aDistributed Reasoning with EL Using MapReduce aDayton, OH, USAbWright State University3 aIt has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time [23]. Later work has carried this approach over to OWL Horst [22]. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the description logic EL++, which is essentially the OWL 2 profile OWL 2 EL. The traditional EL++ classification algorithm is recast into a form compatible with MapReduce, and it is shown how the revised algorithm can be realized within the MapReduce framework. An analysis of the circumstances under which the algorithm can be effectively used is also provided.
1 aMaier, Frederick1 aMutharaju, Raghava1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/distributed-reasoning-el-using-mapreduce01195nas a2200193 4500008004100000245003400041210003100075260004300106300001200149490000800161520066300169100002300832700002100855700002000876700002100896700001700917700002300934856004400957 2010 eng d00aA MapReduce Algorithm for EL+0 aMapReduce Algorithm for EL aWaterloo, Ontario, CanadabCEUR-WS.org a464-4740 v5733 aRecently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more precisely for the classification of EL+ ontologies. To do this, we first modify the algorithm usually used for EL+ classification. The modified algorithm can then be converted into a MapReduce algorithm along the same key ideas as used for RDF schema.
1 aMutharaju, Raghava1 aMaier, Frederick1 aHitzler, Pascal1 aHaarslev, Volker1 aToman, David1 aWeddell, Grant, E. uhttp://ceur-ws.org/Vol-573/paper_35.pdf