Abstract
The notion of bilattice was introduced by Ginsberg, and further examined by Fitting, as a general framework for many applications. In the present paper we develop proof systems, which correspond to bilattices in an essential way. For this goal we introduce the notion of logical bilattices. We also show how they can be used for efficient inferences from possibly inconsistent data. For this we incorporate certain ideas of Kifer and Lozinskii, which happen to suit well the context of our work. The outcome are paraconsistent logics with a lot of desirable properties.Footnote 1
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
A preliminary version of this paper appears in Arieli and Avron (1994).
References
Arieli, O. and Avron, A., 1994 “Logical bilattices and incosistent data,” in Proc. 9th IEEE Annual Symp. on Logic in Computer Science. IEEE Press, pp. 468–476.
AndersonA.R. and BelnapN.D., 1975, Entailment. Vol. 1, Princeton, NJ: Princeton University Press.
AvronA., 1986, “On an implication connective of RM,” Notre Dame Journal of Formal Logic 27, 201–209.
AvronA., 1991a, “Simple consequence relations,” Information and Computation 92, 105–139.
AvronA., 1991b, “Natural 3-valued logics: characterization and proof theory,” Journal of Symbolic Logic 56(1), 276–294.
BarringerH., ChangJ.H., and JonesC.B., 1984, “A logic covering undefinedness in program proofs,” Acta Informatica 22, 251–269.
BelnapN.D., 1977a, “A useful four-valued logic,” in Modern Uses of Multiple-Valued Logic, G.Epstein and J.M.Dunn, eds., Dordrecht: Reidel, pp. 7–37.
BelnapN.D., 1977b, “How a computer should think,” in Contemporary Aspects of Philosophy, G.Ryle, ed., Stocksfield, England: Oriel Press, pp. 30–56.
da-CostaN.C.A., 1974, “On the theory of inconsistent formal systems,” Notre Dame Journal of Formal Logic 15 497–510.
da-Costa, N.C.A., Henschen, L.J., Lu, J.J., and Subrahmanian, V.S., 1990, “Automatic theorem proving in paraconsistent logics, theory and implementation.” in 10th Int. Conf. on Automated Deduction, M.E. Stichel, ed., pp. 72–86.
DunnJ.M., 1986, “Relevant logic and entailment,” in Handbook of Philosophical Logic, Vol. III, D.Gabbay and F.Guenthner, eds., Dordrecht: Reidel, pp. 117–224.
EpsteinR.L., 1990, The Semantic Foundation of Logic. Vol. I: Propositional Logics, Dordrecht: Kluwer Academic Publisher.
Fitting, M., 1989, “Negation as refutation,” in Proc. 4th Annual Symp. on Logic in Computer Science, IEEE Press, pp. 63–70.
Fitting, M., 1990a, “Bilattices in logic programming,” in The 20th Int. Symp. on Multiple-Valued Logic, G. Epstein, ed., IEEE Press, pp. 238–246.
FittingM., 1990b, “Kleene's logic, generalized,” Journal of Logic and Computation 1, 797–810.
FittingM., 1991, “Bilattices and the semantics of logic programming,” Journal of Logic Programming 11(2), 91–116.
FittingM., 1993, “The family of stable models,” Journal of Logic Programming 17, 197–225.
FittingM., 1994, “Kleene's three-valued logics and their children,” Fundamenta Informaticae 20, 113–131.
GabbayD.M., 1985, “Theoretical foundation for non-monotonic reasoning in expert systems,” in Proc. of the NATO Advanced Study Inst. on Logic and Models of Concurent Systems, K.P.Apt, ed., La Collesur-Loup, France: Springer-Verlag, 439–457.
GinsbergM.L., 1988, “Multivalued logics: A uniform approach to reasoning in AI,” Computer Intelligence 4, 256–316.
GirardJ.Y., 1987, “Linear logic,” Theoretical Computer Science 50, 1–101.
JonesC.B., 1986, Systematic Software Development Using VDM, Englewood Cliffs, NJ: Prentice-Hall.
KiferM. and LozinskiiE.L., 1992, “A logic for reasoning with inconsistency,” Journal of Automated Reasoning 9(2), 179–215.
KiferM. and SubrahmanianV.S., 1992, “Theory of generalized annotated programming and its applications,” Journal of Logic Programming 12, 335–367.
LehmannD., 1992, “Plausibility logic,” in Proc. of 5th Workshop on Computer Science Logic, Berlin: Springer-Verlag, pp. 227–241.
LukasiewiczJ., 1967, “On 3-valued logic,” Ruch Filosoficzny 5, 169–171, 1920. English translation: Polish Logic 1920–1939, S. McCall, ed., Oxford: Oxford University Press, pp. 15–18.
d'OttavianoI.M.L. and da-CostaN.C.A., 1970, “Sur un problème de Jáskowski,” Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences. Série A 270, 1349–1353.
d'OttavianoI.M.L., 1985, “The completeness and compactness of a three-valued First Order Logic,” Revista colombiana de matematicas XIX(1–2), 31–42.
RozonerL.I., 1989, “On interpretation of inconsistent theories,” Information Sciences 47, 243–266.
SobocínskiR., 1952, “Axiomatization of a partial system of three-value calculus of propositions,” Journal of Computing Systems 1, 23–55.
SubrahmanianV.S., 1990a, “Mechanical proof procedures for many valued lattice-based Logic programming,” Journal of Non-Classical Logic 7, pp. 7–41.
Subrahmanian, V.S., 1990b, “Paraconsistent disjunctive deductive databases,” in IEEE. 20th Int. Symp. on Multiple Logic, pp. 339–345.
TakeutiG., 1975, Proof Theory, Amsterdam: North-Holland.
UrquhartA., 1984, “Many-valued logics”, in Handbook of Philosophical Logic, Vol. III, D.Gabbay and F.Guenther, eds., Dordrecht: Reidel, pp. 71–116.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arieli, O., Avron, A. Reasoning with logical bilattices. J Logic Lang Inf 5, 25–63 (1996). https://doi.org/10.1007/BF00215626
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF00215626