119 Hits in 2.3 sec

Consistency Testing: The RACE Experience [chapter]

Volker Haarslev, Ralf Möller
2000 Lecture Notes in Computer Science  
Some aspects of the RACE architecture are discussed in detail: (i) techniques involving caching and (ii) techniques for dealing with individuals.  ...  FaCT or DLP [10] ), which provide only concept consistency (and TBox) reasoning.  ...  Caching of a pseudo model for a specific concept (model caching) is a strategy which is implemented in the FaCT system and the DLP system [9] .  ... 
doi:10.1007/10722086_5 fatcat:zy4mbm7o5jehxbw7dpgwf2lemm

Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics [chapter]

Volker Haarslev, Ralf Möller, Anni-Yasmin Turhan
2001 Lecture Notes in Computer Science  
This paper investigates optimization techniques and data structures exploiting the use of so-called pseudo models.  ...  These techniques are applied to speed up TBox and ABox reasoning for the description logics ALCN H R + and ALC (D).  ...  Introduction We introduce and analyze optimization techniques for reasoning in expressive description logics exploiting so-called pseudo models.  ... 
doi:10.1007/3-540-45744-5_6 fatcat:iqajhcv5pze3pjotfdun5hjkyu

Converting Instance Checking to Subsumption: A Rethink for Object Queries over Practical Ontologies

Jia Xu, Patrick Shironoshita, Ubbo Visser, Nigel John, Mansur Kabuka
2015 International Journal of Intelligence Science  
This method, however, loses its simplicity and efficiency when applied to large and complex ontologies, as it tends to generate very large MSC's that could lead to intractable reasoning.  ...  With independence between computed MSC's, scalability for query answering can also be achieved by distributing and parallelizing the computations.  ...  Horn clauses of DLs [4] [5] [22] , model merging [2] and extended pseudo model merging technique [3] [30] .  ... 
doi:10.4236/ijis.2015.51005 pmid:26594595 pmcid:PMC4652860 fatcat:v7qmu4nft5d25e56cbp2hvbz34

Towards Scalable Instance Retrieval over Ontologies [chapter]

Alissa Kaplunova, Ralf Möller, Sebastian Wandelt, Michael Wessel
2010 Lecture Notes in Computer Science  
We propose to overcome this problem with a new so-called filter and refine paradigm for ontology-based query answering.  ...  Traditional reasoning systems may have problems to deal with large amounts of expressive ontological data (terminological as well as assertional data) that usually must be kept in main memory.  ...  Each model of flatten tbox(T ) is trivially also a model of T , and vice versa, each model of T can uniquely be extended to a model of flatten tbox(T ) (only the new atomic concepts must be interpreted  ... 
doi:10.1007/978-3-642-15280-1_40 fatcat:p7flolc6lzdqrabzalwhalhawy

Combining a DL Reasoner and a Rule Engine for Improving Entailment-Based OWL Reasoning [chapter]

Georgios Meditskos, Nick Bassiliades
2008 Lecture Notes in Computer Science  
The idea is to combine the TBox inferencing capabilities of the DL algorithms and the scalability of the rule paradigm over large ABoxes.  ...  ) that are generated by TBox queries to the DL reasoner.  ...  This work was partially supported by a PENED program (No. 03ΕΔ73), jointly funded by the European Union and the Greek government (GSRT).  ... 
doi:10.1007/978-3-540-88564-1_18 fatcat:ovvdypv2mvdnti4zcoz6776ste

Tableau-Based Reasoning [chapter]

Ralf Möller, Volker Haarslev
2009 Handbook on Ontologies  
Acknowledgments We would like to thank Sebastian Wandelt and Michael Wessel for comments on a draft of this chapter.  ...  The Abox consistency problem for an Abox A (w.r.t. a Tbox) is the problem to determine whether there exists a model of A (that is also a model of the Tbox).  ...  The test whether {¬B(i)} is consistent leads to a consistent Abox such that a label L 1 is defined for i. We call this label a pseudo model (for an atomic concept description).  ... 
doi:10.1007/978-3-540-92673-3_23 dblp:series/ihis/MollerH09 fatcat:kbut7fs33fet3fn3njfcx37phi

On the Scalability of Description Logic Instance Retrieval

Volker Haarslev, Ralf Möller
2008 Journal of automated reasoning  
individual pseudo models (aka pmodels) as specified in [5] .  ...  Future work will investigate optimizations of large Aboxes and more expressive Tboxes.  ... 
doi:10.1007/s10817-008-9104-7 fatcat:5d5s67gblvc5lnsdjoe6ya7bea

Description Logic Based Composition of Web Services [chapter]

Fen Lin, Lirong Qiu, He Huang, Qing Yu, Zhongzhi Shi
2006 Lecture Notes in Computer Science  
Services and service composition problems are formalized with DLs to provide well-defined semantics.  ...  We also make some performance optimization of the algorithm such as removing redundant services and reusing previously achieved goals.  ...  , and reasoning mechanism of Tbox and ABox.  ... 
doi:10.1007/11802372_21 fatcat:map4n7ohvvhzhcp32nnwtnt7t4

Advances in Accessing Big Data with Expressive Ontologies [chapter]

Ralf Möller, Christian Neuenstadt, Özgür L. Özçep, Sebastian Wandelt
2013 Lecture Notes in Computer Science  
In this paper we extend this approach by investigating optimization algorithms for answering grounded conjunctive queries. 3  ...  Ontology-based query answering has to be supported w.r.t. secondary memory and very expressive ontologies to meet practical requirements in some applications.  ...  Definition 7 (Pseudo Node Successor). Given an Abox A, a pseudo node successor of an individual a ∈ Inds(A) is a pair pns a,A = rs, cs , such that there is an a 2 ∈ Ind(A) with 1. ∀R ∈ rs.  ... 
doi:10.1007/978-3-642-40942-4_11 fatcat:hqqqqqi3qzav7gexolukfezk5y


Mojtaba Shokohinia, Abbas Dideban, Farzin Yaghmaee
2022 Malaysian Journal of Computer Science  
Finally, the efficiency of the proposed method, is evaluated against other reasoning engines, and the results show optimized performance vis-a-vis previous studies.  ...  Recently, many methods have been developed for representing knowledge, reasoning, and result extraction extracting results based on the respective domain knowledge in question.  ...  Then, having a common TBox and ABox is necessary to solve and integrate the two problems [63] .  ... 
doi:10.22452/mjcs.vol35no1.3 fatcat:lmsottx43vh5xnkph3ra2mzdmu

Description Logic Reasoning with Syntactic Updates [chapter]

Christian Halashek-Wiener, Bijan Parsia, Evren Sirin
2006 Lecture Notes in Computer Science  
This work aims to provide more efficient DL reasoning techniques for frequently changing instance bases (ABoxes).  ...  We present an algorithm for updating completion graphs under the syntactic addition and removal of ABox assertions.  ...  We would also like to thank Aditya Kalyanpur, Yarden Katz, and Vladimir Kolovski for all of their contributions to this work.  ... 
doi:10.1007/11914853_44 fatcat:4xpkolj4n5b2xkjvgb6b5ksldy

Absorption for ABoxes and TBoxes with General Value Restrictions [chapter]

Jiewen Wu, Taras Kinash, David Toman, Grant Weddell
2015 Lecture Notes in Computer Science  
T norm is first obtained from T , essentially to extract embedded typing constraints, and then a series of three subsequent TBoxes T i K are derived from T norm and the ABox A.  ...  Fig. 1 : Obtaining an ABox Absorption. bases with role hierarchies and transitive roles, and is also more adept in cases that involve a more extensive use of typing constraints, in particular for local  ...  The DL reasoner features a limited number of optimizations, including the ABox absorption technique described in this paper, optimized double blocking [4] , and dependency-directed backtracking [3] .  ... 
doi:10.1007/978-3-319-26350-2_54 fatcat:54cqn37565hhfid5i3rvgjaukq

Optimizing Terminological Reasoning for Expressive Description Logics

Dmitry Tsarkov, Ian Horrocks, Peter F. Patel-Schneider
2007 Journal of automated reasoning  
Tableau algorithms are currently the most widely-used and empirically the fastest algorithms for reasoning in expressive Description Logics, including the important Description Logics SHIQ and SHOIQ.  ...  The Description Logic system FaCT++ implements a wide variety of such optimisations, some present in other reasoners and some novel or refined in FaCT++.  ...  TBox and ABox.  ... 
doi:10.1007/s10817-007-9077-y fatcat:35vallijorahbjlcjhxj2a3w5e

Quantitative Methods for Similarity in Description Logics

Andreas Ecke
2016 Künstliche Intelligenz  
The canonical model I K of the ABox and the TBox is generated by the use of a standard DL reasoner; currently Elastiq uses the Elk system [KKS14] . Step 2: Local preprocessing.  ...  We compared Elastiq's overall reasoning times with the ABox realization times of the commonly used FaCT++ reasoner [TH06] .  ... 
doi:10.1007/s13218-016-0460-x fatcat:4dmqzlcj3ffofpqgyxa52ty5fq

Pellet: A Practical OWL-DL Reasoner

Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, Yarden Katz
2007 Social Science Research Network  
Section 6 covers the new optimizations introduced in Pellet, while Section 7 compares Pellet's performance with RacerPro and FaCT++.  ...  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  ...  We are also grateful to Fujitsu Labs of America and especially to Ryusuke Masuoka for providing real-world problems that required new levels of functionality and performance.  ... 
doi:10.2139/ssrn.3199351 fatcat:xmjjuwarpnh6pmntazbg3c5lza
« Previous Showing results 1 — 15 out of 119 results