Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs

Kevin Lee; Thomas  Meyer; Jeff Z Pan

Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs

Kevin Lee, Thomas Meyer, Jeff Z Pan

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract / Description of output

Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during the expansion process. Our work is closely related to that of [1], which considered the same problem for assertional (Abox) statements only, and [2], which deals only with unfoldable terminologies for ALC.

Original language	English
Title of host publication	Proceedings of the 2006 International Workshop on Description Logics
Editors	Bijan Parsia, Ulrike Sattler, David Toman
Publisher	CEUR-WS.org
Pages	253-254
Number of pages	2
Publication status	Published - 23 Jun 2006
Event	2006 International Workshop on Description Logics - Lake District, United Kingdom Duration: 30 May 2006 → 1 Jun 2006 http://dl.kr.org/dl2006/

Publication series

Name	CEUR Workshop Proceedings
Publisher	CEUR-WS.org
Volume	189
ISSN (Electronic)	1613-0073

Conference

Conference	2006 International Workshop on Description Logics
Abbreviated title	DL 2006
Country/Territory	United Kingdom
City	Lake District
Period	30/05/06 → 1/06/06
Internet address	http://dl.kr.org/dl2006/

Access to Document

http://ceur-ws.org/Vol-189/submission_29.pdfLicence: All Rights Reserved

Cite this

@inproceedings{5c67ec92e48e47669897ff68c7dde4c2,

title = "Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs",

abstract = "Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during the expansion process. Our work is closely related to that of [1], which considered the same problem for assertional (Abox) statements only, and [2], which deals only with unfoldable terminologies for ALC.",

author = "Kevin Lee and Thomas Meyer and Pan, {Jeff Z}",

year = "2006",

month = jun,

day = "23",

language = "English",

series = "CEUR Workshop Proceedings",

publisher = "CEUR-WS.org",

pages = "253--254",

editor = "Bijan Parsia and Ulrike Sattler and David Toman",

booktitle = "Proceedings of the 2006 International Workshop on Description Logics",

note = "2006 International Workshop on Description Logics<br/>, DL 2006 ; Conference date: 30-05-2006 Through 01-06-2006",

url = "http://dl.kr.org/dl2006/",

}

Lee, K, Meyer, T & Pan, JZ 2006, Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs. in B Parsia, U Sattler & D Toman (eds), Proceedings of the 2006 International Workshop on Description Logics. CEUR Workshop Proceedings, vol. 189, CEUR-WS.org, pp. 253-254, 2006 International Workshop on Description Logics
, Lake District, United Kingdom, 30/05/06. <http://ceur-ws.org/Vol-189/submission_29.pdf>

Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs. / Lee, Kevin; Meyer, Thomas ; Pan, Jeff Z.
Proceedings of the 2006 International Workshop on Description Logics. ed. / Bijan Parsia; Ulrike Sattler; David Toman. CEUR-WS.org, 2006. p. 253-254 (CEUR Workshop Proceedings; Vol. 189).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs

AU - Lee, Kevin

AU - Meyer, Thomas

AU - Pan, Jeff Z

PY - 2006/6/23

Y1 - 2006/6/23

N2 - Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during the expansion process. Our work is closely related to that of [1], which considered the same problem for assertional (Abox) statements only, and [2], which deals only with unfoldable terminologies for ALC.

AB - Existing description logic reasoners provide the means to detect logical errors in ontologies, but lack the capability to resolve them. We present a tableaubased algorithm for computing maximally satisfiable terminologies in ALC. Our main contribution is the ability of the algorithm to handle GCIs, using a refined blocking condition that ensures termination is achieved at the right point during the expansion process. Our work is closely related to that of [1], which considered the same problem for assertional (Abox) statements only, and [2], which deals only with unfoldable terminologies for ALC.

UR - http://ceur-ws.org/Vol-189/

M3 - Conference contribution

T3 - CEUR Workshop Proceedings

SP - 253

EP - 254

BT - Proceedings of the 2006 International Workshop on Description Logics

A2 - Parsia, Bijan

A2 - Sattler, Ulrike

A2 - Toman, David

PB - CEUR-WS.org

T2 - 2006 International Workshop on Description Logics<br/>

Y2 - 30 May 2006 through 1 June 2006

ER -

Computing Maximally Satisfiable Terminologiesfor the Description Logic ALC with GCIs

Abstract / Description of output

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this