Documente Academic
Documente Profesional
Documente Cultură
Content
DL4,×
D : a description logic representable in 4LQSR
DL . 4,×
D
Some results
MLSS×
2,m , (Cantone, Longo, Nicolosi-Asmundo 2010).
DLhMLSS×
2,m i , (Cantone, Longo, Pisasale 2010).
DLh∀π0,2 i , (Cantone, Longo, Nicolosi-Asmundo 2011).
DLh∀π0,2 i + metamodelling, (Cantone, Longo 2014).
DL4D , (Cantone, Longo, Nicolosi-Asmundo, Santamaria
2015).
DL4,×
D and the Conjunctive Query Answering problem
(Cantone, Nicolosi-Asmundo, Santamaria 2016).
DL4,×
D and the Higher-Order CQA problem (Cantone,
Nicolosi-Asmundo, Santamaria 2017).
Prototype of a DL4,×
D reasoner (Cantone, Nicolosi-Asmundo,
Santamaria 2017).
Introduction Preliminaries Reasoning Services Conclusions References
Set-theoretic fragment
level 0: x = y , x ∈ X 1 , hx, y i ∈ X 3 ,
¬(x = y ), ¬(x ∈ X 1 ), ¬(hx, y i ∈ X 3 ).
Introduction Preliminaries Reasoning Services Conclusions References
Set-theoretic fragment
4LQSR
DL - purely universally quantified formulae
4,×
D
Set-theoretic fragment
Semantics
A 4LQSR DL -interpretation M = (D, M):
4,×
D
MX 0 ∈ D,
MX 1 ∈ pow(D),
MX 3 ∈ pow(pow(pow(D))),
where X i ∈ Vari , for i = 0, 1, 3, and pow(s) the powerset of s.
Pair terms are interpreted à la Kuratowski:
Mhx, y i =Def {{Mx}, {Mx, My }}.
M |= ϕ is recursively defined over the structure of ϕ:
Literals are evaluated in a standard way.
Compound formulae: standard rules of propositional logic.
u ] |= ϕ0 , for all u~ ∈ D n .
M |= (∀z1 ) . . . (∀zn )ϕ0 iff M[~z /~
If M |= ϕ, then M a 4LQSR DL -model for ϕ.
4,×
D
interpretations.
Introduction Preliminaries Reasoning Services Conclusions References
4,×
The DL DLD
4,×
The DL DLD
4,×
The consistency problem for DLD -KBs
From DL4,×
D to 4LQSRDL 4,×
D
4,×
The consistency problem for DLD -KBs
Example:
3
φKB = ¬(hxItaly , xRome i ∈ XlocatedIn )∧
3
(∀z1 )(hz1 , z1 i ∈ XisPartOf )
3 3
∧(∀z1 )(∀z2 )(¬(hz1 , z2 i ∈ XlocatedIn ) ∨ hz1 , z2 i ∈ XisPartOf )
Introduction Preliminaries Reasoning Services Conclusions References
4,×
The consistency problem for DLD -KBs
γ
KE -tableau
4,×
The consistency problem for DLD -KBs
4,×
The consistency problem for DLD -KBs
Expansion rules
ψ S βi τ γ
E -rule PB-rule
βi τ A | A
where where A is a literal
ψ = (∀x1 ) . . . (∀xm )(β1 ∨ . . . ∨ βn ),
τ := {x1 /xo1 . . . xm /xom },
and S β i τ = Def {β 1 τ, ..., β n τ } \
{β i τ }, for i = 1, ..., n
τ is a substitution from QVar0 (ψ) = {x1 , . . . , xm } (the set of
quantified variables occurring in ψ) to Var0 (ϑ) (the set of variables
of sort 0 occurring free in ϑ).
Introduction Preliminaries Reasoning Services Conclusions References
4,×
The consistency problem for DLD -KBs
Example
Introduction Preliminaries Reasoning Services Conclusions References
4,×
The HOCQA problem for DLD
4,×
The HOCQA problem for DLD
Substitution
σ =Def {v1 /o1 , . . . , vn /on , e1 /ed1 , . . . , eg /edg , t1 /t1 , . . . , tl /tl ,
c1 /C1 , . . . , cm /Cm , r1 /R1 , . . . , rk /Rk , p1 /P1 , . . . , ph /Ph }
A substitution σ involving exactly the variables occurring in Q
4,×
is a solution for Q w.r.t. KB, if there exists a DLD -
interpretation I such that I |=D KB and I |=D Qσ.
The collection Σ of the solutions for Q w.r.t. KB is the
Higher-Order Answer Set of Q w.r.t. KB. Then the
higher-order conjunctive query answering problem for Q w.r.t.
KB consists in finding the HO answer set Σ of Q w.r.t. KB.
Let φ be a 4LQSR DL -formula and let ψ be a conjunction of
4,×
D
R
4LQSDL -literals. The HOCQA problem for ψ w.r.t. φ
4,×
D
4,×
The HOCQA problem for DLD
ϑ is extended to DL4,×
D -HO literals:
4,×
The HOCQA problem for DLD
Example
Introduction Preliminaries Reasoning Services Conclusions References
4,×
The HOCQA problem for DLD
Benchmarking
n
ΦKB =Def xa ∈ XD1 , xb ∈ XD1 , xc ∈ XD1 , xd ∈ XD1 , (∀z)(∀z1 )
o
(z ∈ XA1 ∧ hz, z1 i ∈ XP3 ∧ z1 ∈ XB1 ∧ hz, z1 i ∈ XP31 ) → z1 ∈ XC1 .
Future Works
References
Thank you