Resolution-based Query Answering for Semantic Access to Relational Databases: A Research Note

We address the problem of semantic querying of relational databases (RDB) modulo knowledge bases using very expressive knowledge representation formalisms, such as full first-order logic or its various fragments. We propose to use a first-order logic (FOL) reasoner for computing schematic answers to deductive queries, with the subsequent instantiation of these schematic answers using a conventional relational DBMS. In this research note, we outline the main idea of this technique -- using abstractions of databases and constrained clauses for deriving schematic answers. The proposed method can be directly used with regular RDB, including legacy databases. Moreover, we propose it as a potential basis for an efficient Web-scale semantic search technology.

[1]  Gerd Wagner,et al.  Design Rationale for RuleML: A Markup Language for Semantic Web Rules , 2001, SWWS.

[2]  Jeff Heflin,et al.  An Evaluation of Knowledge Base Systems for Large OWL Datasets , 2004, SEMWEB.

[3]  Diego Calvanese,et al.  DL-Lite: Tractable Description Logics for Ontologies , 2005, AAAI.

[4]  Peishen Qi,et al.  Ontology Translation on the Semantic Web , 2003, OTM.

[5]  Ian Horrocks,et al.  The Instance Store: Description Logic Reasoning with Large Numbers of Individuals , 2004 .

[6]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[7]  Diego Calvanese,et al.  MASTRO-I: Efficient Integration of Relational Data through DL Ontologies , 2007, Description Logics.

[8]  Radoslaw Oldakowski.  D2RQ Platform – Treating Non-RDF Databases as Virtual RDF Graphs , 2011 .

[9]  Samson W. Tu,et al.  Using Semantic Web Technologies for Knowledge-Driven Querying of Biomedical Data , 2007, AIME.

[10]  Peter D. Karp,et al.  Querying and computing with BioCyc databases , 2005, Bioinform..

[11]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[12]  Anand Ranganathan,et al.  Information retrieval from relational databases using semantic queries , 2006, CIKM '06.

[13]  Michael J. Maher,et al.  Constraint Logic Programming: A Survey , 1994, J. Log. Program..

[14]  Boris Motik,et al.  Reasoning in description logics using resolution and deductive databases , 2006 .

[15]  Samson W. Tu,et al.  Efficiently Querying Relational Databases Using OWL and SWRL , 2007, RR.

[16]  Edith Schonberg,et al.  Efficient reasoning on large SHIN Aboxes in relational databases , 2007 .

[17]  Journal of automated reasoning , 1986 .

[18]  Andrei Voronkov,et al.  The design and implementation of VAMPIRE , 2002, AI Commun..

[19]  Jeff Heflin,et al.  DLDB: Extending Relational Databases to Support Semantic Web Queries , 2003, PSSS.

[20]  Volker Haarslev,et al.  LAS: Extending Racer by a Large ABox Store , 2005, Description Logics.

[21]  Albert Rubio,et al.  Paramodulation-Based Theorem Proving , 2001, Handbook of Automated Reasoning.

[22]  Peishen Qi,et al.  Integrating Databases into the Semantic Web through an Ontology-Based Framework , 2006, 22nd International Conference on Data Engineering Workshops (ICDEW'06).

[23]  W. Nutt,et al.  On abduction and answer generation through constrained resolution , 1992 .

[24]  Debra T. Burhans,et al.  Defining answer classes using resolution refutation , 2007, J. Appl. Log..