Paraconsistent logic programming

Howard A. Blair, V. S. Subrahmanian

Research output: Contribution to journalArticlepeer-review

225 Scopus citations


This paper makes two contributions. First, we give a semantics for sets of clauses of the syntactic form L0 {not implied by} L1 &⋯& Ln where each Li is a literal. We call such clauses generally Horn clauses. Any such endeavour has to give a coherent, formal treatment of inconsistency (in the sense of two-valued logic). Thus, as a second contribution, we give a robust semantics for generally Horn programs that allows us to "make sense" of sets of generally Horn clauses that are inconsistent (in the two-valued logic sense). This applies to the design of very large knowledge bases where inconsistent information is often present.

Original languageEnglish (US)
Pages (from-to)135-154
Number of pages20
JournalTheoretical Computer Science
Issue number2
StatePublished - Oct 30 1989

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Paraconsistent logic programming'. Together they form a unique fingerprint.

Cite this