Introduction

Preliminaries
The Reasoner
Conclusions

A C++ Reasoner for the description logic DL4,

D

Domenico Cantone Marianna Nicolosi-Asmundo

Daniele Francesco Santamaria

Department of Mathematics and Computer Science, University of Catania

CILC 2017 - Naples, September 26, 2017

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 1 / 21

 Introduction
Preliminaries
The Reasoner
Conclusions

Contents

1 Introduction Phase I
Overview Phase II
2 Preliminaries Phase III
4LQS R Phase IV
DL4,
D
4 Conclusions
3 The Reasoner Future works
Overview Page of the project

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 2 / 21

 Introduction
Preliminaries
Overview
The Reasoner
Conclusions

Introduction

Computable set theory for knowledge representation.

The set-theoretic fragment 4LQS R .
DL4, R
D : a description logic representable in 4LQS .
A C++ reasoner for DL4,
D and examples.
Hints of future work.

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 3 / 21

 Introduction
Preliminaries 4LQS R
4,
The Reasoner DLD
Conclusions

Syntax of 4LQS R

(i) variables of sort 0: x, y , z, . . .

(ii) variables of sort 1: X 1 , Y 1 , Z 1 , . . .
(iii) variables of sort 2: X 2 , Y 2 , Z 2 , . . .
(iv) variables of sort 3: X 3 , Y 3 , Z 3 , . . .

Predicate symbols = and

Pairing operator h, i
4LQS quantifier-free atomic formulae
level 0: x = y, x X 1, hx, y i = X 2 , hx, y i X 3 ,
level 1: X 1 = Y 1, X 1 X 2,
level 2: X 2 = Y 2, X 2 X 3.

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 4 / 21

 Introduction
Preliminaries 4LQS R
4,
The Reasoner DLD
Conclusions

Syntax of 4LQS R
4LQS R purely universal formulae
level 1: (z1 ) . . . (zn )0 , 0 propositional combination of
level 0 quantifier-free atomic formulae;
level 2: (Z11 ) . . . (Zm1 )1 , 1 propositional combination of
quantifier-free atomic formulae of levels 0 and 1 and
of purely universal formulae of level 1;
level 3: (Z12 ) . . . (Zp2 )2 , 2 propositional combination of
quantifier-free atomic formulae of any level and of
purely universal formulae of levels 1 and 2.
4LQS R -Formulae
Propositional combinations of quantifier-free atomic formulae of
levels 0, 1, 2, and of purely universal formulae of levels 1, 2, 3.
Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 5 / 21
 Introduction
Preliminaries 4LQS R
4,
The Reasoner DLD
Conclusions

The Description Logic DL4,

D

Existential quantification and at-least number restriction

(resp., universal quantification and at-most number
restriction) only on the left- (resp., right-) hand side of
inclusion axioms.
More liberal than SROIQ(D) in:
construction of role inclusion axioms (roles involved not
subject to any ordering relationship),
simple roles are not needed to define role inclusion axioms and
axioms involving number restrictions,
Boolean operators on roles are admitted.
Derived datatypes (inside inclusion axioms involving concrete
roles).

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 6 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Overview

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 7 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase I: Example

Phase I: reading a compatible OWL ontology.

KB = ({ Kid Person u VeryYoung}, {Person(Ann)})

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 8 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase I: Example

Phase I: a suitable mapping function is applied to KB thus

yielding the 4LQS R representation KB of KB

1 1
KB = (x)(((x XKid ) x XPerson )
1 1
((x XKid ) x XVeryYoung )
1 1 1
((x XPerson ) (x XVeryYoung ) x XKid ))
1
xAnn XPerson .

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 9 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase I: Example

Phase I: KB is converted in conjunctive normal form,

universal quantifiers are moved as inward as possible, and
universally quantified variables are renamed so as to make
them pairwise distinct thus yielding the 4LQS R -formula KB .

1 1
KB =(x)(((x XKid ) x XPerson )
1 1
(y )((y XKid ) y XVeryYoung )
1 1 1
(z)((z XPerson ) (z XVeryYoung ) z XKid ))
1
xAnn XPerson .

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 10 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase I: Example
Phase I: computing the internal representation of KB

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 11 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase II: Example

Phase II: computing the expansion KB of KB that is the

collection of disjunctions of 4LQS R -quantifier-free atomic
formulae of level 0.

1 1 1
KB ={(xA XPerson ) (xAnn XVeryYoung ) xAnn XKid ,
1 1
(xAnn XKid ) xAnn XPerson ,
1 1
(xAnn XKid ) xAnn XVeryYoung ,
1
xAnn XPerson .

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 12 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase II: Example

Phase II: computing the expansion KB of KB that is the

collection of disjunctions of 4LQS R -quantifier-free atomic
formulae of level 0.

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 13 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase III: Example

The initial KE-tableau TKB computed by is constituted by the

set of formulae KB .
TKB is expanded by systematically applying the E-Rule and
the PB-Rule to formulae of type 1 . . . n till all
-formulae have been analysed.
In case of formulae of type x = y , for each open complete
branch the equivalence set of x and y is computed.

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 14 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Expansion rules

1 . . . n Si
E-Rule PB-Rule
i A | A

where with A a literal

Si := { 1 , ..., n } \ { i }
i = 1, ..., n

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 15 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase III: Example

1 )x
(xAnn XKid 1
Ann XPerson

1 )x
(xAnn XKid 1
Ann XVeryYoung

1
(xAnn XPerson 1
) (xAnn XVeryYoung 1
) xAnn XKid

1
xAnn XPerson

PB-Rule
1
xAnn XVeryYoung 1
(xAnn XVeryYoung )

E-Rule E-Rule
xAnn 1
XKid 1 )
(xAnn XKid
Complete Complete
Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 16 / 21
 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase III: Example

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 17 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase IV: Example

Computing for each open complete branch the equivalent

classes for the individuals involved in formulae of type x = y
and checking for inconsistency.

KB 2 = ({Person(Ann), Person(Paul), Person(John), Person(Carl),

Annet 6= Ann, Ann = Anna, Paul = Paolo, Carl = Carlo})

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 18 / 21

 Overview
Introduction
Phase I
Preliminaries
Phase II
The Reasoner
Phase III
Conclusions
Phase IV

Phase IV: Example

TKB2 . Equivalence classes for TKB2 .

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 19 / 21

 Introduction
Preliminaries Future works
The Reasoner Page of the project
Conclusions

Future works

Reading OWL ontologies.

Efficiency of expansion.
Benchmarking and comparison.
HOCQA procedure implementation.
Plug-in for Protege.

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 20 / 21

 Introduction
Preliminaries Future works
The Reasoner Page of the project
Conclusions

Page of the project

https://github.com/dfsantamaria/DL4xD-Reasoner

Cantone, Nicolosi-Asmundo, Santamaria CILC 2017 - Naples, September 26, 2017 21 / 21