58 Hits in 3.5 sec

Consistency Checking for Extended Description Logics

Olivier Couchariere, Marie-Jeanne Lesot, Bernadette Bouchon-Meunier
2008 International Workshop on Description Logics  
The proposed algorithm is based on a direct extension of the tableau algorithm to the possibilistic case, for which we introduce appropriate clash and completion rule definitions.  ...  We present a classification of existing algorithms and describe a new method for the possibilistic case that yields an inconsistency degree and not only a binary answer to the consistency question.  ...  Section 4 describes our extended tableau algorithm to compute an inconsistency degree for a possibilistic description logic base.  ... 
dblp:conf/dlog/CouchariereLB08 fatcat:va2ai6xzujdkvd3sp7ixu42wfu

Poss-OWL 2: Possibilistic Extension of OWL 2 for an Uncertain Geographic Ontology

Bal-Bourai Safia, Mokhtari Aicha
2014 Procedia Computer Science  
Based on our previous work, we propose a solution for handling uncertainty and for dealing with inconsistency in geographical applications.  ...  In this paper, we present an extension of the OWL 2, named Poss-OWL 2, based on our Poss − SROIQ(D) description logic (DL). Then we describe some reflections about the inference system.  ...  Qi 29 propose a possibilistic description logic as an extension of the description logic ALC applying the classic tableau algorithm.  ... 
doi:10.1016/j.procs.2014.08.121 fatcat:ymn53amkynh2dkucx4xautwqui

Interval-based Possibilistic Description Logic Programs for the Semantic Web

2018 DEStech Transactions on Computer Science and Engineering  
possibilistic logics and possibilistic description logics.  ...  Therefore, we propose tightly coupled interval-based possibilistic description logic programs under possibilistic answer set semantics, which are a tight integration of disjunctive logic programs, interval-based  ...  Moreover, Lesot et al. improved tableau algorithm and proposed a new algorithm to compute the inconsistency degree of a possibilistic DL knowledge base [16] .  ... 
doi:10.12783/dtcse/cmsms2018/25226 fatcat:kpan2i27ujhwpacrmvfuofdoaa

Generating Ontologies from Relational Data with Fuzzy-Syllogistic Reasoning [chapter]

Bora İ. Kumova
2015 Communications in Computer and Information Science  
Existing standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies.  ...  In that sense, a fuzzy syllogistic reasoner can be employed as a generic reasoner that combines possibilistic inferencing with probabilistic ontologies, thus facilitating knowledge exchange between ontology  ...  Description Logic Reasoners Most description logic reasoners use existing inference engines and utilise further techniques, such as decision tree, tableau algorithm or subsumption hierarchy, for handling  ... 
doi:10.1007/978-3-319-18422-7_2 fatcat:uufri3e6zng2xp3sw6gjebcdaq

Managing uncertainty and vagueness in description logics for the Semantic Web

Thomas Lukasiewicz, Umberto Straccia
2008 Journal of Web Semantics  
In this paper, we give an overview of approaches in this context to managing probabilistic uncertainty, possibilistic uncertainty, and vagueness in expressive description logics for the Semantic Web.  ...  Ontologies play a crucial role in the development of the Semantic Web as a means for defining shared terms in web resources.  ...  We refer the reader to [21, 53] for algorithms for possibilistic logic.  ... 
doi:10.1016/j.websem.2008.04.001 fatcat:te5ii2ore5egdfrrq4p2xrrzbi

Managing Uncertainty and Vagueness in Description Logics for the Semantic Web

Thomas Lukasiewicz, Umberto Straccia
2008 Social Science Research Network  
In this paper, we give an overview of approaches in this context to managing probabilistic uncertainty, possibilistic uncertainty, and vagueness in expressive description logics for the Semantic Web.  ...  Ontologies play a crucial role in the development of the Semantic Web as a means for defining shared terms in web resources.  ...  We refer the reader to [21, 53] for algorithms for possibilistic logic.  ... 
doi:10.2139/ssrn.3199411 fatcat:j3o6unkvafc65eurwpsea33t3u

Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs [chapter]

Umberto Straccia
2008 Lecture Notes in Computer Science  
We refer the reader to [59, 107] for algorithms for possibilistic logic.  ...  We refer the reader to [92, 93, 95] for algorithms for many-valued logics. Table 1 .  ...  A Some References Related to Logic Programming, Uncertainty and Vagueness Below a list of references and the underlying imprecision and uncertainty theory in logic programming frameworks.  ... 
doi:10.1007/978-3-540-85658-0_2 fatcat:6ijgfocetbfixonkur2lrnabjy

Optimization Techniques for Fuzzy Description Logics

Nikos Simou, Theofilos P. Mailis, Giorgos Stoilos, Giorgos B. Stamou
2010 International Workshop on Description Logics  
For this purpose the extension of the Description Logics using fuzzy set theory has been proposed, resulting to fuzzy Description Logics (DLs).  ...  Sophisticated uncertainty representation and reasoning are necessary for the alignment and integration of Web data from different sources.  ...  This reasoner does not implement a fuzzy tableau algorithm but an algorithm that reduces a fuzzy knowledge base to a crisp one [2] using Pellet [12] for reasoning.  ... 
dblp:conf/dlog/SimouMSS10 fatcat:cdm6cjtcsbfrtclhkiel3wbtoq

Modeling Uncertainty in Ontologies using Rough Set

Armand F. Donfack Kana, Babatunde O. Akinkunmi
2016 International Journal of Intelligent Systems and Applications  
This paper defines a way of handling uncertainty in description logic ontologies without remodeling existing ontologies or altering the syntax of existing ontologies modeling languages.  ...  Modeling the uncertain aspect of the world in ontologies is attracting a lot of interests to ontologies builders especially in the World Wide Web community.  ...  The algorithms for possibilistic inference of the proposed logics is independent of DL reasoner.  ... 
doi:10.5815/ijisa.2016.04.06 fatcat:5rjtqyxawrh5bcgve6j2qecv7a

Adding Context to Tableaux for DLs

Weili Fu, Rafael Peñaloza
2012 International Workshop on Description Logics  
These contexts could represent, for example, a degree of trust associated to the axiom, or a level of granularity for the knowledge provided.  ...  We describe an extension of tableaux-based decision procedures into methods that compute the best-fitting context for the consequences of an ontology, and apply it to the tableaux algorithm for ALC.  ...  Our approach can be used for extending the tableau-based algorithm for deciding consistency of ALC ABoxes w.r.t. general TBoxes, but is not limited to this logic.  ... 
dblp:conf/dlog/FuP12 fatcat:xaudpmithjgqnmpe7j4wbwzqne

Consistency reasoning in lattice-based fuzzy Description Logics

Stefan Borgwardt, Rafael Peñaloza
2014 International Journal of Approximate Reasoning  
Fuzzy Description Logics have been widely studied as a formalism for representing and reasoning with vague knowledge.  ...  On the one hand, we provide a tableaux-based algorithm for deciding consistency when the underlying lattice is finite. The algorithm generalizes the one developed for classical SHI.  ...  In [13] , a tableau algorithm is presented for the more expressive DL L-SHIN .  ... 
doi:10.1016/j.ijar.2013.07.006 fatcat:fwhh3nszw5bsvlnghbzkoo2oxa

Reasoning with Very Expressive Fuzzy Description Logics

G. Stoilos, G. Stamou, J. Z. Pan, V. Tzouvaras, I. Horrocks
2007 The Journal of Artificial Intelligence Research  
Description Logics (DLs) are a family of knowledge representation languages that have gained considerable attention the last decade, mainly due to their decidability and the existence of empirically high  ...  performance of reasoning algorithms.  ...  For such a domain one can use standard features of Description Logics to encode knowledge.  ... 
doi:10.1613/jair.2279 fatcat:tlqwpw2ulne45eibzpz5xprc2y

A formal framework for description logics with uncertainty

Volker Haarslev, Hsueh-Ieng Pai, Nematollaah Shiri
2009 International Journal of Approximate Reasoning  
In this paper, we present a framework for knowledge bases with uncertainty expressed in the description logic ALC U , which is a propositionally complete representation language providing conjunction,  ...  Description logics (DLs) play an important role in the Semantic Web as the foundation of ontology language OWL DL.  ...  Example of Applying ALC U tableau algorithm To illustrate the ALC U tableau algorithm and the need for blocking, let us consider a cyclic fuzzy knowledge base R ¼ hT ; Ai, where: T ¼ fhObesePerson v 9hasParent  ... 
doi:10.1016/j.ijar.2009.04.009 fatcat:lanke3ohd5dxjh7w7qjgwli424

A Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology's Axioms [chapter]

Franz Baader, Martin Knechtel, Rafael Peñaloza
2009 Lecture Notes in Computer Science  
Instead of precomputing these consequences for every possible sub-ontology, our approach computes just one label for each consequence such that a comparison of the user label with the consequence label  ...  Instead of materializing a large number of different sub-ontologies, we propose to keep just one ontology, but equip each axiom with a label from an appropriate labeling lattice.  ...  Examples for the application of the glassbox approach to specific instances of the problem of computing a boundary are tableau-based approaches for reasoning in possibilistic Description Logics [15, 13  ... 
doi:10.1007/978-3-642-04930-9_4 fatcat:kduldhsx3rds3jvfdqnylp426q

Mind the Web

Valentin Zacharias, Andreas Abecker, Denny Vrandecic, Imen Borgi, Simone Braun, Andreas P. Schmidt
2007 International Semantic Web Conference  
Similarly, a few approaches for more Semantic Web appropriate reasoning exist, but are in dire need of realistic use cases.  ...  This paper argues that a significant part of today's Semantic Web research is still dominated by ideas from centralized databases.  ...  the theory of distributed description logics, the DRAGO system [42] shows how tableau computations can be distributed to many machines for speeding up inferences.  ... 
dblp:conf/semweb/ZachariasAVBBS07 fatcat:56yk6pxyufeibkji7q4rcvcpfq
« Previous Showing results 1 — 15 out of 58 results