Expanding queries to incomplete databases by interpolating general logic programs

Chitta Baral, Michael Gelfond, Olga Kosheleva

Research output: Contribution to journalArticle

6 Scopus citations

Abstract

In databases, queries are usually defined on complete databases. In this paper we introduce and motivate the notion of extended queries that are defined on incomplete databases. We argue that the language of extended logic program is appropriate for representing extended queries. We show through examples that given a query, a particular extension of it has important characteristics which corresponds to removal of the CWA from the original specification of the query. We refer to this particular extension as the expansion of the original query. Normally queries are expressed as general logic programs. We develop an algorithm that given a general logic program (satisfying certain syntactic properties) expressing a query constructs an extended logic program that expresses the expanded query. The extended logic program is referred to as the interpolation of the given general logic program.

Original languageEnglish (US)
Pages (from-to)195-230
Number of pages36
JournalJournal of Logic Programming
Volume35
Issue number3
DOIs
StatePublished - Jun 1998
Externally publishedYes

ASJC Scopus subject areas

  • Logic

Fingerprint Dive into the research topics of 'Expanding queries to incomplete databases by interpolating general logic programs'. Together they form a unique fingerprint.

  • Cite this