Monash University
5309887_SawangpholWudhichartPhDThesis14August2017.pdf (1.3 MB)

Constraint-based Reasoning for Description Logics with Concrete Domains and Aggregations

Download (1.3 MB)
posted on 2017-08-15, 23:40 authored by WUDHICHART SAWANGPHOL
Aggregation over concrete domains is a very natural extension to Description Logics (DLs), as it allows individuals to be organised by their physical attribute values. However, reasoning support for aggregations, such as sums, counting, or min/ max, has proved challenging, since any naive extension will immediately result in an undecidable logic. This thesis introduces a new DL with concrete domains and aggregations that has useful yet decidable reasoning tasks. It therefore enables the expression of complex phenomena involving numerical values. We show that concept satisfiability for this DL is NP-complete, and describe an implementation based on a sound and complete encoding into Constraint Programming (CP). This enables us to exploit efficient CP solvers that naturally and efficiently deal with both the abstract and concrete parts of the logic at the same time.


Campus location


Principal supervisor

Yuan-Fang Li

Additional supervisor 1

Guido Tack

Year of Award


Department, School or Centre

Information Technology (Monash University Clayton)


Doctor of Philosophy

Degree Type



Faculty of Information Technology