TY - JOUR
T1 - On referring expressions in query answering over first order knowledge bases
AU - Borgida, Alexander
AU - Toman, David
AU - Weddell, Grant
N1 - Publisher Copyright:
Copyright © 2016, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.
PY - 2016
Y1 - 2016
N2 - A referring expression in linguistics is any noun phrase identifying an object in a way that will be useful to interlocutors. In the context of a query over a first order knowledge base K, constant symbols occurring in K are the artifacts usually used as referring expressions in certain answers to the query. In this paper, we begin to explore how this can be usefully extended by allowing a class of more general formulas, called singular referring expressions, to replace constants in this role. In particular, we lay a foundation for admitting singular referring expressions in certain answer computation for queries overK. An integral part of this foundation are characterization theorems for identification properties of singular referring expressions for queries annotated with a domain specific language for referring concept types. Finally, we apply this framework in the context of tractable description logic dialects, showing how identification properties can be determined at compiletime for conjunctive queries, and how off-the-shelf conjunctive query evaluation for these dialects can be used in query evaluations, preserving, in all cases, underlying tractability.
AB - A referring expression in linguistics is any noun phrase identifying an object in a way that will be useful to interlocutors. In the context of a query over a first order knowledge base K, constant symbols occurring in K are the artifacts usually used as referring expressions in certain answers to the query. In this paper, we begin to explore how this can be usefully extended by allowing a class of more general formulas, called singular referring expressions, to replace constants in this role. In particular, we lay a foundation for admitting singular referring expressions in certain answer computation for queries overK. An integral part of this foundation are characterization theorems for identification properties of singular referring expressions for queries annotated with a domain specific language for referring concept types. Finally, we apply this framework in the context of tractable description logic dialects, showing how identification properties can be determined at compiletime for conjunctive queries, and how off-the-shelf conjunctive query evaluation for these dialects can be used in query evaluations, preserving, in all cases, underlying tractability.
UR - http://www.scopus.com/inward/record.url?scp=85011016340&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85011016340&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:85011016340
SN - 2334-1025
SP - 319
EP - 328
JO - Proceedings of the International Conference on Knowledge Representation and Reasoning
JF - Proceedings of the International Conference on Knowledge Representation and Reasoning
T2 - 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016
Y2 - 25 April 2016 through 29 April 2016
ER -