You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: Birkbeck College » Outputs » Detail

Output details

11 - Computer Science and Informatics

Birkbeck College

Return to search Previous output Next output

Output 50 of 62 in the submission

Article title

Taming the Infinite Chase: Query Answering under Expressive Relational Constraints

Type

D - Journal article

DOI

10.1613/jair.3873

Title of journal

Journal of Artificial Intelligence Research

Article number

Volume number

Issue number

First page of article

115

ISSN of journal

1076-9757

Year of publication

2013

URL

Number of additional authors

Additional information

<12> This is an extended version of the paper "Taming the Infinite Chase: Query Answering under Expressive Relational Constraints" published in KR 2008, itself heavily cited in Google Scholar. This is the first paper to introduce and investigate the complexity of conjunctive query answering over ontologies formulated in terms of guarded tuple-generating dependencies and their extensions.

Interdisciplinary

Cross-referral requested

Research group

B - Information Management and Web Technologies

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract