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.
CITATION STYLE
Blair, H. A., & Subrahmanian, V. S. (1987). Paraconsistent logic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 287 LNCS, pp. 340–360). Springer Verlag. https://doi.org/10.1007/3-540-18625-5_59
Mendeley helps you to discover research relevant for your work.