## Bilattices In Logic Programming (1990)

Citations: | 42 - 4 self |

### BibTeX

@MISC{Fitting90bilatticesin,

author = {Melvin Fitting},

title = {Bilattices In Logic Programming},

year = {1990}

}

### Years of Citing Articles

### OpenURL

### Abstract

Bilattices, introduced by M. Ginsberg, constitute an elegant family of multiple-valued logics. Those meeting certain natural conditions have provided the basis for the semantics of a family of logic programming languages. Now we consider further restrictions on bilattices, to narrow things down to logic programming languages that can, at least in principle, be implemented. Appropriate bilattice background information is presented, so the paper is relatively self-contained. 1 Introduction Logic programming is more than just Prolog. It is a distinctive way of thinking about computers and programming that has led to the creation of a whole family of programming languages, mostly experimental. Some time ago I found that bilattices provided a uniform semantics for a rich and interesting group of logic programming languages [9]. Bilattices are a natural generalization of classical two-valued logic, and were introduced by Matt Ginsberg in [12], and more fully in [13]. Recently I have found t...