Skip to main content
SpringerLink
Log in

Epistemic Foundation of the Well-Founded Semantics over Bilattices

  • Conference paper
Mathematical Foundations of Computer Science 2004 (MFCS 2004)

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

Abstract

We define new, both model-theoretical and fixpoint-based, characterizations of the well-founded semantics for logic programs in the general setting of bilattices. This work lights the role of the CWA, used in the well-founded semantics as a carrier of falsehood, and shows that the definition of that semantics does not require any separation of positive and negative information nor any program transformation.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. Arieli, O.: Paraconsistent declarative semantics for extended logic programs. Annals of Mathematics and Artificial Intelligence 36(4), 381–417 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Arieli, O., Avron, A.: The value of the four values. Artificial Intelligence Journal 102(1), 97–141 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  3. Belnap, N.D.: A useful four-valued logic. In: Epstein, G., Dunn, J.M. (eds.) Modern uses of multiple-valued logic, pp. 5–37. Reidel, Dordrecht (1977)

    Google Scholar 

  4. Blair, H., Subrahmanian, V.S.: Paraconsistent logic programming. Theoretical Computer Science 68, 135–154 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  5. Clark, K.L.: Negation as failure. In: Gallaire, H., Minker, J. (eds.) Logic and data bases, pp. 293–322. Plenum Press, New York (1978)

    Google Scholar 

  6. Damásio, C.V., Pereira, L.M.: A survey of paraconsistent semantics for logic programs. In: Gabbay, D., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, pp. 241–320. Kluwer, Dordrecht (1998)

    Google Scholar 

  7. Van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. Journal of the ACM (JACM) 23(4), 733–742 (1976)

    Article  MATH  Google Scholar 

  8. Fitting, M.C.: The family of stable models. Journal of Logic Programming 17, 197–225 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fitting, M.C.: Fixpoint semantics for logic programming - a survey. Theoretical Computer Science 21(3), 25–51 (2002)

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R.A., Bowen, K. (eds.) Proc. of the 5th Int. Conf. on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

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

    Article  Google Scholar 

  13. Kunen, K.: Negation in logic programming. Journal of Logic Programming 4(4), 289–308 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  14. 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 

  15. Loyer, Y., Straccia, U.: The approximate well-founded semantics for logic programs with uncertainty. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 541–550. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Loyer, Y., Straccia, U.: Default knowledge in logic programs with uncertainty. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 466–480. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. 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 

  18. Ng, R., Subrahmanian, V.S.: Stable model semantics for probabilistic deductive databases. In: Raś, Z.W., Zemankova, M. (eds.) ISMIS 1991. LNCS (LNAI), vol. 542, pp. 163–171. Springer, Heidelberg (1991)

    Google Scholar 

  19. Przymusinski, T.C.: Extended stable semantics for normal and disjunctive programs. In: Warren, D.H.D., Szeredi, P. (eds.) Proc. of the 7th Int. Conf. on Logic Programming, pp. 459–477. MIT Press, Cambridge (1990)

    Google Scholar 

  20. Przymusinski, T.C.: The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae 13(4), 445–463 (1990)

    MATH  MathSciNet  Google Scholar 

  21. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and data bases, pp. 55–76. Plenum Press, New York (1978)

    Google Scholar 

  22. van Gelder, A., Ross, K.A., Schlimpf, J.S.: The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. PRiSM (CNRS UMR 8144), Université de Versailles, FRANCE

    Yann Loyer

  2. I.S.T.I. – C.N.R, Via G. Moruzzi,1, I-56124, Pisa, PI, ITALY

    Umberto Straccia

Authors
  1. Yann Loyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Umberto Straccia
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute for Theoretical Computer Science and Department of Applied Mathematics, Charles University, Prague, Czech Republic

    Jiří Fiala  & Jan Kratochvíl  & 

  2. Department of Theoretical Computer Science and Mathematical Logic, Faculty of Mathematics and Physics, Charles University, Malostranske nam. 25, 118 00, Praha1, Czech Republic

    Václav Koubek

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Loyer, Y., Straccia, U. (2004). Epistemic Foundation of the Well-Founded Semantics over Bilattices. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds) Mathematical Foundations of Computer Science 2004. MFCS 2004. Lecture Notes in Computer Science, vol 3153. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28629-5_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28629-5_39

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22823-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation