Paraconsistent Logic Programming
Paraconsistent Logic Programming
复制标题
次一致逻辑编程
DOI：
10.1016/0304-3975(89)90126-6
复制
发表时间：
1987
期刊：
影响因子：
--
通讯作者：
V. S. Subrahmanian
中科院分区：
文献类型：
--
作者：
H. A. Blair;V. S. Subrahmanian
本文有两个贡献。首先，我们给出了句法形式L 0 L 1 & L 1 & L n的子句集的语义，其中每个L i是文字。我们一般把这样的条款称为霍恩条款。任何这样的努力都必须对不一致性给予连贯的、形式化的处理（在二值逻辑的意义上）。因此，作为第二个贡献，我们给出了一个强大的语义一般霍恩程序，使我们能够“有意义”的集合一般霍恩条款是不一致的（在二值逻辑意义上）。这适用于设计非常大的知识库，其中经常存在不一致的信息。
This paper makes two contributions. First, we give a semantics for sets of clauses of the syntactic form L 0⇍ L 1 &⋯ & L n where each L i 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.