Checking DL-Lite modularity with QBF solvers

Kontchakov, Roman and Ryzhikov, V. and Wolter, F. and Zakharyaschev, Michael (2008) Checking DL-Lite modularity with QBF solvers. In: Baader, F. and Lutz, C. and Motik, B. (eds.) Proceedings of the 21st International Workshop on Description Logics (DL2008), Dresden, Germany, May 13-16, 2008. CEUR Workshop Proceedings 353. CEUR Workshop Proceedings.

Full text not available from this repository.

Official URL: http://ceur-ws.org/Vol-353/

Abstract

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

Metadata

Item Type:	Book Section
Additional Information:	Series ISSN: 1613-0073
School:	Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
Depositing User:	Administrator
Date Deposited:	14 Sep 2010 14:14
Last Modified:	11 Oct 2016 12:01
URI:	http://eprints.bbk.ac.uk/id/eprint/1224

Statistics

Archive Staff Only (login required)

Edit/View Item