On Referring Expressions in Query Answering over First Order Knowledge Bases

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 compile-time 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.

[1]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

[2]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[3]  Praveen Paritosh,et al.  Freebase: a collaboratively created graph database for structuring human knowledge , 2008, SIGMOD Conference.

[4]  David Toman,et al.  CFDnc: A PTIME Description Logic with Functional Constraints and Disjointness , 2013, Description Logics.

[5]  Tomasz Imielinski,et al.  Intelligent Query Answering in Rule Based Systems , 1988, J. Log. Program..

[6]  Santiago Figueira,et al.  Using Logic in the Generation of Referring Expressions , 2011, LACL.

[7]  Amihai Motro,et al.  Intensional Answers to Database Queries , 1994, IEEE Trans. Knowl. Data Eng..

[8]  David Toman,et al.  On Adding Inverse Features to the Description Logic CFD∀nc , 2014, PRICAI.

[9]  Abraham Silberschatz,et al.  Database Systems Concepts , 1997 .

[10]  Maurizio Vincini,et al.  DL Techniques for Intensional Query Answering in OODBs , 1995, KRDB.

[11]  Tomasz Imeilinski Intelligent query answering in rule based systems , 1987 .

[12]  Abraham Silberschatz,et al.  Database System Concepts , 1980 .

[13]  Alexander Koller,et al.  Referring Expressions as Formulas of Description Logic , 2008, INLG.

[14]  Ielka van der Sluis,et al.  Generation of Referring Expressions: Assessing the Incremental Algorithm , 2012, Cogn. Sci..

[15]  David Toman,et al.  Conjunctive Query Answering in ${\mathcal{CFD}}_{nc}$: A PTIME Description Logic with Functional Constraints and Disjointness , 2013 .

[16]  Ramez Elmasri,et al.  Fundamentals of Database Systems, 5th Edition , 2006 .

[17]  Diego Calvanese,et al.  Path-Based Identification Constraints in Description Logics , 2008, KR.

[18]  S. Sudarshan,et al.  Database System Concepts, 4th Edition , 2001 .

[19]  Ramez Elmasri,et al.  Fundamentals of Database Systems , 1989 .

[20]  Ramez Elmasri,et al.  Fundamentals of Database Systems, 2nd Edition , 1994 .

[21]  David Toman,et al.  Answering Queries over CFD ∀ nc Knowledge Bases , 2015 .