Filters








3,229 Hits in 9.3 sec

Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas [chapter]

David Carral, Cong Wang, Pascal Hitzler
2013 Lecture Notes in Computer Science  
In this paper, we present an algorithm to reason with the description logic fragment ELROVn, a fragment that extends EL ++ with nominal schemas.  ...  Extending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms.  ...  This work was supported by the National Science Foundation under award 1017225 III: Small: TROn -Tractable Reasoning with Ontologies.  ... 
doi:10.1007/978-3-642-39666-3_6 fatcat:wpl6gjquvrdz5epifno4ynggue

OWL and Rules [chapter]

Adila Krisnadhi, Frederick Maier, Pascal Hitzler
2011 Lecture Notes in Computer Science  
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.  ...  closed world features which retains decidability if added to the description logics with nominal schemas discussed herein [48] .  ... 
doi:10.1007/978-3-642-23032-5_7 fatcat:2dl7wxljnbbx3lkd75rc6gwsxq

Pellet: A Practical OWL-DL Reasoner

Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, Yarden Katz
2007 Social Science Research Network  
in Description Logics or theorem proving.  ...  Pellet is the first sound and complete OWL-DL reasoner with extensive support for reasoning with individuals (including nominal support and conjunctive query), user-defined datatypes, and debugging support  ...  The authors would like to especially thank Edna Ruckhaus who implemented the AL-Log coupling as well as Ron Alford and Michael Grove for their contributions to the code.  ... 
doi:10.2139/ssrn.3199351 fatcat:xmjjuwarpnh6pmntazbg3c5lza

Pellet: A practical OWL-DL reasoner

Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, Yarden Katz
2007 Journal of Web Semantics  
in Description Logics or theorem proving.  ...  Pellet is the first sound and complete OWL-DL reasoner with extensive support for reasoning with individuals (including nominal support and conjunctive query), user-defined datatypes, and debugging support  ...  The authors would like to especially thank Edna Ruckhaus who implemented the AL-Log coupling as well as Ron Alford and Michael Grove for their contributions to the code.  ... 
doi:10.1016/j.websem.2007.03.004 fatcat:vdbsiwxsqjhz5ma3pwb3lckt5i

Establishing the Semantic Web Reasoning Infrastructure on Description Logic Inference Engines [chapter]

Dimitrios A. Koutsomitropoulos, Dimitrios P. Meidanis, Anastasia N. Kandili, Theodore S. Papatheodorou
2008 Lecture Notes in Business Information Processing  
Description Logics and DL-based inference engines in particular play a significant role towards this goal, as they seem to have overlapping expressivity with the Semantic Web de facto language, OWL.  ...  The recent advent of the Semantic Web has given rise to the need for efficient and sound methods that would provide reasoning support over the knowledge scattered on the Internet.  ...  Reasoning with XML Schema datatypes is also offered, therefore SROIQ(D) is the underlying logic supported.  ... 
doi:10.1007/978-3-540-77581-2_24 fatcat:zwrs5oe2wvbjvaztt2azjsvpiu

A better uncle for OWL

Markus Krötzsch, Frederick Maier, Adila Krisnadhi, Pascal Hitzler
2011 Proceedings of the 20th international conference on World wide web - WWW '11  
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms.  ...  We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROE LV3(⊓, ×) that is versatile enough to capture the lightweight  ...  Acknowledgements This work was partially supported by the National Science Foundation under award 1017225 "III: Small: TROn-Tractable Reasoning with Ontologies" and by EPSRC in project "HermiT: Reasoning  ... 
doi:10.1145/1963405.1963496 dblp:conf/www/KrotzschMKH11 fatcat:yf4hqa64bzgydhiyeput7oi2si

A survey of large-scale reasoning on the Web of data

Grigoris Antoniou, Sotiris Batsakis, Raghava Mutharaju, Jeff Z. Pan, Guilin Qi, Ilias Tachmazidis, Jacopo Urbani, Zhangquan Zhou
2018 Knowledge engineering review (Print)  
However, reasoning approaches need to be scalable in order to enable reasoning over the entire Web of Data.  ...  In this large and uncoordinated environment, reasoning can be used to check the consistency of the data and of associated ontologies, or to infer logical consequences which, in turn, can be used to obtain  ...  with Ontologies."  ... 
doi:10.1017/s0269888918000255 fatcat:bergc5uphbceznigppektgvzrm

Towards Log-Linear Logics with Concrete Domains [article]

Melisachew Wudage Chekol and Jakob Huber and Heiner Stuckenschmidt
2015 arXiv   pre-print
We present MEL^++ (M denotes Markov logic networks) an extension of the log-linear description logics EL^++-LL with concrete domains, nominals, and instances.  ...  In particular, we develop a novel way to deal with concrete domains (also known as datatypes) by extending MLN's cutting plane inference (CPI) algorithm.  ...  By using nominals, instance knowledge can be added to an ABox. ABox Since the description logic EL ++ is equipped with nominals. ABox knowledge can be converted into TBox axioms.  ... 
arXiv:1507.02456v2 fatcat:v3oeipdsdndsxchd5jkjhjiqum

Reducing OWL Entailment to Description Logic Satisfiability

Ian Horrocks, Peter Patel-Schneider
2004 Social Science Research Network  
We show how to reduce ontology entailment for the OWL DL and OWL Lite ontology languages to knowledge base satisfiability in (respectively) the SHOIN(D) and SHIF(D) description logics.  ...  This is done by first establishing a correspondence between OWL ontologies and description logic knowledge bases and then by showing how knowledge base entailment can be reduced to knowledge base satisfiability  ...  Moreover, in spite of the high worst case complexity of reasoning in such description logics, highly optimised implementations of these algorithms are available and have been shown to work well with realistic  ... 
doi:10.2139/ssrn.3199027 fatcat:wqmjogx4jrhpbks3ga5ht3cxre

Chapter 3 Description Logics [chapter]

Franz Baader, Ian Horrocks, Ulrike Sattler
2008 Foundations of Artificial Intelligence  
After reviewing some of the most prominent applications of description logics, in particular ontology language applications, we will conclude with an overview of other aspects of description logic research  ...  Modern description logic systems provide their users with reasoning services that can automatically deduce implicit knowledge from the explicitly represented knowledge, and  ...  Description Logics Strictly speaking, we obtain a finite automaton with word transitions, i.e., transitions that may be labelled with a word over Σ rather than a letter of Σ.  ... 
doi:10.1016/s1574-6526(07)03003-9 fatcat:wa2lwv7ywrhvpnk3emfqv2pgyu

A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes [chapter]

Boris Motik, Ulrike Sattler
2006 Lecture Notes in Computer Science  
Many modern applications of description logics (DLs) require answering queries over large data quantities, structured according to relatively simple ontologies.  ...  To test our conjecture, we implemented our algorithm in a new DL reasoner KAON2, which we describe in this paper.  ...  For our future work, the main challenge is to extend the reduction algorithm to handle nominals.  ... 
doi:10.1007/11916277_16 fatcat:qs7odntjyzeephcg7la5gnigbi

High-Level Why-Not Explanations using Ontologies

Balder ten Cate, Cristina Civili, Evgeny Sherkhonov, Wang-Chiew Tan
2015 Proceedings of the 34th ACM Symposium on Principles of Database Systems - PODS '15  
Our why-not explanations leverage concepts from an ontology to provide high-level and meaningful reasons for why a tuple is missing from the result of a query.  ...  In addition, we propose a method for deriving a suitable (virtual) ontology from a database and/or a schema, and we present an algorithm for computing a most-general explanation to a why-not question,  ...  In this sense, LS can be considered to be a fragment of DL-Litecore,⊓ with nominals (also known as DL-Lite horn [4] ), i.e., the description logic obtained by enriching DL-Litecore (the simplest language  ... 
doi:10.1145/2745754.2745765 dblp:conf/pods/CateCST15 fatcat:xccxiemfh5h55djhboc32p3rf4

High-Level Why-Not Explanations using Ontologies [article]

Balder ten Cate and Cristina Civili and Evgeny Sherkhonov and Wang-Chiew Tan
2015 arXiv   pre-print
Our why-not explanations leverage concepts from an ontology to provide high-level and meaningful reasons for why a tuple is missing from the result of a query.  ...  In addition, we propose a method for deriving a suitable (virtual) ontology from a database and/or a data workspace schema, and we present an algorithm for computing a most-general explanation to a why-not  ...  In this sense, LS can be considered to be a fragment of DL-Litecore,⊓ with nominals (also known as DL-Lite horn [4] ), i.e., the description logic obtained by enriching DL-Litecore (the simplest language  ... 
arXiv:1412.2332v2 fatcat:h7vj452t5vfcjbeqjuaqirbhoi

Towards ABox Modularization of semi-expressive Description Logics

Sebastian Wandelt, Ralf Möller
2012 Applied Ontology  
The purpose of our work is to investigate how to release the main memory burden from tableau-based reasoning systems and perform efficient instance checking over SHI-knowledge bases.  ...  Traditional tableau-based reasoning systems perform bad answering queries over large data sets, because these reasoning systems are based on efficient use of main memory data structures.  ...  Traditional Description Logic algorithms can then be used to reason over these ABox modules.  ... 
doi:10.3233/ao-2012-0105 fatcat:wnyhpk6rsba7hknfjep6mlajsm

Towards Unveiling the Ontology Key Features Altering Reasoner Performances [article]

Nourhène Alaya and Sadok Ben Yahia and Myriam Lamolle
2015 arXiv   pre-print
Reasoning with ontologies is one of the core fields of research in Description Logics.  ...  A variety of efficient reasoner with highly optimized algorithms have been developed to allow inference tasks on expressive ontology languages such as OWL(DL).  ...  However, extending the logic ALC with transitive roles becomes the logic S. Then, SH extends S with role hierarchies H (rdfs:subPropertyOf).  ... 
arXiv:1509.08717v1 fatcat:2blv2wcflbetzop7vnurd7ijuy
« Previous Showing results 1 — 15 out of 3,229 results