Bilattices and the Semantics of Logic Programming (1989)
Cached
Download Links
- [math240.lehman.cuny.edu]
- [comet.lehman.cuny.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 347 - 13 self |
BibTeX
@MISC{Fitting89bilatticesand,
author = {Melvin Fitting},
title = {Bilattices and the Semantics of Logic Programming},
year = {1989}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's four-valued logic, based on classical two-valued logic. Among other examples are those based on finite many-valued logics, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical two-valued setting, but the result provides a natural semantics for distributed logic programs, including those involving confidence factors. The classical two-valued and the Kripke/Kleene three-valued semantics become special cases, since the logics involved are natural sublogics of Belnap's logic, the logic given by the simplest bilattice. 1 Introduction Often useful information is spread over a number of sites ("Does anybody know, did Willie wear a hat when he left this morning?") that can be speci...
