Checking DL-Lite Modularity with QBF Solvers

R Kontchakov; Vladislav Ryzhikov; F Wolter; M Zakharyaschev

Back

Conference proceeding

Checking DL-Lite Modularity with QBF Solvers

R Kontchakov, Vladislav Ryzhikov, F Wolter and M Zakharyaschev

Proceedings of the 21st International Workshop on Description Logics (DL2008): Dresden, Germany May 13–16, 2008

CEUR Workshop Proceedings, 353

2008

Handle:

https://hdl.handle.net/10863/35142

Abstract

We show how the reasoning tasks of checking various versions of conservativity for the description logic DL-Litebool can be reduced to satisfiability of quantified Boolean formulas and how off-the-shelf QBF solvers perform on a number of typical DL-Litebool ontologies.

Files and links (1)

url

http://ceur-ws.org/Vol-353/KontchakovRyzhikovWolterZakharyaschev.pdfView

Details

Title: Checking DL-Lite Modularity with QBF Solvers
Creators: R Kontchakov
Vladislav Ryzhikov
F Wolter
M Zakharyaschev
Publication Details: Proceedings of the 21st International Workshop on Description Logics (DL2008): Dresden, Germany May 13–16, 2008
Editor(s): Baader F, Lutz C, Motik B
ISSN: 1613-0073
Series / Volume: CEUR Workshop Proceedings
353
Publisher: CEUR
Aachen
Identifiers: (UNIBZ)5407
991006493781601241
Scopus ID: n.a.
Academic Unit: Faculty of Computer Science
Language: English
Resource Type: Conference proceeding
Author Names String: Kontchakov R, Ryzhikov V, Wolter F, Zakharyaschev M
Additional Description: Editors/Supervisors: Baader F, Lutz C, Motik B

Metrics

1 Record Views