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.
On the more theoretical side, it is necessary to mention two other connections. The idea of using constraints to represent schematic answers is borrowed from Constraint Logic Programming @cite_20 and Constrained Resolution @cite_17 . Also, the general idea of using reasoning for preprocessing expressive queries into a database-related formalism, was borrowed from @cite_10 , where a resolution- and paramodulation-based calculus is used to translate expressive DL ontologies into Disjunctive Datalog. This work also shares a starting point with ours -- the observation that reasoning methods that treat individuals data values separately can not scale up sufficiently.
@cite_10 @cite_20 @cite_17
2063727779 1598593580
Abstract Constraint Logic Programming (CLP) is a merger of two declarative paradigms: constraint solving and logic programming. Although a relatively new field, CLP has progressed in several quite different directions. In particular, the early fundamental concepts have been adapted to better serve in different areas of applications. In this survey of CLP, a primary goal is to give a systematic description of the major trends in terms of common fundamental concepts. The three main parts cover the theory, implementation issues, and programming for applications. Recently, extensions of constrained logic programming and constrained resolution for theorem proving have been introduced, that consider constraints, which are interpreted under an open world assumption. We discuss relationships between applications of these approaches for query answering in knowledge base systems on the one hand and abduction-based hypothetical reasoning on the other hand. We show both that constrained resolution can be used as an operationalization of (some limited form of) abduction and that abduction is the logical status of an answer generation process through constrained resolution, ie., it is an abductive but not a deductive form of reasoning.