Abstract
We propose a framework which extends Antitonic Logic Programs [2] to an arbitrary complete bilattice of truth-values, where belief and doubt are explicitly represented. Based on Fitting’s ideas, this framework allows a precise definition of important operators found in logic programming such as explicit negation and the default negation. In particular, it leads to a natural integration of explicit negation with the default negation through the coherence principle [19]. According to this principle, the explicit negation entails the default negation. We then define Coherent Answer Sets, and the Paraconsistent Well-founded Model semantics, generalizing paraconsistent semantics for logic programs (for instance, WFSX p [4]). Our framework is an extension of important classes of Antitonic Logic Programs, and is general enough to capture Probabilistic Deductive Databases, Possibilistic Logic Programming, Hybrid Probabilistic Logic Programs, and Fuzzy Logic Programming. Thus, we have a powerful mathematical formalism for dealing with default reasoning, paraconsistency, and uncertainty.
João Alcântara is a PhD student supported by CAPES - Brasília, Brazil. The authors also thank the TARDE and FLUX projects, sponsored by MCT - Portugal.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Alcântara, C. V. Damásio, and L. M. Pereira. Paraconsistent logic programs. Workshop on Paraconsistent Logic (WoPaLo), 2002.
C. V. Damásio and L. M. Pereira. Antitonic logic programs. In T. Eiter and M. Truszczynski, editors, Procs. of the 6th Int. Conf. on Logic Programming and Nonmonotonic Reasoning (LPNMR’01), LNCS/LNAI, pages 748–759. Springer, 2001.
C. V. Damásio and L. M. Pereira. Monotonic and residuated logic programs. In S. Benferhat and P. Besnard, editors, 6th European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU’01), LNCS/LNAI. Springer, 2001.
C. V. Damásio. Paraconsistent Extended Logic Programming with Constraints. PhD thesis, Universidade Nova de Lisboa, 1996.
A. Dekhtyar and V. S. Subrahmanian. Hybrid probabilistic programs. Journal of Logic Programming, 43(3):197–250, 2000.
D. Dubois, J. Lang, and H. Prade. Towards possibilistic logic programming. In Proc. of ICLP’91, pages 581–598. MIT Press, 1991.
M. Fitting. Logic programming on a topological bilattice. Fundamentae Mathematicae, XI:209–218, 1988.
M. Fitting. Bilattices and the semantics of logic programming. The Journal of Logic Programming, 11:91–116, 1991.
M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In R. Kowalski and K. A. Bowen, editors, 5th International Conference on Logic Programming, pages 1070–1080. MIT Press, 1988.
M. Gelfond and V. Lifschitz. Logic programs with classical negation. In Warren and Szeredi, editors, 7th International Conference on Logic Programming, pages 579–597. MIT Press, 1990.
M. Ginsberg. Multivalued logics: A uniform approach to reasoning in artificial intelligence. Computational Intelligence, 4:265–316, 1988.
M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. The Journal of Logic Programming, 12(1, 2, 3 & 4):335–367, 1992.
R. Kowalski and F. Sadri. Logic programs with exceptions. In Warren and Szeredi, editors, 7th International Conference on Logic Programming. MIT Press, 1990.
L. Lakshmanan and F. Sadri. On a theory of probabilistic deductive databases. Theory and Practice of Logic Programming, 1(1):5–42, 2001.
L. Lakshmanan and N. Shiri. A parametric approach to deductive databases with uncertainty. Knowledge and Data Engineering, 13(4):554–570, 2001.
J. Maluszynski and A. Vitória. Towards rough datalog: embedding rough sets in prolog. In A. Skowron Accepted in: S. K. Pal, L. Polkowski, editor, Rough-Neuro Computing, AI Series. Springer-Verlag, 2002.
R. Ng and V. S. Subrahmanian. Probabilistic logic programming. INFCTRL: Information and Computation (formerly Information and Control), 101, 1992.
Z. Pawlak. Rough Sets. Theoretical aspects of reasoning about data. Kluwer Academic Publishers, Dordrecht, 1991.
L. M. Pereira and J. J. Alferes. Well-founded semantics for logic programs with explicit negation. In B. Neumann, editor, European Conference on Artificial Intelligence, pages 102–106, Wien-Austria, 1992. John Wiley & Sons.
E. Shapiro. Logic programs with uncertainties: A tool for implementing expert systems. In Proc. IJCAI’83, pages 529–532. William Kauffmann, 1983.
M. van Emden and R. Kowalski. The semantics of predicate logic as a programming language. Journal of ACM, 4(23):733–742, 1976.
M. van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 3(1):37–53, 1986.
P. Vojtás and L. Paulík. Soundness and completeness of non-classical extended SLD-resolution. In Proc. of the Ws. on Extensions of Logic Programming (ELP’96), LNCS 1050, pages 289–301. Springer-Verlag, 1996.
G. Wagner. A database needs two kinds of negation. In B. Thalheim, J. Demetrovics, and H-D. Gerhardt, editors, Mathematical Foundations of Database Systems, pages 357–371. LNCS 495, Springer-Verlag, 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alcântara, J., Damásio, C.V., Pereira, L.M. (2002). Paraconsistent Logic Programs. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds) Logics in Artificial Intelligence. JELIA 2002. Lecture Notes in Computer Science(), vol 2424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45757-7_29
Download citation
DOI: https://doi.org/10.1007/3-540-45757-7_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44190-8
Online ISBN: 978-3-540-45757-2
eBook Packages: Springer Book Archive