Skip to main content

Default Knowledge in Logic Programs with Uncertainty

  • Conference paper
Book cover Logic Programming (ICLP 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2916))

Included in the following conference series:

Abstract

Many frameworks have been proposed to manage uncertain information in logic programming. Essentially, they differ in the underlying notion of uncertainty and how these uncertainty values, associated to rules and facts, are managed. The goal of this paper is to allow the reasoning with non-uniform default assumptions, i.e. with any arbitrary assignment of default values to the atoms. Informally, rather than to rely on the same default certainty value for all atoms, we allow arbitrary assignments to complete information. To this end, we define both epistemologically and computationally the semantics according to any given assumption. For reasons of generality, we present our work in the framework presented in [17] as a unifying umbrella for many of the proposed approaches to the management of uncertainty in logic programming. Our extension is conservative in the following sense: (i) if we restrict our attention to the usual uniform Open World Assumption, then the semantics reduces to the Kripke-Kleene semantics, and (ii) if we restrict our attention to the uniform Closed World Assumption, then our semantics reduces to the well-founded semantics.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 99.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Belnap, N.D.: How a computer should think. In: Ryle, G. (ed.) Contemporary aspects of philosophy, pp. 30–56. Oriel Press, Stocksfield (1977)

    Google Scholar 

  2. Buchanan, B.G., Shortli, E.H.: A model of inexact reasoning in medicine. Mathematical Bioscience 23, 351–379 (1975)

    Article  Google Scholar 

  3. Cao, T.H.: Annotated fuzzy logic programs. Fuzzy Sets and Systems 113(2), 277–298 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dubois, D., Lang, J., Prade, H.: Towards possibilistic logic programming. In: Proc. of ICLP 1991, pp. 581–595. MIT Press, Cambridge (1991)

    Google Scholar 

  5. Fitting, M.: The family of stable models. J. of Logic Programming 17, 197–225 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  6. Fitting, M.: A Kripke-Kleene-semantics for general logic programs. J. of Logic Programming 2, 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fitting, M.: Bilattices and the semantics of logic programming. J. of Logic Programming 11, 91–116 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fuhr, N.: Probabilistic Datalog: Implementing logical information retrieval for advanced applications. J. of the American Society for Information Science 51(2), 95–110 (2000)

    Article  MathSciNet  Google Scholar 

  9. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of ICLP 1988, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  10. Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generation Computing 9(3/4), 365–386 (1991)

    Article  Google Scholar 

  11. Ginsberg, M.L.: Multi-valued logics: a uniform approach to reasoning in artificial intelligence. Computational Intelligence 4, 265–316 (1988)

    Article  Google Scholar 

  12. 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)

    Google Scholar 

  13. Kifer, M., Subrahmanian, V.S.: Theory of generalized annotated logic programming and its applications. J. of Logic Programming 12, 335–367 (1992)

    Article  MathSciNet  Google Scholar 

  14. Lakshmanan, L.: An epistemic foundation for logic programming with uncertainty. In: Thiagarajan, P.S. (ed.) FSTTCS 1994. LNCS, vol. 880, pp. 89–100. Springer, Heidelberg (1994)

    Google Scholar 

  15. Lakshmanan, L., Sadri, F.: Uncertain deductive databases: a hybrid approach. Information Systems 22(8), 483–508 (1997)

    Article  MATH  Google Scholar 

  16. Lakshmanan, L., Shiri, N.: Probabilistic deductive databases. In: Int’l Logic Programming Symposium, pp. 254–268 (1994)

    Google Scholar 

  17. Lakshmanan, L., Shiri, N.: A parametric approach to deductive databases with uncertainty. IEEE Transactions on Knowledge and Data Engineering 13(4), 554–570 (2001)

    Article  Google Scholar 

  18. Loyer, Y., Spyratos, N., Stamate, D.: Integration of Information in Four-valued Logics under Non-Uniform Assumptions. In: Proc. of the 30th IEEE Int. Symp. on Multi-Valued Logics, pp. 185–191. IEEE Press, Los Alamitos (2000)

    Google Scholar 

  19. Loyer, Y., Straccia, U.: Uncertainty and partial non-uniform assumptions in parametric deductive databases. In: Flesca, S., Greco, S., Leone, N., Ianni, G. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 271–282. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Loyer, Y., Straccia, U.: The well-founded semantics of logic programs over bilattices: an alternative characterisation. TR ISTI-2003-TR-05, ISTI-CNR, Pisa, Italy (2003) (submitted)

    Google Scholar 

  21. Loyer, Y., Spyratos, N., Stamate, D.: Parametrized Semantics of Logic Programs - a unifying approach. Theoretical Computer Science (to appear)

    Google Scholar 

  22. Loyer, Y., Spyratos, N., Stamate, D.: Hypotheses-Based Semantics of Logic Programs in Multi-Valued Logics. ACM Transactions on Computational Logic (to appear)

    Google Scholar 

  23. 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)

    Google Scholar 

  24. 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)

    Google Scholar 

  25. Ng, R., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1993)

    Article  MathSciNet  Google Scholar 

  26. Przymusinski, T.C.: Extended stable semantics for normal and disjunctive programs. In: Proc. of ICLP 1990, pp. 459–477. MIT Press, Cambridge (1990)

    Google Scholar 

  27. Shapiro, E.Y.: Logic programs with uncertainties: A tool for implementing rule-based systems. In: Proc. of IJCAI 1983, pp. 529–532 (1983)

    Google Scholar 

  28. Subramanian, V.S.: On the semantics of quantitative logic programs. In: Proc. of 4th IEEE Symp. on Logic Programming, pp. 173–182. Computer Society Press, Los Alamitos (1987)

    Google Scholar 

  29. van Emden, M.H.: Quantitative deduction and its fixpoint theory. J. of Logic Programming 4(1), 37–53 (1986)

    Article  Google Scholar 

  30. van Gelder, A.: The alternating fixpoint of logic programs with negation. In: Proc. of ACM PODS 1989, pp. 1–10 (1989)

    Google Scholar 

  31. 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)

    MATH  Google Scholar 

  32. Wagner, G.: A logical reconstruction of fuzzy inference in databases and logic programs. In: Proc. of IFSA 1997, Prague (1997)

    Google Scholar 

  33. Wagner, G.: Negation in fuzzy and possibilistic logic programs. In: Logic programming and Soft Computing. Research Studies Press (1998)

    Google Scholar 

  34. Zadeh, L.A.: Fuzzy sets. Information and Control 8(3), 338–353 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  35. Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1(1), 3–28 (1965)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loyer, Y., Straccia, U. (2003). Default Knowledge in Logic Programs with Uncertainty. In: Palamidessi, C. (eds) Logic Programming. ICLP 2003. Lecture Notes in Computer Science, vol 2916. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24599-5_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24599-5_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20642-2

  • Online ISBN: 978-3-540-24599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics