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

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

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
    Title of host publicationCEUR Workshop Proceedings|CEUR Workshop Proc.
    PublisherRWTH Aachen University
    Pages328-340
    Number of pages12
    Volume1014
    Publication statusPublished - 2013
    Event26th International Workshop on Description Logics, DL 2013 - Ulm
    Duration: 1 Jul 2013 → …
    http://ceur-ws.org/Vol-1035/iswc2013_poster_25.pdf

    Conference

    Conference26th International Workshop on Description Logics, DL 2013
    CityUlm
    Period1/07/13 → …
    Internet address

    Fingerprint

    Dive into the research topics of 'Query answering via modal definability with FaCT++: First blood'. Together they form a unique fingerprint.

    Cite this