Abstract
Paraconsistent logics are a class of logics proposed by Newton da Costa [7] that provide a framework for formal reasoning about inconsistent systems. In [4, 5, 6], Blair and Subrahmanian, and independently, Fitting [11], showed that paraconsistent logics may be successfully used for logic programming. In this paper, we study the algebraic properties of the space of paraconsistent logic programs over a complete lattice of truth values. We show that this set, under some natural operations generalizing those defined by Mancarella and Pedreschi [18], yields a distributive lattice that satisfies various important non-extensibility conditions. Intuitively, these non-extensibility conditions tell us that the algebraic characterization we provide cannot be (naturally) strengthened any further. As an interesting application, we generalize the notion of subsumption equivalence of classical logic programs to the case of multi-valued logic programs and derive necessary and sufficient conditions for multivalued logic programs to be subsumption-equivalent.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
H. Andreka and I. Nemeti. (1978) The Generalised Completeness of Horn Predicate Logic as a Programming Language, Acta Cybernetica, 4, 1, pps 3–10.
A. Bialynicki-Birula and H. Rasiowa. (1957) On the Representation of Quasi-Boolean Algebras, Bulletin of the Polish Academy of Sciences, Cl. III, 5, pps 259–261.
H.A. Blair. (1986) Decidability in the Herbrand Base, in: Proc. of the Workshop on Foundations of Logic Programming and Deductive Databases, (ed. Jack Minker), College Park, MD.
H. A. Blair and V.S. Subrahmanian. (1987) Paraconsistent Logic Programming, Proc. 7th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 287, pps 340–360, Springer Verlag. Extended version to appear in: Theoretical Computer Science.
H. A. Blair and V. S. Subrahmanian. (1988) Strong Completeness Results for Paraconsistent Logic Programming, submitted for publication.
H. A. Blair and V. S. Subrahmanian. (1988) Paraconsistent Foundations for Logic Programming, to appear in: Journal of Non-Classical Logic.
N.C.A. da Costa. (1974) On the Theory of Inconsistent Formal Systems, Notre Dame J. of Formal Logic, 15, pps 497–510.
N.C.A. da Costa and V.S. Subrahmanian. (1989) Paraconsistent Logics as a Formalism for Reasoning about Inconsistent Knowledge Bases, to appear in: J. of Artificial Intelligence in Medicine.
J.M. Dunn. (1982) A Relational Representation of Quasi-Boolean Algebras, Notre Dame Journal of Formal Logic 23, 4, pps 353–357.
M. C. Fitting. (1987) Bilattices and the Theory of Truth, draft manuscript.
M. C. Fitting. (1988) Logic Programming on a Topological Bilattice, Fundamenta Informatica, 11, pps 209–218.
M. C. Fitting. (1988) Bilattices and the Semantics of Logic Programming, to appear.
G. Grätzer. (1971) Lattice Theory: First Concepts and Distributive Lattices, W. H. Freeman and Company.
L. Henkin, J. D. Monk and A. Tarski. (1971) Cylindric Algebras, Part I, North Holland.
A. N. Hirani and V. S. Subrahmanian. (1988) Algebraic Foundations of Logic Programming, I: The Distributive Lattice of Logic Programs, to appear in: Fundamenta Informatica.
J. W. Lloyd. (1984) Foundations of Logic Programming, Springer Verlag.
M. J. Maher. (1988) Equivalences of Logic Programs, in: Foundations of Deductive Databases and Logic Programming, ed. Jack Minker, Morgan-Kauffman.
P. Mancarella and D. Pedreschi. (1988) An Algebra of Logic Programs, in: Proc. 5th International Conference on Logic Programming (eds. R. Kowalski and K. Bowen), pps 1006–1023, MIT Press.
H. Rasiowa. (1974) An Algebraic Approach to Non-Classical Logics, North Holland.
D. C. Rine. Some Relations between Logic Programming and Multiple Valued Logic, manuscript.
J. Sebelik and P. Stepanek. (1982) Horn Clause Programs for Recursive Functions, in: eds. K.L. Clark and S.-A. Tarnlund: Logic Programming, Academic Press, pps 325–340.
R. Sikorski. (1964) Boolean Algebras, Springer Verlag.
V. S. Subrahmanian. (1988) Mechanical Proof Procedures for Many Valued Lattice Based Logic Programming, to appear in J. of Non-Classical Logic.
V. S. Subrahmanian. (1989) Algebraic Foundations of Logic Programming, II: The Space of Multivalued and Paraconsistent Logic Programs, manuscript.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Subrahmanian, V.S. (1989). Algebraic properties of the space of multivalued and paraconsistent logic programs. In: Veni Madhavan, C.E. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1989. Lecture Notes in Computer Science, vol 405. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52048-1_32
Download citation
DOI: https://doi.org/10.1007/3-540-52048-1_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52048-1
Online ISBN: 978-3-540-46872-1
eBook Packages: Springer Book Archive