Loop restricted existential rules and first-order rewritability for query answering

Vernon Asuncion; Yan Zhang; Heng Zhang; Yun Bai; Weisheng Si

Loop restricted existential rules and first-order rewritability for query answering

Vernon Asuncion, Yan Zhang, Heng Zhang, Yun Bai, Weisheng Si

Western Sydney University

Research output: Chapter in Book / Conference Paper › Conference Paper

Abstract

![CDATA[Under the language of TGDs, queries are answered against an ontology represented by a set of TGDs and an input database. In particular, given a database instance D, a finite set ∑ of TGDs, and a query q, we want to decide whether D U ∑= q. However, this problem is undecidable generally, due to the potential cyclic applications of TGDs in ∑]]

Original language	English
Title of host publication	Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 27 October- 2 November 2018, Arizona, U.S.
Publisher	AAAI
Pages	619-620
Number of pages	2
ISBN (Print)	9781577358039
Publication status	Published - 2018
Event	International Conference on Principles of Knowledge Representation and Reasoning - Duration: 1 Jan 2018 → …

Conference

Conference	International Conference on Principles of Knowledge Representation and Reasoning
Period	1/01/18 → …

Keywords

relational databases
tuple-generating dependency

Cite this

@inproceedings{84017dab89b540aa8408e081cf594870,

title = "Loop restricted existential rules and first-order rewritability for query answering",

abstract = "![CDATA[Under the language of TGDs, queries are answered against an ontology represented by a set of TGDs and an input database. In particular, given a database instance D, a finite set ∑ of TGDs, and a query q, we want to decide whether D U ∑= q. However, this problem is undecidable generally, due to the potential cyclic applications of TGDs in ∑]]",

keywords = "relational databases, tuple-generating dependency",

author = "Vernon Asuncion and Yan Zhang and Heng Zhang and Yun Bai and Weisheng Si",

year = "2018",

language = "English",

isbn = "9781577358039",

pages = "619--620",

booktitle = "Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 27 October- 2 November 2018, Arizona, U.S.",

publisher = "AAAI",

note = "International Conference on Principles of Knowledge Representation and Reasoning ; Conference date: 01-01-2018",

}

Asuncion, V , Zhang, Y, Zhang, H, Bai, Y & Si, W 2018, Loop restricted existential rules and first-order rewritability for query answering. in Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 27 October- 2 November 2018, Arizona, U.S.. AAAI, pp. 619-620, International Conference on Principles of Knowledge Representation and Reasoning, 1/01/18.

Loop restricted existential rules and first-order rewritability for query answering. / Asuncion, Vernon ; Zhang, Yan; Zhang, Heng et al.
Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 27 October- 2 November 2018, Arizona, U.S.. AAAI, 2018. p. 619-620.

Research output: Chapter in Book / Conference Paper › Conference Paper

TY - GEN

T1 - Loop restricted existential rules and first-order rewritability for query answering

AU - Asuncion, Vernon

AU - Zhang, Yan

AU - Zhang, Heng

AU - Bai, Yun

AU - Si, Weisheng

PY - 2018

Y1 - 2018

N2 - ![CDATA[Under the language of TGDs, queries are answered against an ontology represented by a set of TGDs and an input database. In particular, given a database instance D, a finite set ∑ of TGDs, and a query q, we want to decide whether D U ∑= q. However, this problem is undecidable generally, due to the potential cyclic applications of TGDs in ∑]]

AB - ![CDATA[Under the language of TGDs, queries are answered against an ontology represented by a set of TGDs and an input database. In particular, given a database instance D, a finite set ∑ of TGDs, and a query q, we want to decide whether D U ∑= q. However, this problem is undecidable generally, due to the potential cyclic applications of TGDs in ∑]]

KW - relational databases

KW - tuple-generating dependency

UR - https://hdl.handle.net/1959.7/uws:52877

M3 - Conference Paper

SN - 9781577358039

SP - 619

EP - 620

BT - Proceedings of the 16th International Conference on Principles of Knowledge Representation and Reasoning (KR 2018), 27 October- 2 November 2018, Arizona, U.S.

PB - AAAI

T2 - International Conference on Principles of Knowledge Representation and Reasoning

Y2 - 1 January 2018

ER -

Loop restricted existential rules and first-order rewritability for query answering

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this