Query answering via modal definability with FaCT++: First blood

S. Kikot; D. Tsarkov; M. Zakharyaschev; E. Zolin

Query answering via modal definability with FaCT++: First blood

S. Kikot, D. Tsarkov, M. Zakharyaschev, E. Zolin

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

Abstract

We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without c ycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.

Original language	English
Title of host publication	CEUR Workshop Proceedings\|CEUR Workshop Proc.
Publisher	RWTH Aachen University
Pages	328-340
Number of pages	12
Volume	1014
Publication status	Published - 2013
Event	26th International Workshop on Description Logics, DL 2013 - Ulm Duration: 1 Jul 2013 → … http://ceur-ws.org/Vol-1035/iswc2013_poster_25.pdf

Conference

Conference	26th International Workshop on Description Logics, DL 2013
City	Ulm
Period	1/07/13 → …
Internet address	http://ceur-ws.org/Vol-1035/iswc2013_poster_25.pdf

Cite this

@inproceedings{ffc3ed9ca04a4f2bb9eed25f601f33a7,

title = "Query answering via modal definability with FaCT++: First blood",

abstract = "We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without c ycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.",

author = "S. Kikot and D. Tsarkov and M. Zakharyaschev and E. Zolin",

year = "2013",

language = "English",

volume = "1014",

pages = "328--340",

booktitle = "CEUR Workshop Proceedings|CEUR Workshop Proc.",

publisher = "RWTH Aachen University",

address = "Germany",

note = "26th International Workshop on Description Logics, DL 2013 ; Conference date: 01-07-2013",

url = "http://ceur-ws.org/Vol-1035/iswc2013_poster_25.pdf",

}

TY - GEN

T1 - Query answering via modal definability with FaCT++: First blood

AU - Kikot, S.

AU - Tsarkov, D.

AU - Zakharyaschev, M.

AU - Zolin, E.

PY - 2013

Y1 - 2013

N2 - We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without c ycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.

AB - We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without c ycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.

M3 - Conference contribution

VL - 1014

SP - 328

EP - 340

BT - CEUR Workshop Proceedings|CEUR Workshop Proc.

PB - RWTH Aachen University

T2 - 26th International Workshop on Description Logics, DL 2013

Y2 - 1 July 2013

ER -

Query answering via modal definability with FaCT++: First blood

Abstract

Conference

Fingerprint

Cite this