Paraconsistent disjunctive deductive databases

V. S. Subrahmanian*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

25 Scopus citations

Abstract

Databases and knowledge bases could be inconsistent in many ways. The semantical characterization of deductive databases that contain disjunctive or indefinite information has been investigated by Minker and his co-workers (1982, 1987, 1988) and by Henschen and his co-workers (1985, 1988). In both cases, there is one salient feature: the databases are assumed to consist of sentences of the form: A1 ∨ ⋯ ∨, An ← B1&⋯&Bm, where each Ai and each Bj is an atom and n≥ 1. Thus, the database is implicitly assumed to be consistent (it is easy to construct a model for any set of such formulas). What we study here is a method for reasoning about such databases when they are not necessarily consistent. Intuitively, this occurs when the Ai's are restricted not just to atomic formulas, but also to negated atoms. We use the device of annotated atoms introduced by Blair and Subrahmanian (1987, 1988) to achieve this effect. Our semantics is closely related to the existing work of Newton da Costa (1974-1987), whose pioneering work on paraconsistency provides the semantical basis for our formal development.

Original languageEnglish (US)
Pages (from-to)115-141
Number of pages27
JournalTheoretical Computer Science
Volume93
Issue number1
DOIs
StatePublished - Feb 3 1992
Externally publishedYes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint

Dive into the research topics of 'Paraconsistent disjunctive deductive databases'. Together they form a unique fingerprint.

Cite this