Disjunctive logic and semantics of disjunctive logic programs

In common sense reasoning with incomplete knowledge bases, conclusions are made by defaultHowever, it is observed that when the negation-by-default operator not is defined as not provable , the disjunctive logic program { a V b, not a, not b} should be consistent because a being not provable and b being nor provable does not imply a V b being riot provable. Such an observation is significant for non-monotonic reasoning, but none of the major current semantics for disjunctive logic programs is able to support it because they are all based on classical first-order logic in which assuming not a and not b implies assuming no: (a V b) A new first-order logic (disjunctive logic ) is developed that fully complies with this observation and new semantics for disjunctive logic programs are established This theory is able to formalize and solve some paradoxical problems, such as the lottery paradox     

Declarative semantics of programming in residuated lattice-valued logic

We give two generalizations of Tarski's fixpoint theorem in the setting of residuated lattices and use them to establish van Emdem-Kowalski's least fixpoint semantics for residuated lattice-valued logic programs.     

故障树的BASIC程序分析——PC-1500的应用

本文适用故障树的定性和定量分析，程序的特点是应用字符申作逻辑代数运算．从而使PC-1500的小内存解算了大问题．