(Enter summary)
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... (Update)
Cited by: More
Epistemic Foundation of Stable Model Semantics - Loyer, Straccia (2006)
(Correct)
Any-World Assumptions in Logic Programming - Loyer, Straccia (2005)
(Correct)
Default Knowledge in Logic Programs with Uncertainty - Yann Loyer And (2003)
(Correct)
Active bibliography (related documents): More All
1.1: Negation as Refutation - Fitting (1989)
(Correct)
1.0: Bilattices In Logic Programming - Fitting (1990)
(Correct)
0.3: Some Applications Of General Topology To The Semantics Of Logic.. - Seda (1994)
(Correct)
Similar documents based on text: More All
0.4: The Family of Stable Models - Fitting (1993)
(Correct)
0.3: Well-Founded Semantics, Generalized - Fitting (1991)
(Correct)
0.3: Logical Bilattices and Inconsistent Data - Arieli, Avron (1994)
(Correct)
Related documents from co-citation: More All
38: A useful four-valued logic (context) - Belnap - 1977
34: Multivalued logics: A uniform approach to reasoning in artificial intelligence (context) - Ginsberg - 1988
27: Theory of generalized annotated logic programming and its applications
- Kifer, Subrahmanian - 1992
BibTeX entry: (Update)
M. Fitting. Bilattices and the semantics of logic programming. Journal of Logic Programming, 11(1--2):91--116, 1991. http://citeseer.ist.psu.edu/fitting89bilattices.html More
@article{ fitting91bilattices,
author = "Melvin Fitting",
title = "Bilattices and the Semantics of Logic Programming",
journal = "Journal of Logic Programming",
volume = "11",
number = "1&2",
pages = "91-116",
year = "1991",
url = "citeseer.ist.psu.edu/fitting89bilattices.html" }
Citations (may not include all citations):
258
A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
248
The Semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
186
Negation in logic programming (context) - Kunen - 1987 ACM DBLP
82
Signed data dependencies in logic programs (context) - Kunen ACM DBLP
42
Quantitative deduction and its fixpoint theory (context) - van Emden - 1986 ACM DBLP
32
Multivalued Logics: A Uniform Approach to Inference in Artif..
- Ginsberg
31
Logic programming on a topological bilattice (context) - Fitting - 1988
26
Multi-valued logics (context) - Ginsberg - 1986
23
Negation as refutation
- Fitting - 1989
22
Theoretical Computer Science (context) - Fitting, models et al. - 1986
15
Stratified and three-valued logic programming semantics
- Fitting, Ben-Jacob - 1988 DBLP
13
Kleene semantics for logic programs (context) - Fitting, Kripke - 1985
7
and Logic Programming (context) - Fitting, Theory - 1987
6
Four valued semantics and the liar (context) - Visser - 1984
4
Introduction to Methmathematics (context) - Kleene - 1950
3
A Logic programming semantics scheme (context) - Blair, Brown et al. - 1988
2
weak stratified and three-valued semantics (context) - Fitting, Ben-Jacob
2
Springer Lecture Notes in Computer Science (context) - Blair, Subrahmanian et al.
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://math240.lehman.cuny.edu/fitting/bookspapers/logprog.html):
Negation as Refutation - Fitting (1989)
(Correct)
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