@inproceedings{abccbac656d449d1bfd6385156e9d6d3,

title = "Paraconsistent logic programming",

abstract = "This paper makes two contributions. Firstly, we give a semantics for sets of clauses of the form L0 ⇐ 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.",

author = "Blair, {Howard A.} and Subrahmanian, {V. S.}",

note = "Publisher Copyright: {\textcopyright} 1987, Springer-Verlag.; 7th Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1987 ; Conference date: 17-12-1987 Through 19-12-1987",

year = "1987",

doi = "10.1007/3-540-18625-5_59",

language = "English (US)",

isbn = "9783540186250",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "340--360",

editor = "Nori, {Kesav V.}",

booktitle = "Foundations of Software Technology and Theoretical Computer Science - 7th Conference, Proceedings",

}