Computing minimal equivalent acyclic EL ontologies

Patrick Koopmann; Nadeschda Nikitina

Computing minimal equivalent acyclic EL ontologies

Patrick Koopmann
, Nadeschda Nikitina

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

Abstract

Computing equivalent EL-ontologies of minimal size is useful for various reasoning tasks such as uniform interpolation, ontology learning, rewriting ontologies into simpler DLs, abduction and knowledge revision. The corresponding tool support for minimising concepts and ontologies can also provide great help to ontology developers and end-users. We present a method for computing equivalent acyclic EL-ontologies of minimal size, where size is measured by number of occurrences of predicates. We applied our minimisation method to both known and generated ontologies with promising results.

Original language	English
Title of host publication	DL 2016 - Proceedings of the 29th International Workshop on Description Logics
Editors	M. Lenzerini, R. Penaloza
Publisher	CEUR Workshop Proceedings
Publication status	Published - 2016
Externally published	Yes
Event	29th International Workshop on Description Logics, DL 2016 - Cape Town, South Africa Duration: 22 Apr 2016 → 25 Apr 2016

Publication series

Name	CEUR Workshop Proceedings
ISSN (Print)	1613-0073

Conference

Conference	29th International Workshop on Description Logics, DL 2016
Country/Territory	South Africa
City	Cape Town
Period	22/04/16 → 25/04/16

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 4 Quality Education

Persistent URL (handle)

Persistent link

Cite this

@inproceedings{95d4c8648a1040f587e76826a9566165,

title = "Computing minimal equivalent acyclic EL ontologies",

abstract = "Computing equivalent EL-ontologies of minimal size is useful for various reasoning tasks such as uniform interpolation, ontology learning, rewriting ontologies into simpler DLs, abduction and knowledge revision. The corresponding tool support for minimising concepts and ontologies can also provide great help to ontology developers and end-users. We present a method for computing equivalent acyclic EL-ontologies of minimal size, where size is measured by number of occurrences of predicates. We applied our minimisation method to both known and generated ontologies with promising results.",

author = "Patrick Koopmann and Nadeschda Nikitina",

year = "2016",

language = "English",

series = "CEUR Workshop Proceedings",

publisher = "CEUR Workshop Proceedings",

editor = "M. Lenzerini and R. Penaloza",

booktitle = "DL 2016 - Proceedings of the 29th International Workshop on Description Logics",

address = "Germany",

note = "29th International Workshop on Description Logics, DL 2016 ; Conference date: 22-04-2016 Through 25-04-2016",

}

Computing minimal equivalent acyclic EL ontologies. / Koopmann, Patrick; Nikitina, Nadeschda.
DL 2016 - Proceedings of the 29th International Workshop on Description Logics. ed. / M. Lenzerini; R. Penaloza. CEUR Workshop Proceedings, 2016. (CEUR Workshop Proceedings).

Research output: Chapter in Book / Report / Conference proceeding › Conference contribution › Academic › peer-review

TY - GEN

T1 - Computing minimal equivalent acyclic EL ontologies

AU - Koopmann, Patrick

AU - Nikitina, Nadeschda

PY - 2016

Y1 - 2016

N2 - Computing equivalent EL-ontologies of minimal size is useful for various reasoning tasks such as uniform interpolation, ontology learning, rewriting ontologies into simpler DLs, abduction and knowledge revision. The corresponding tool support for minimising concepts and ontologies can also provide great help to ontology developers and end-users. We present a method for computing equivalent acyclic EL-ontologies of minimal size, where size is measured by number of occurrences of predicates. We applied our minimisation method to both known and generated ontologies with promising results.

AB - Computing equivalent EL-ontologies of minimal size is useful for various reasoning tasks such as uniform interpolation, ontology learning, rewriting ontologies into simpler DLs, abduction and knowledge revision. The corresponding tool support for minimising concepts and ontologies can also provide great help to ontology developers and end-users. We present a method for computing equivalent acyclic EL-ontologies of minimal size, where size is measured by number of occurrences of predicates. We applied our minimisation method to both known and generated ontologies with promising results.

UR - https://www.scopus.com/pages/publications/84978105971

UR - https://www.scopus.com/pages/publications/84978105971#tab=citedBy

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

BT - DL 2016 - Proceedings of the 29th International Workshop on Description Logics

A2 - Lenzerini, M.

A2 - Penaloza, R.

PB - CEUR Workshop Proceedings

T2 - 29th International Workshop on Description Logics, DL 2016

Y2 - 22 April 2016 through 25 April 2016

ER -

Computing minimal equivalent acyclic EL ontologies

Abstract

Publication series

Conference

UN SDGs

Persistent URL (handle)

Other files and links

Fingerprint

Cite this