Expanding queries to incomplete databases by interpolating general logic programs

Chitta Baral, Michael Gelfond, Olga Kosheleva

Research output: Contribution to journalArticle

6 Citations (Scopus)

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
StatePublished - Jun 1998
Externally publishedYes

Fingerprint

Logic Programs
Query
Syntactics
Interpolation
Specifications
Express
Interpolate
Specification

ASJC Scopus subject areas

  • Logic

Cite this

Expanding queries to incomplete databases by interpolating general logic programs. / Baral, Chitta; Gelfond, Michael; Kosheleva, Olga.

In: Journal of Logic Programming, Vol. 35, No. 3, 06.1998, p. 195-230.

Research output: Contribution to journalArticle

Baral, Chitta ; Gelfond, Michael ; Kosheleva, Olga. / Expanding queries to incomplete databases by interpolating general logic programs. In: Journal of Logic Programming. 1998 ; Vol. 35, No. 3. pp. 195-230.
@article{455b6bceb2a54028b68676761323ba12,
title = "Expanding queries to incomplete databases by interpolating general logic programs",
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.",
author = "Chitta Baral and Michael Gelfond and Olga Kosheleva",
year = "1998",
month = "6",
language = "English (US)",
volume = "35",
pages = "195--230",
journal = "Journal of Logic Programming",
issn = "1567-8326",
publisher = "Elsevier Inc.",
number = "3",

}

TY - JOUR

T1 - Expanding queries to incomplete databases by interpolating general logic programs

AU - Baral, Chitta

AU - Gelfond, Michael

AU - Kosheleva, Olga

PY - 1998/6

Y1 - 1998/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0032097629&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032097629&partnerID=8YFLogxK

M3 - Article

VL - 35

SP - 195

EP - 230

JO - Journal of Logic Programming

JF - Journal of Logic Programming

SN - 1567-8326

IS - 3

ER -