Abstract
The management of uncertain information in logic programs becomes to be important whenever the real world information to be represented is of imperfect nature and the classical crisp true, false approximation is not adequate. A general framework, called Parametric Deductive Databases with Uncertainty (PDDU) framework [10], was proposed as a unifying umbrella for many existing approaches towards the manipulation of uncertainty in logic programs. We extend PDDU with (non-monotonic) negation, a well-known and important feature of logic programs. We show that, dealing with uncertain and incomplete knowledge, atoms should be assigned only approximations of uncertainty values, unless some assumption is used to complete the knowledge. We rely on the closed world assumption to infer as much default “false” knowledge as possible. Our approach leads also to a novel characterizations, both epistemic and operational, of the well-founded semantics in PDDU, and preserves the continuity of the immediate consequence operator, a major feature of the classical PDDU framework.
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belnap, N.D.: How a computer should think. In: Ryle, G. (ed.) Contemporary aspects of philosophy, pp. 30–56. Oriel Press, Stocksfield (1977)
Dubois, D., Lang, J., Prade, H.: Towards possibilistic logic programming. In: Proc. of the 8th Int. Conf. on Logic Programming (ICLP 1991), pp. 581–595 (1991)
Fitting, M.: The family of stable models. J. of Logic Programming 17, 197–225 (1993)
Fitting, M.: A Kripke-Kleene-semantics for general logic programs. J. of Logic Programming 2, 295–312 (1985)
Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. Of the 5th Int. Conf. on Logic Programming, pp. 1070–1080 (1988)
Ginsberg, M.L.: Multi-valued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence 4, 265–316 (1988)
Kifer, M., Li, A.: On the semantics of rule-based expert systems with uncertainty. In: Gyssens, M., Van Gucht, D., Paredaens, J. (eds.) ICDT 1988. LNCS, vol. 326, pp. 102–117. Springer, Heidelberg (1988)
Kifer, M., Subrahmanian, V.S.: Theory of generalized annotaded logic programming and its applications. J. of Logic Programming 12, 335–367 (1992)
Lakshmanan, L.V.S., Shiri, N.: Probabilistic deductive databases. In: Int. Logic Programming Symposium, pp. 254–268 (1994)
Lakshmanan, L.V.S., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Transactions on Knowledge and Data Engineering 13(4), 554–570 (2001)
Loyer, Y., Straccia, U.: The well-founded semantics in normal logic programs with uncertainty. In: Hu, Z., Rodríguez-Artalejo, M. (eds.) FLOPS 2002. LNCS, vol. 2441, pp. 152–166. Springer, Heidelberg (2002)
Loyer, Y., Straccia, U.: The well-founded semantics of logic programs over bilattices: an alternative characterisation. Technical Report ISTI-2003-TR-05, Istituto di Scienza e Tecnologie dell’Informazione, Consiglio Nazionale delle Ricerche, Pisa, Italy (2003) (submitted)
Lukasiewicz, T.: Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 336–350. Springer, Heidelberg (2001)
Ng, R., Subrahmanian, V.S.: Stable model semantics for probabilistic deductive databases. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS, vol. 542, pp. 163–171. Springer, Heidelberg (1991)
Ng, R., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1993)
Shapiro, E.Y.: Logic programs with uncertainties: A tool for implementing rule-based systems. In: Proc. of the 8th Int. Joint Conf. on Artificial Intelligence (IJCAI 1983), pp. 529–532 (1983)
van Emden, M.H.: Quantitative deduction and its fixpoint theory. J. of Logic Programming 4(1), 37–53 (1986)
van Gelder, A., Ross, K.A., Schlimpf, J.S.: The well-founded semantics for general logic programs. J. of the ACM 38(3), 620–650 (1991)
Wagner, G.: Negation in fuzzy and possibilistic logic programs. In: Martin, T., Arcelli, F. (eds.) Logic programming and Soft Computing. Research Studies Press, Hertfordshire (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loyer, Y., Straccia, U. (2003). The Approximate Well-Founded Semantics for Logic Programs with Uncertainty. In: Rovan, B., Vojtáš, P. (eds) Mathematical Foundations of Computer Science 2003. MFCS 2003. Lecture Notes in Computer Science, vol 2747. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45138-9_48
Download citation
DOI: https://doi.org/10.1007/978-3-540-45138-9_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40671-6
Online ISBN: 978-3-540-45138-9
eBook Packages: Springer Book Archive