H. A. Blair, V. S. Subrahmanian, Paraconsistent logic programming, Proc. of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Lecture Notes in Computer Science, vol 287.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Also the two valued semantics has been extended via the device of stratification [2] See [12] and [13] for a discussion of the relationship between the stratified and the three valued approach. More recently a four valued logic has been proposed, to allow for programs containing inconsistencies [5]. Also the set of reals in [0, 1] has been used as a kind of truth value space, to allow treating confidence factors as truth values [20] And in [10] sets of possible worlds in a Kripke model were considered, as something like evidence factors. What do these approaches have in common There must ....

....In fact, for a simple, positive program P, these are the least and greatest fixed points of the well known TP operator, from [1] So the classical semantics developed for positive programs is also a special case under the bilattice approach. The bilattice FOUR is also considered in [5], though in a somewhat more restricted way, with emphasis entirely on the # t operations. That paper considers the issues of model, continuity, and operational semantics, none of which we take up here. For positive programs, both # k and # t least and greatest fixed points exist. Some easy ....

H. A. Blair, V. S. Subrahmanian, Paraconsistent logic programming, Proc. of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Lecture Notes in Computer Science, vol 287.

....approximate to the least fixed point of # P in # steps. This contrasts to the usual situation in logic programming based on # t , where programs yielding non continuous operators are easy to write, and closure ordinals can be very high. Finally we note that Q Log has a paraconsistency property [3] in the sense that inconsistencies don t make a program useless. If some query A evaluates to # with respect to a program P (using the least fixed point of # P ) other queries may still behave in reasonable ways. Inconsistencies remain isolated, unlike in classical logic. 5 Semantic Tableaux ....

H. A. Blair, V. S. Subrahmanian, Paraconsistent logic programming, Proc. of the 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Springer Lecture Notes in Computer Science, vol 287.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC