A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions
|
|
- Ruth Hopkins
- 5 years ago
- Views:
Transcription
1 A Crisp Representation for Fuzzy SHOIN with Fuzzy Nominals and General Concept Inclusions Fernando Bobillo Miguel Delgado Juan Gómez-Romero Department of Computer Science and Artificial Intelligence University of Granada, Spain 2th Workshop on Uncertainty Reasoning for the Semantic Web Athens, GE, USA, November 2006 F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
2 Agenda 1 Introduction 2 A Quick Survey on SHOIN 3 Fuzzy SHOIN 4 A Crisp Representation for Fuzzy SHOIN 5 Conclusions and Future Work F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
3 Preliminaries Ontologies are a core element in the layered architecture of the Semantic Web Description Logics (DLs) are a family of logics for representing structured knowledge DLs have been proved to be very useful as ontology languages Standard for ontology representation: OWL Web Ontology Language: OWL Lite OWL DL, the most used, nearly equivalent to SHOIN (D) DL OWL Full, undecidable F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
4 Motivation Classical ontologies/dls are not appropriate for uncertain or imprecise knowledge Examples: German is generally spoken in Germany, Austria and Switzerland An inn is a cheap and small hotel Vagueness is inherent to a lot of real-world application domains The Semantic Web will not be fully operative as long as it does not provide means to manage it One solution: Fuzzy DLs (DLs extended with fuzzy sets theory) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
5 Motivation (2) OWL may be extended to a fuzzy DL-based language e.g. FuzzyOWL The large number of resources available should be adapted In particular, we need reasoners Reasoning within expressive DLs has a very high worst-case complexity Significant gap between the design of a decision procedure and the achievement of a practical implementation The experience with crisp DLs induces us to think that developing highly optimized implementations will be a hard task where ad-hoc mechanisms should be used for every particular fuzzy DL In fact, there is no implemented reasoner for f SHOIN Nothing is known about the efficiency of existing reasoners: fuzzydl (f KD 1 SHIF(D), f LSHIF(D)) Fire (f KD SHIN ) 1 subscript stands for the implication used, which specifies the other operators F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
6 Motivation (3) Alternative way to obtain fuzzy ontologies facing these problems: To represent fuzzy DLs using crisp DLs To reduce reasoning within fuzzy DLs to reasoning within crisp DLs This way it would be possible: To translate them automatically into a crisp ontology language To use currently available and highly optimized reasoners Not a lot of work following this line U. Straccia showed a reasoning preserving procedure for f ALCH F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
7 Motivation (4) On the other hand, current fuzzy DLs still present some limitations which we think that should be overcome: Some works on fuzzy DLs deal with nominals (named individuals) They choose not to fuzzify the nominal construct arguing that a fuzzy singleton set does not represent any real concept world. Hence, only crisp concepts can be defined extensively, as nominals either have to fully belong to them or not There have been proposed fuzzy general concept inclusions which allow to constrain the truth value of a general concept inclusion Current reasoning algorithms do not allow them F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
8 Contributions 1 We propose a different definition of f SHOIN including: A fuzzy nominal construct Reasoning with fuzzy GCIs 2 We reduce reasoning in f KD SHOIN to reasoning in SHOIN, extending the existing work on f KD ALCH F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
9 Agenda 1 Introduction 2 A Quick Survey on SHOIN 3 Fuzzy SHOIN 4 A Crisp Representation for Fuzzy SHOIN 5 Conclusions and Future Work F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
10 Syntax: Knowledge base ABox: finite set of assertions about individuals: Concept assertions a : C (a is an instance of C) Role assertions (a, b) : R ((a, b) is an instance of R) Individual assertions: a b (a and b are different individuals) a = b (a and b refer to the same individual) TBox: a finite set of concept axioms: General concept inclusions (GCI) C D (C is more specific than D) Concept definitions C D (C D and D C) RBox: a finite set of role axioms: Role inclusions R R (R is more specific than R ) Role definitions R R (R R and R R) Transitive role axioms trans(r) (R is transitive) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
11 Syntax: Complex concepts and roles The concepts of the language can be built inductively: C, D A (atomic concept) (top concept) (bottom concept) C D (concept conjunction) C D (concept disjunction) C (concept negation) R.C (universal quantification) R.C (full existential quantification) {o 1,..., o m } (nominals) ( n S) (at-least unqualified number restriction) ( n S) (at-most unqualified number restriction) The roles of the language can be built using this syntax rule: R R A (atomic role) R (inverse role) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
12 Semantics (1) An interpretation I is a pair ( I, I) consisting of: A non empty set I (the interpretation domain) An interpretation function I mapping: Every individual onto an element of I Every atomic concept A onto a set A I I Every atomic role R onto a binary relation R I I I. We do not impose unique name assumption (UNA), i.e. two nominals might refer to the same individual F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
13 Semantics (2) The interpretation is extended to complex concepts and roles by the following inductive definitions: I = I I = (C D) I = C I D I (C D) I = C I D I ( C) I = I \ C I ( R.C) I = {a : b, (a, b) / R I or b C I } ( R.C) I = {a : b, (a, b) R I and b C I } {o 1,..., o m } I = {o1 I,..., oi m} ( 0 S.C) I = I = I ( m 2 S.C) I = {a : {b : (a, b) S I and b C I } m} ( n S.C) I = {a : {b : (a, b) S I and b C I } n} (R ) I = {(b, a) I I (a, b) R I } 2 m > 0 F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
14 Semantics (3) An interpretation I satisfies (is a model of): a : C iff a I C I (a, b) : R iff (a, b) I R I a b iff a I b I a = b iff a I = b I C D iff C I D I C D iff C I = D I R R iff R I R I R R iff R I = R I trans(r) iff (R) I is transitive ABox K A iff I satisfies each element in K A TBox K T iff I satisfies each element in K T RBox K R iff I satisfies each element in K R KB K = K A, K T, K R iff I satisfies all K A, K T and K R F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
15 Reasoning A DL not only stores axioms and assertions, but also offers some reasoning services, such as: KB satisfiability Concept satisfiability Subsumption between concepts Instance checking If a DL is closed under negation then all the basic reasoning services are reducible to KB satisfiability F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
16 Agenda 1 Introduction 2 A Quick Survey on SHOIN 3 Fuzzy SHOIN 4 A Crisp Representation for Fuzzy SHOIN 5 Conclusions and Future Work F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
17 Syntax f SHOIN extends SHOIN to the fuzzy case by letting: Concepts denote fuzzy sets of individuals Roles denote fuzzy binary relations between individuals Our logic is similar to other approaches adding: Fuzzy nominals Constraints on fuzzy GCIs A fuzzy Knowledge Base (fkb) contains: A fuzzy ABox fk A A fuzzy TBox fk T A fuzzy RBox fk R F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
18 Syntax: fuzzy ABox Novelty: the truth value of constrained concept and role assertions Concepts and role assertions: Ψ α Ψ > β Φ β Φ < α where: Ψ is an assertion of the form a : C or (a, b) : R Φ is an assertion of the form a : C α (0, 1] (excludes 0) β [0, 1) (excludes 1) Some assertions are not allowed: (a, b) : R β, (a, b) : R < α : relate to negated roles ( SHOIN ) a : C > 1, a : C < 0, (a, b) : R > 1 : trivially unsatisfiable a : C 0, a : C 1, (a, b) : R 0 : trivially satisfiable Individual assertions: a b a = b F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
19 Syntax: fuzzy TBox and RBox Novelty: the truth value of GCIs may be constrained Fuzzy GCIs: C D α C D > β C D β C D < α C D is an abbreviation of C D 1 and D C 1 Fuzzy role inclusions R R Fuzzy role definitions R R (R R and R R) Transitive role axiom trans(r) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
20 Syntax: complex concepts and roles Concepts can be built inductively: C, D A (atomic concept) (top concept) (bottom concept) C D (concept conjunction) C D (concept disjunction) C (concept negation) R.C (universal quantification) R.C (full existential quantification) {(o 1, α 1 ),..., (o m, α m )} (nominals) ( n S) (at-least number restriction) ( n S) (at-most number restriction) Complex roles can be built using this syntax rule: R R A R F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
21 Semantics (1) A fuzzy interpretation I is a pair ( I, I) consisting of: A non empty set I (the interpretation domain) A fuzzy interpretation function I mapping: Every individual onto an element of I Every concept C onto a function C I : I [0, 1] Every role R onto a function R I : I I [0, 1] C I : membership degree function of the fuzzy concept C w.r.t. I R I : membership degree function of the fuzzy role R w.r.t. I In fuzzy DLs most reasoning services are reducible to fkb satisfiability, so here in after we will only consider this task We do not impose unique name assumption (UNA) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
22 Semantics (2) The fuzzy interpretation function is extended: I (a) = 1 I (a) = 0 (C D) I (a) = C I (a) D I (a) (C D) I (a) = C I (a) D I (a) ( C) I (a) = C I (a) ( R.C) I (a) = inf b I{R I (a, b) C I (b)} ( R.C) I (a) = sup b I{R I (a, b) C I (b)} {(o i, α i )} I (a) = sup i a {o I i } α i ( 0) I (a) = I (a) = 1 ( m) I (a) = sup b1,...,b m I[ m i=1 S I (a, b i ) i<j {b i b j }] ( n S) I (a) = ( n+1 S) I (a) (R ) I (a, b) = R I (b, a) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
23 Fuzzy nominals Example: Country where German is a widely spoken language: C {germany, austria, switzerland} The classical semantics forces switzerland to fully belong to the concept or not: {o i } I (a) = 1 if a {o I i } or 0 otherwise With fuzzy nominals: {(germany, 1), (austria, 1), (switzerland, 0.67)} It does represent a real-life concept: a fuzzy set defined extensively Recall that the semantics is sup i a {o I i } α i a : C 0.8 prevents a of being germany or austria Different from a fuzzy disjunction of nominals. We consider equality between individuals (a = o i ) to be crisp The definition generalizes the previous definition for nominals F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
24 Semantics (3) A fuzzy interpretation I satisfies (is a model of): a : C α 3 iff C I (a I ) α (a, b) : R α 3 iff R I (a I, b I ) α a b iff a I b I a = b iff a I = b I C D α 3 iff inf a I {C I (a) D I (a)} α C D iff C I = D I R R iff R I R I R R iff R I = R I trans(r) iff a, b I, R I (a, b) sup c I R I (a, c) R I (c, b) ABox K A iff I satisfies each element in K A TBox K T iff I satisfies each element in K T RBox K R iff I satisfies each element in K R fkb K A, K T, K R iff I satisfies all K A, K T and K R 3 Definitions are similar for > β, β and < α F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
25 Fuzzy GCIs The definition of fuzzy GCIs allows concept subsumption to hold to a certain degree in [0, 1] Example: Inn Hotel 0.5 Translating universal quantification and GCIs to First Order Logic leads to implication functions It seems natural to let both (or neither) of them be fuzzy This does not hold for role inclusion axioms Asymmetry in the expressivity The implication function would require the subjacent DL to have negated roles and role disjunction We have preferred to consider SHOIN, underlying OWL DL F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
26 Some properties (1) Lemma Fuzzy interpretations coincide with crisp interpretations if we restrict to the membership degrees of 0 and 1 Here in after we concentrate on f KD SHOIN : Gödel t-norm (minimum) α β = min{α, β} Gödel t-conorm (maximum) α β = max{α, β} Lukasiewicz negation α = 1 α Kleene-Dienes implication α β = max{1 α, β} This choice of the t-norm and the t-conorm eases the translation F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
27 Some properties (2) Lemma f KD SHOIN allows some sort of modus ponens over concepts and roles, even with the new semantics of fuzzy GCIs: For α, β, γ [0, 1], = {, >} and α 1 β ( = <, > = ), the following properties are verified: (i) a : C α and C D β imply a : D β (ii) (a, b) : R γ and R R imply (a, b) : R γ (iii) (a, b) : R α and a : R.C β imply b : C β F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
28 Some properties (3) The use of Kleene-Dienes implication in the semantics of fuzzy GCIs brings about two counter-intuitive effects: 1 A concept does not fully subsume itself: C C inf a I max{1 C I (a), C I (a)} = Crisp concept subsumption forces fuzzy concepts to be crisp: C D 1 inf a I max{1 C I (a), D I (a)} 1 which is true iff for each element of the domain D I (a) = 1 or C I (a) = 0 Need of further investigation involving alternative fuzzy operators! A residuum based implication would fix 1: a b = 1 if a b Lukasiewicz implication would fix 2: a b = min{1, 1 a + b} F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
29 Agenda 1 Introduction 2 A Quick Survey on SHOIN 3 Fuzzy SHOIN 4 A Crisp Representation for Fuzzy SHOIN 5 Conclusions and Future Work F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
30 Intuitive idea U. Straccia presents a reasoning preserving transformation for f KD ALCH into crisp ALCH We extend this work to f KD SHOIN Example: transform a : A 0.8 into a : A 0.8 (0.8-cut of A) Procedure: 1 Define some new atomic concepts and roles 2 Add some new axioms to preserve the semantics of the fkb 3 Map separately ABox, TBox and RBox F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
31 New elements (1) It has been shown that in f KD ALC, the set of the degrees which must be considered for any reasoning task can be computed as: N fk = X fk {1 α α X fk } where X fk is the set of degrees appearing in the fkb: X fk = {0, 0.5, 1} {α Ψ α fk A } {β Ψ > β fk A } {1 β Φ β fk A } {1 α Φ < α fk A } {α Ω α fk T } {β Ω > β fk T } {1 β Ω β fk T } {1 α Ω < α fk T } This also holds in f KD SHOIN When other fuzzy operators are considered this is no longer true We may calculate all possible degrees in [0, 1] with a given precision, but further investigation is required F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
32 New elements (2) For every atomic concept and role in the fkb and for each degree N fk we create: Four new atomic concepts A α, A >β, A β, A <α Two new atomic roles R α, R >β Informally, A α represents the crisp set of individuals which are instance of A with degree higher or equal than α (α-cut of A) A <0, A >1, R >1 are not considered (they are always empty sets) A 1, A 0, R 0 are not considered (they are equivalent to ) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
33 New elements (3) The semantics of these newly introduced atomic concepts and roles is preserved by some terminological and role axioms New concept axioms: A γi+1 A >γi A >γi A γi A <γj A γj A γi A <γi+1 A γj A <γj A >γi A γi A γj A <γj A >γi A γi New role axioms: R γi+1 R >γi R >γi R γi (a, b) : R β, (a, b) : R < α would need additional role constructs: R, R, R, R F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
34 Mapping the ABox A fuzzy ABox is mapped into using a mapping σ: σ( a : C γ ) = a : ρ(c, γ) σ( (a, b) : R γ ) = (a, b) : ρ(r, γ) σ( a b ) = a b σ( a = b ) = a = b Fuzzy assertions are mapped into crisp assertions ρ is inductively defined on the structure of concepts and roles F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
35 Mapping concepts and roles (1) x y ρ(x, y) A γ A γ if γ 0, otherwise A > γ A >γ, if γ 1, otherwise A γ A γ if γ 0, otherwise A < γ A <γ, if γ 1, otherwise R γ R γ if γ 0, otherwise R > γ R >γ, if γ 1, otherwise γ > γ if γ 1, otherwise γ if γ = 1, otherwise < γ γ if γ = 0, otherwise > γ γ < γ if γ 0, otherwise F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
36 Mapping concepts and roles (2) x y ρ(x, y) C D {, >} γ ρ(c, {, >} γ) ρ(d, {, >} γ) C D {, <} γ ρ(c, {, <} γ) ρ(d, {, <} γ) C D {, >} γ ρ(c, {, >} γ) ρ(d, {, >} γ) C D {, <} γ ρ(c, {, <} γ ρ(d, {, <} γ) C {, >} γ ρ(c, {, <} 1 γ) C {, <} γ ρ(c, {, >} 1 γ) R.C {, >} γ ρ(r, {, >} γ).ρ(c, {, >} γ) R.C {, <} γ ρ(r, {>, } γ).ρ(c, {, <} γ) R.C {, >} γ ρ(r, {>, } 1 γ).ρ(c, {, >} γ) R.C {, <} γ ρ(r, {, >} 1 γ).ρ(c, {, <} γ) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
37 Mapping concepts and roles (3) x y ρ(x, y) {(o 1, α 1 ),..., (o m, α m )} γ {o i α i γ, 1 i n} γ 0 S γ ρ(, γ) m S {, >} γ m ρ(s, {, >} γ) m S {, <} γ m 1 ρ(s, {>, } γ) n S {, >} γ n ρ(s, {>, } 1 γ) n S {, <} γ n+1 ρ(s, {, >} 1 γ) R γ ρ(r, γ) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
38 Mapping the TBox A positive GCI (, >) is reduced into a GCI: k( C D γ ) = ρ(c, > 1 γ) ρ(d, γ) k( C D > γ ) = ρ(c, 1 γ) ρ(d, > γ) A negative GCI (, <) is reduced into an assertion about a new individual x: A( C D γ ) = x : ρ(c, 1 γ) ρ(d, γ) A( C D < γ ) = x : ρ(c, > 1 γ) ρ(d, < γ) The natural reduction would be to a negated GCI, but it is not part of crisp SHOIN How to deal with alternative implication functions? F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
39 Mapping the RBox A fuzzy RBox is reduced using a function k(fk, fk R ) = Ω fk R k(ω) Role axioms are reduced using a function k(ω): k(r R ) = γ N fk, {,>} ρ(r, γ) ρ(r, γ) k(trans(r)) = γ N fk, {,>} trans(ρ(r, γ)) F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
40 Complexity A fkb fk is reduced into a KB K(fK): The complexity is quadratic: ABox is linear TBox and RBox are quadratic fkb K(fK) fk A σ(fk A ) A(fK T ) fk T T (N fk ) k(fk, fk T ) fk R R(N fk ) k(fk, fk R ) In the previous work, a fuzzy GCI is reduced into a set of crisp GCIs Our semantics for fuzzy GCIs allows to reduce each axiom into either an axiom or an assertion This reduction in the size of the TBox is very interesting since reasoning with GCIs is a source of computational complexity F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
41 Reasoning Theorem A f KD SHOIN fkb fk is satisfiable iff K(fK) is satisfiable Firstly, it has to be proved that the translation preserves the satisfiability of every single statement of the fkb If there exists a fuzzy interpretation satisfying a fuzzy statement, then a crisp interpretation satisfying the result of its translation can be built Secondly, it has to be proved that the translation preserves the satisfiability of the whole fkb Clashes produced by pairs of conjugated axioms are preserved by the new concept axioms: A γj A <γj, A >γi A γi F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
42 Agenda 1 Introduction 2 A Quick Survey on SHOIN 3 Fuzzy SHOIN 4 A Crisp Representation for Fuzzy SHOIN 5 Conclusions and Future Work F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
43 Conclusions A sound fuzzy extension of SHOIN including: Fuzzy nominals, enabling to define fuzzy sets extensively Reasoning with fuzzy GCIs, allowing to constrain the truth value of a GCI Reasoning preserving procedure into a crisp KB. Alternative approach to achieve fuzzy ontologies, reusing currently existing crisp ontology languages and reasoners The semantics of fuzzy GCIs: Allows fuzzy GCIs holding to some degree Reduces the size of the resulting TBox w.r.t. Zadeh implication However, it imposes some counter-intuitive effects F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
44 Future work Empirical evaluation to test the translation Consider different fuzzy operators In particular, avoid the counter-intuitive effects of the Kleene-Dienes implication Include a crisp representation for fuzzy datatypes Since OWL does not currently allow to define customised datatypes, consider OWL Eu Consider more expressive DLs and, in particular, SROIQ: Subjacent DL of OWL 1.1 The additional expressivity in roles may help to overcome the asymmetry in fuzzy concept and role inclusion axioms F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
45 Questions? Thank you very much for your attention F. Bobillo et al. (University of Granada) Fuzzy SHOIN + fuzzy nominals + GCIs URSW / 45
Optimizing the Crisp Representation of the Fuzzy Description Logic SROIQ
Optimizing the Crisp Representation of the Fuzzy Description Logic SROIQ Fernando Bobillo, Miguel Delgado, and Juan Gómez-Romero Department of Computer Science and Artificial Intelligence, University of
More informationA MILP-based decision procedure for the (Fuzzy) Description Logic ALCB
A MILP-based decision procedure for the (Fuzzy) Description Logic ALCB Fernando Bobillo 1 and Umberto Straccia 2 1 Dpt. of Computer Science & Systems Engineering, University of Zaragoza, Spain 2 Istituto
More informationGödel Negation Makes Unwitnessed Consistency Crisp
Gödel Negation Makes Unwitnessed Consistency Crisp Stefan Borgwardt, Felix Distel, and Rafael Peñaloza Faculty of Computer Science TU Dresden, Dresden, Germany [stefborg,felix,penaloza]@tcs.inf.tu-dresden.de
More informationOptimization Techniques for Fuzzy Description Logics
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Optimization Techniques for Fuzzy Description Logics Nikolaos Simou 1, Theofilos Mailis 1, Giorgos Stoilos
More informationA SHORT GUIDE TO FUZZY DESCRIPTION LOGICS
Institute of Theoretical Computer Science Chair of Automata Theory A SHORT GUIDE TO FUZZY DESCRIPTION LOGICS Stefan Borgwardt Oxford, December 9th, 2014 Zadeh Introduction Trivial Fuzzy DLs Go del [0,
More informationA Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System
1 / 31 A Zadeh-Norm Fuzzy Description Logic for Handling Uncertainty: Reasoning Algorithms and the Reasoning System Judy Zhao 1, Harold Boley 2, Weichang Du 1 1. Faculty of Computer Science, University
More informationA Framework for Reasoning with Expressive Continuous Fuzzy Description Logics
A Framework for Reasoning with Expressive Continuous Fuzzy Description Logics Giorgos Stoilos 1, Giorgos Stamou 1 Department of Electrical and Computer Engineering, National Technical University of Athens,
More informationPhase 1. Phase 2. Phase 3. History. implementation of systems based on incomplete structural subsumption algorithms
History Phase 1 implementation of systems based on incomplete structural subsumption algorithms Phase 2 tableau-based algorithms and complexity results first tableau-based systems (Kris, Crack) first formal
More informationReasoning with Very Expressive Fuzzy Description Logics
Journal of Artificial Intelligence Research? (????)?-? Submitted 10/05; published?/?? Reasoning with Very Expressive Fuzzy Description Logics Giorgos Stoilos gstoil@image.ece.ntua.gr Giorgos Stamou gstam@softlab.ece.ntua.gr
More informationNon-Gödel Negation Makes Unwitnessed Consistency Undecidable
Non-Gödel Negation Makes Unwitnessed Consistency Undecidable Stefan Borgwardt and Rafael Peñaloza {stefborg,penaloza}@tcs.inf.tu-dresden.de Theoretical Computer Science, TU Dresden, Germany Abstract. Recent
More informationAn Introduction to Description Logic III
An Introduction to Description Logic III Knowledge Bases and Reasoning Tasks Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014
More informationThe Complexity of Lattice-Based Fuzzy Description Logics
Noname manuscript No (will be inserted by the editor) The Complexity of Lattice-Based Fuzzy Description Logics From ALC to SHI Stefan Borgwardt Rafael Peñaloza the date of receipt and acceptance should
More informationA Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices
A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices Stefan Borgwardt and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de
More informationThe Fuzzy Description Logic ALC F LH
The Fuzzy Description Logic ALC F LH Steffen Hölldobler, Nguyen Hoang Nga Technische Universität Dresden, Germany sh@iccl.tu-dresden.de, hoangnga@gmail.com Tran Dinh Khang Hanoi University of Technology,
More informationAn Introduction to Description Logics
An Introduction to Description Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, 21.11.2013 Marco Cerami (UPOL) Description Logics 21.11.2013
More informationOn the Decidability Status of Fuzzy ALC with General Concept Inclusions
J Philos Logic manuscript No. (will be inserted by the editor) On the Decidability Status of Fuzzy ALC with General Concept Inclusions Franz Baader Stefan Borgwardt Rafael Peñaloza Received: date / Accepted:
More informationAn Introduction to Description Logics: Techniques, Properties, and Applications. NASSLLI, Day 2, Part 2. Reasoning via Tableau Algorithms.
An Introduction to Description Logics: Techniques, Properties, and Applications NASSLLI, Day 2, Part 2 Reasoning via Tableau Algorithms Uli Sattler 1 Today relationship between standard DL reasoning problems
More informationManaging Uncertainty and Vagueness in Description Logics for the Semantic Web
Managing Uncertainty and Vagueness in Description Logics for the Semantic Web Thomas Lukasiewicz a,1 Umberto Straccia b a Dipartimento di Informatica e Sistemistica, Sapienza Università di Roma Via Ariosto
More informationConsistency checking for extended description logics
Consistency checking for extended description logics Olivier Couchariere ab, Marie-Jeanne Lesot b, and Bernadette Bouchon-Meunier b a Thales Communications, 160 boulevard de Valmy, F-92704 Colombes Cedex
More informationLTCS Report. Subsumption in Finitely Valued Fuzzy EL. Stefan Borgwardt Marco Cerami Rafael Peñaloza. LTCS-Report 15-06
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Subsumption in Finitely Valued Fuzzy EL Stefan Borgwardt Marco Cerami Rafael Peñaloza LTCS-Report
More informationFuzzy Description Logics
Fuzzy Description Logics 1. Introduction to Description Logics Rafael Peñaloza Rende, January 2016 Literature Description Logics Baader, Calvanese, McGuinness, Nardi, Patel-Schneider (eds.) The Description
More informationFuzzy Ontologies over Lattices with T-norms
Fuzzy Ontologies over Lattices with T-norms Stefan Borgwardt and Rafael Peñaloza Theoretical Computer Science, TU Dresden, Germany {stefborg,penaloza}@tcs.inf.tu-dresden.de 1 Introduction In some knowledge
More informationRole-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes
Role-depth Bounded Least Common Subsumers by Completion for EL- and Prob-EL-TBoxes Rafael Peñaloza and Anni-Yasmin Turhan TU Dresden, Institute for Theoretical Computer Science Abstract. The least common
More informationQuasi-Classical Semantics for Expressive Description Logics
Quasi-Classical Semantics for Expressive Description Logics Xiaowang Zhang 1,4, Guilin Qi 2, Yue Ma 3 and Zuoquan Lin 1 1 School of Mathematical Sciences, Peking University, Beijing 100871, China 2 Institute
More informationChapter 2 Background. 2.1 A Basic Description Logic
Chapter 2 Background Abstract Description Logics is a family of knowledge representation formalisms used to represent knowledge of a domain, usually called world. For that, it first defines the relevant
More informationFuzzy OWL: Uncertainty and the Semantic Web
Fuzzy OWL: Uncertainty and the Semantic Web Giorgos Stoilos 1, Giorgos Stamou 1, Vassilis Tzouvaras 1, Jeff Z. Pan 2 and Ian Horrocks 2 1 Department of Electrical and Computer Engineering, National Technical
More informationReasoning in Expressive Gödel Description Logics
Reasoning in Expressive Gödel Description Logics Stefan Borgwardt 1 and Rafael Peñaloza 2 1 Chair for Automata Theory, Theoretical Computer Science, TU Dresden, Germany stefan.borgwardt@tu-dresden.de 2
More informationReasoning with Qualified Cardinality Restrictions in Fuzzy Description Logics
Reasoning with Qualified Cardinality Restrictions in Fuzzy Description Logics Giorgos Stoilos and Giorgos Stamou and Stefanos Kollias Abstract Description Logics (DLs) are modern knowledge representation
More informationSemantic Web Uncertainty Management
1 Semantic Web Uncertainty Management Volker Haarslev Concordia University, Canada S Hsueh-leng Pai Concordia University, Canada Nematollaah Shiri Concordia University, Canada INTRODUCTION Since the introduction
More informationALC Concept Learning with Refinement Operators
ALC Concept Learning with Refinement Operators Jens Lehmann Pascal Hitzler June 17, 2007 Outline 1 Introduction to Description Logics and OWL 2 The Learning Problem 3 Refinement Operators and Their Properties
More informationFuzzy DLs over Finite Lattices with Nominals
Fuzzy DLs over Finite Lattices with Nominals Stefan Borgwardt Theoretical Computer Science, TU Dresden, Germany stefborg@tcs.inf.tu-dresden.de Abstract. The complexity of reasoning in fuzzy description
More informationInconsistency-Tolerant Reasoning with OWL DL
Inconsistency-Tolerant Reasoning with OWL DL Xiaowang Zhang a,, Guohui Xiao b, Zuoquan Lin c, Jan Van den Bussche a a Hasselt University and transnational University of Limburg, 3590 Diepenbeek, Belgium
More informationA Fuzzy Description Logic for Multimedia Knowledge Representation
A Fuzzy Description Logic for Multimedia Knowledge Representation Giorgos Stoilos 1, Giorgos Stamou 1, Vassilis Tzouvaras 1, Jeff Z. Pan 2 and Ian Horrocks 2 1 Department of Electrical and Computer Engineering,
More informationSemantics and Inference for Probabilistic Ontologies
Semantics and Inference for Probabilistic Ontologies Fabrizio Riguzzi, Elena Bellodi, Evelina Lamma, and Riccardo Zese ENDIF University of Ferrara, Italy, email: {fabrizio.riguzzi, elena.bellodi, evelina.lamma}@unife.it,
More informationDescription Logics with Fuzzy Concrete Domains
Description Logics with Fuzzy Concrete Domains Straccia, Umberto ISTI - CNR, Pisa, ITALY straccia@isti.cnr.it Abstract We present a fuzzy version of description logics with concrete domains. Main features
More informationModular Reuse of Ontologies: Theory and Practice
Journal of Artificial Intelligence Research 31 (2008) 273-318 Submitted 07/07; published 02/08 Modular Reuse of Ontologies: Theory and Practice Bernardo Cuenca Grau Ian Horrocks Yevgeny Kazakov Oxford
More informationA New Approach to Knowledge Base Revision in DL-Lite
A New Approach to Knowledge Base Revision in DL-Lite Zhe Wang and Kewen Wang and Rodney Topor School of ICT, Griffith University Nathan, QLD 4111, Australia Abstract Revising knowledge bases (KBs) in description
More informationDescription Logics: an Introductory Course on a Nice Family of Logics. Day 2: Tableau Algorithms. Uli Sattler
Description Logics: an Introductory Course on a Nice Family of Logics Day 2: Tableau Algorithms Uli Sattler 1 Warm up Which of the following subsumptions hold? r some (A and B) is subsumed by r some A
More informationAnswering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies
Noname manuscript No. (will be inserted by the editor) Answering Fuzzy Conjunctive Queries over Finitely Valued Fuzzy Ontologies Stefan Borgwardt Theofilos Mailis Rafael Peñaloza Anni-Yasmin Turhan the
More informationŁukasiewicz Fuzzy EL is Undecidable
Łukasiewicz Fuzzy EL is Undecidable Stefan Borgwardt 1, Marco Cerami 2, and Rafael Peñaloza 3 1 Chair for Automata Theory, Theoretical Computer Science, TU Dresden, Germany stefan.borgwardt@tu-dresden.de
More informationRelations to first order logic
An Introduction to Description Logic IV Relations to first order logic Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, November 6 th 2014 Marco
More informationReasoning with Annotated Description Logic Ontologies
Reasoning with Annotated Description Logic Ontologies an Stelle einer Habilitationsschrift vorgelegt an der Technischen Universität Dresden Fakultät Informatik eingereicht von Dr. rer. nat. Rafael Peñaloza
More informationFOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES
FOUNDATIONS OF SEMANTIC WEB TECHNOLOGIES OWL & Description Logics Markus Krötzsch Dresden, 16 May 2014 Content Overview & XML Introduction into RDF RDFS Syntax & Intuition Tutorial 1 RDFS Semantics RDFS
More informationA Logical Framework for Modularity of Ontologies
A Logical Framework for Modularity of Ontologies Bernardo Cuenca Grau, Ian Horrocks, Yevgeny Kazakov and Ulrike Sattler The University of Manchester School of Computer Science Manchester, M13 9PL, UK {bcg,
More informationAbout Subsumption in Fuzzy EL
About Subsumption in Fuzzy EL Stefan Borgwardt 1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden {stefborg,penaloza}@tcs.inf.tu-dresden.de
More informationTightly Integrated Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web
Tightly Integrated Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web Thomas Lukasiewicz 1, 2 and Umberto Straccia 3 1 DIS, Università di Roma La Sapienza, Via Salaria
More informationA Possibilistic Extension of Description Logics
A Possibilistic Extension of Description Logics Guilin Qi 1, Jeff Z. Pan 2, and Qiu Ji 1 1 Institute AIFB, University of Karlsruhe, Germany {gqi,qiji}@aifb.uni-karlsruhe.de 2 Department of Computing Science,
More informationThe Complexity of Subsumption in Fuzzy EL
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) Stefan Borgwardt Chair for Automata Theory Technische Universität Dresden Germany Stefan.Borgwardt@tu-dresden.de
More informationA Refined Tableau Calculus with Controlled Blocking for the Description Logic SHOI
A Refined Tableau Calculus with Controlled Blocking for the Description Logic Mohammad Khodadadi, Renate A. Schmidt, and Dmitry Tishkovsky School of Computer Science, The University of Manchester, UK Abstract
More informationDescription logics. Description Logics. Applications. Outline. Syntax - AL. Tbox and Abox
Description Logics Description logics A family of KR formalisms, based on FOPL decidable, supported by automatic reasoning systems Used for modelling of application domains Classification of concepts and
More informationA Boolean Lattice Based Fuzzy Description Logic in Web Computing
A Boolean Lattice Based Fuzzy Description Logic in Web omputing hangli Zhang, Jian Wu, Zhengguo Hu Department of omputer Science and Engineering, Northwestern Polytechnical University, Xi an 7007, hina
More informationDL-Lite Contraction and Revision
Journal of Artificial Intelligence Research 56 (2016) 329-378 Submitted 12/15; published 06/16 DL-Lite Contraction and Revision Zhiqiang Zhuang Institute for Integrated and Intelligent Systems Griffith
More informationDescription Logics. Glossary. Definition
Title: Description Logics Authors: Adila Krisnadhi, Pascal Hitzler Affil./Addr.: Wright State University, Kno.e.sis Center 377 Joshi Research Center, 3640 Colonel Glenn Highway, Dayton OH 45435, USA Phone:
More informationA Fuzzy Description Logic
From: AAAI-98 Proceedings. Copyright 1998, AAAI (www.aaai.org). All rights reserved. A Fuzzy Description Logic Umberto Straccia I.E.I - C.N.R. Via S. Maria, 46 I-56126 Pisa (PI) ITALY straccia@iei.pi.cnr.it
More informationAlgebraic Tableau Reasoning for the Description Logic SHOQ
Algebraic Tableau Reasoning for the Description Logic SHOQ Jocelyne Faddoul and Volker Haarslev Department of Computer Science and Software Engineering, Concordia University, 1455 de Maisonneuve Blvd.
More informationA System for Learning GCI Axioms in Fuzzy Description Logics
A System for Learning GCI Axioms in Fuzzy Description Logics Francesca A. Lisi 1 and Umberto Straccia 2 1 Dipartimento di Informatica, Università degli Studi di Bari Aldo Moro, Italy francesca.lisi@uniba.it
More informationDecidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms
Proc. 23rd Int. Workshop on Description Logics (DL2010), CEUR-WS 573, Waterloo, Canada, 2010. Decidability of Description Logics with Transitive Closure of Roles in Concept and Role Inclusion Axioms Chan
More informationI N F S Y S R E S E A R C H R E P O R T AN OVERVIEW OF UNCERTAINTY AND VAGUENESS IN DESCRIPTION LOGICS INSTITUT FÜR INFORMATIONSSYSTEME
I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ARBEITSBEREICH WISSENSBASIERTE SYSTEME AN OVERVIEW OF UNCERTAINTY AND VAGUENESS IN DESCRIPTION LOGICS FOR THE SEMANTIC WEB THOMAS
More informationComplexity Sources in Fuzzy Description Logic
Complexity Sources in Fuzzy Description Logic Marco Cerami 1, and Umberto Straccia 2 1 Palacký University in Olomouc, Czech Republic marco.cerami@upol.cz 2 ISTI-CNR, Pisa, Italy umberto.straccia@isti.cnr.it
More informationOn Axiomatic Rejection for the Description Logic ALC
On Axiomatic Rejection for the Description Logic ALC Hans Tompits Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Joint work with Gerald Berger Context The
More informationCompleting Description Logic Knowledge Bases using Formal Concept Analysis
Completing Description Logic Knowledge Bases using Formal Concept Analysis Franz Baader 1, Bernhard Ganter 1, Ulrike Sattler 2 and Barış Sertkaya 1 1 TU Dresden, Germany 2 The University of Manchester,
More informationarxiv: v2 [cs.lo] 21 Jul 2014
ExpTime Tableaux with Global Caching for the Description Logic SHOQ Linh Anh Nguyen 1,2 and Joanna Golińska-Pilarek 3 1 Institute of Informatics, University of Warsaw Banacha 2, 02-097 Warsaw, Poland nguyen@mimuw.edu.pl
More informationRestricted role-value-maps in a description logic with existential restrictions and terminological cycles
Restricted role-value-maps in a description logic with existential restrictions and terminological cycles Franz Baader Theoretical Computer Science, Dresden University of Technology D-01062 Dresden, Germany
More informationNonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking
Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking Jaromír Malenko and Petr Štěpánek Charles University, Malostranske namesti 25, 11800 Prague, Czech Republic, Jaromir.Malenko@mff.cuni.cz,
More informationComplexities of Horn Description Logics
Complexities of Horn Description Logics MARKUS KRÖTZSCH Department of Computer Science, University of Oxford, United Kingdom SEBASTIAN RUDOLPH Institute AIFB, Karlsruhe Institute of Technology, Germany
More informationLTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07
Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity
More informationStructured Descriptions & Tradeoff Between Expressiveness and Tractability
5. Structured Descriptions & Tradeoff Between Expressiveness and Tractability Outline Review Expressiveness & Tractability Tradeoff Modern Description Logics Object Oriented Representations Key Representation
More informationDecidability of SHI with transitive closure of roles
1/20 Decidability of SHI with transitive closure of roles Chan LE DUC INRIA Grenoble Rhône-Alpes - LIG 2/20 Example : Transitive Closure in Concept Axioms Devices have as their direct part a battery :
More informationAdaptive ALE-TBox for Extending Terminological Knowledge
Adaptive ALE-TBox for Extending Terminological Knowledge Ekaterina Ovchinnikova 1 and Kai-Uwe Kühnberger 2 1 University of Tübingen, Seminar für Sprachwissenschaft e.ovchinnikova@gmail.com 2 University
More informationHigh Performance Absorption Algorithms for Terminological Reasoning
High Performance Absorption Algorithms for Terminological Reasoning Ming Zuo and Volker Haarslev Concordia University, Montreal, Quebec, Canada {ming zuo haarslev}@cse.concordia.ca Abstract When reasoning
More informationRevising General Knowledge Bases in Description Logics
Revising General Knowledge Bases in Description Logics Zhe Wang and Kewen Wang and Rodney Topor Griffith University, Australia Abstract Revising knowledge bases (KBs) in description logics (DLs) in a syntax-independent
More informationINTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION
INTEGRITY CONSTRAINTS FOR THE SEMANTIC WEB: AN OWL 2 DL EXTENSION By Jiao Tao A Thesis Submitted to the Graduate Faculty of Rensselaer Polytechnic Institute in Partial Fulfillment of the Requirements for
More informationFuzzy description logics with general t-norms and datatypes
Fuzzy Sets and Systems 160 (2009) 3382 3402 www.elsevier.com/locate/fss Fuzzy description logics with general t-norms and datatypes Fernando Bobillo a,, Umberto Straccia b a Department of Computer Science
More informationAll Elephants are Bigger than All Mice
Wright State University CORE Scholar Computer Science and Engineering Faculty Publications Computer Science & Engineering 5-2008 All Elephants are Bigger than All Mice Sebastian Rudolph Markus Krotzsch
More informationUncertainty and Rule Extensions to Description Logics and Semantic Web Ontologies
TMRF e-book Advances in Semantic Computing (Eds. Joshi, Boley & Akerkar), Vol. 2, pp 1 22, 2010 Chapter 1 Uncertainty and Rule Extensions to Description Logics and Semantic Web Ontologies Jidi Zhao 1 Abstract
More informationDescription Logics. an introduction into its basic ideas
Description Logics an introduction into its basic ideas A. Heußner WS 2003/2004 Preview: Basic Idea: from Network Based Structures to DL AL : Syntax / Semantics Enhancements of AL Terminologies (TBox)
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Wolfram Burgard, Maren Bennewitz, and Marco Ragni Albert-Ludwigs-Universität Freiburg Contents 1 Agents
More informationApplied Logic. Lecture 1 - Propositional logic. Marcin Szczuka. Institute of Informatics, The University of Warsaw
Applied Logic Lecture 1 - Propositional logic Marcin Szczuka Institute of Informatics, The University of Warsaw Monographic lecture, Spring semester 2017/2018 Marcin Szczuka (MIMUW) Applied Logic 2018
More informationFoundations of Artificial Intelligence
Foundations of Artificial Intelligence 7. Propositional Logic Rational Thinking, Logic, Resolution Joschka Boedecker and Wolfram Burgard and Bernhard Nebel Albert-Ludwigs-Universität Freiburg May 17, 2016
More informationKnowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):
Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building
More informationRole Conjunctions in Expressive Description Logics
Role Conjunctions in Expressive Description Logics Birte Glimm and Yevgeny Kazaov Abstract. We show that adding role conjunctions to the prominent DLs SHIF and SHOIN causes a jump in the computational
More informationDescription Logics (DLs)
OWL Three species of OWL OWL full is union of OWL syntax and RDF (Undecidable) OWL DL restricted to FOL fragment (decidable in NEXPTIME) OWL Lite is easier to implement subset of OWL DL (decidable in EXPTIME)
More informationExtended Decision Procedure for a Fragment of HL with Binders
Extended Decision Procedure for a Fragment of HL with Binders Marta Cialdea Mayer Università di Roma Tre, Italy This is a draft version of a paper appearing on the Journal of Automated Reasoning. It should
More informationRevision of DL-Lite Knowledge Bases
Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs).
More informationA Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes
A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes Franz Baader, Stefan Borgwardt, and Barbara Morawska {baader,stefborg,morawska}@tcs.inf.tu-dresden.de Theoretical Computer
More informationUncertainty in Description Logics: a Lattice-based Approach
Uncertainty in Description Logics: a Lattice-based Approach Umberto Straccia ISTI-CNR Via G. Moruzzi 1, I-56124 Pisa ITALY Umberto.Straccia@isti.cnr.it Abstract It is generally accepted that knowledge
More informationArtificial Intelligence. Propositional logic
Artificial Intelligence Propositional logic Propositional Logic: Syntax Syntax of propositional logic defines allowable sentences Atomic sentences consists of a single proposition symbol Each symbol stands
More informationAn Introduction to Fuzzy & Annotated Semantic Web Languages
An Introduction to Fuzzy & Annotated Semantic Web Languages arxiv:1811.05724v1 [cs.ai] 14 Nov 2018 Umberto Straccia ISTI - CNR, Pisa, ITALY umberto.straccia@isti.cnr.it Abstract We present the state of
More informationComplexities of Horn Description Logics
Complexities of Horn Description Logics MARKUS KRÖTZSCH Department of Computer Science, University of Oxford, United Kingdom SEBASTIAN RUDOLPH Institute AIFB, Karlsruhe Institute of Technology, Germany
More informationInverting Proof Systems for Secrecy under OWA
Inverting Proof Systems for Secrecy under OWA Giora Slutzki Department of Computer Science Iowa State University Ames, Iowa 50010 slutzki@cs.iastate.edu May 9th, 2010 Jointly with Jia Tao and Vasant Honavar
More informationRepresenting Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations
Representing Uncertain Concepts in Rough Description Logics via Contextual Indiscernibility Relations Nicola Fanizzi 1, Claudia d Amato 1, Floriana Esposito 1, and Thomas Lukasiewicz 2,3 1 LACAM Dipartimento
More informationAdding ternary complex roles to ALCRP(D)
Adding ternary complex roles to ALCRP(D) A.Kaplunova, V. Haarslev, R.Möller University of Hamburg, Computer Science Department Vogt-Kölln-Str. 30, 22527 Hamburg, Germany Abstract The goal of this paper
More informationIntroduzione alle logiche descrittive
Introduzione alle logiche descrittive I principali formalismi di KR Reti semantiche Sistemi a Frame Sistemi di Produzione FOL (First Order Logic) e vari altri linguaggi logici Logiche descrittive Le logiche
More informationLearning in Description Logics with Fuzzy Concrete Domains
Fundamenta Informaticae 140 (2015) 373 391 373 DOI 10.3233/FI-2015-1259 IOS Press Learning in Description Logics with Fuzzy Concrete Domains Francesca A. Lisi Dipartimento di Informatica Università degli
More informationComplexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes Christoph Haase 1 and Carsten Lutz 2 Abstract. We perform an exhaustive study of the complexity of subsumption
More informationContext-based defeasible subsumption for dsroiq
Context-based defeasible subsumption for dsroiq Katarina Britz CSIR-SU CAIR, Stellenbosch University South Africa abritz@sun.ac.za Ivan Varzinczak CRIL, Univ. Artois & CNRS France varzinczak@cril.fr Abstract
More informationTractable Reasoning with Bayesian Description Logics
Tractable Reasoning with Bayesian Description Logics Claudia d Amato 1, Nicola Fanizzi 1, and Thomas Lukasiewicz 2, 3 1 Dipartimento di Informatica, Università degli Studi di Bari Campus Universitario,
More informationTeil III: Wissensrepräsentation und Inferenz. Kap.11: Beschreibungslogiken
Vorlesung Künstliche Intelligenz Wintersemester 2006/07 Teil III: Wissensrepräsentation und Inferenz Kap.11: Beschreibungslogiken Mit Material von Carsten Lutz, Uli Sattler: http://www.computationallogic.org/content/events/iccl-ss-
More informationLightweight Description Logics: DL-Lite A and EL ++
Lightweight Description Logics: DL-Lite A and EL ++ Elena Botoeva 1 KRDB Research Centre Free University of Bozen-Bolzano January 13, 2011 Departamento de Ciencias de la Computación Universidad de Chile,
More informationInconsistencies, Negations and Changes in Ontologies
Inconsistencies, Negations and Changes in Ontologies Giorgos Flouris 1 Zhisheng Huang 2,3 Jeff Z. Pan 4 Dimitris Plexousakis 1 Holger Wache 2 1 Institute of Computer Science, FORTH, Heraklion, Greece emails:
More information