Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A study of Przymusinski's static semantics

  • Regular Papers
  • Conference paper
  • First Online:
Logic Programming And Nonmonotonic Reasoning (LPNMR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1265))

Abstract

We represent Przymusinski's Autoepistemic Logic of Beliefs and the associated static semantics in terms of a general formalism of biconsequence relations suggested in [3]. It is shown, in particular, that the static semantics belongs to a broad family of nonmonotonic formalisms constructed in accordance with a common completion schema. We consider also a formal representation for two important special cases covering, respectively, belief theories without nested modalities and theories serving as translations of general logic programs. The representation of the latter will allow us to clarify a place of the static semantics for logic programs in the general classification proposed in [5].

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

Access this chapter

Log in via an institution

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. N.D. Belnap, Jr. (1977) A useful four-valued logic. In M. Dunn and G. Epstein (eds.) Modern Uses of Multiple-Valued Logic, D. Reidel, Dordrecht, pp. 8–41.

    Google Scholar 

  2. A. Bochman (1995) On bimodal nonmonotonic logics and their unimodal and non-modal equivalents. Proc. IJCAI'95, pp. 1518–1524.

    Google Scholar 

  3. A. Bochman (1996) Biconsequence relations for nonmonotonic reasoning. In L.C. Aiello, J. Doyle, and S.C. Shapiro (eds.) Principles of Knowledge Representation and Reasoning: Proc. Fifth Int. Conference (KR'96), Morgan Kauffman, San Francisco, CA.

    Google Scholar 

  4. A. Bochman (1996) On a logical basis of normal logic programs. Fundamenta Informaticae, 28:223–245.

    Google Scholar 

  5. A. Bochman (1996) On logics and semantics for general logic programs. In J. Dix, L. Pereira, and T. Przymusinski (eds.) Proc. 2nd Workshop on Nonmonotonic Extensions of Logic Programming. LNAI, Springer Verlag.

    Google Scholar 

  6. A. Bochman (1997) What is a four-valued reasoning and how it can be nonmonotonic. (Submitted)

    Google Scholar 

  7. S. Brass and J. Dix (1995) Disjunctive semantics based upon partial and bottomup evaluation. In L. Sterling (ed.) Proc. 12th Int. Conf. on Logic Programming, Tokyo, MIT Press, pp. 199–213.

    Google Scholar 

  8. S. Brass and J. Dix (1996) Characterizing D-WFS: confluence and iterated GCWA. In J.J. Alferes, L.M. Pereira, and E. Orlowska (eds.) Logics in Artificial Intelligence (JELIA'96), LNCS 1126, Springer, pp. 268–283.

    Google Scholar 

  9. S. Brass, J. Dix and T. Przymusinski (1996) A comparison of static semantics and d-wfs. Technical report TR 2/96, University of Koblenz, Department of Computer Science.

    Google Scholar 

  10. S. Brass, J. Dix and T. Przymusinski (1996) Super logic programs. In L.C. Aiello, J. Doyle, and S.C. Shapiro (eds.) Principles of Knowledge Representation and Reasoning: Proc. Fifth Int. Conference (KR'96), Morgan Kauffman, San Francisco, CA.

    Google Scholar 

  11. V. Lifschitz (1994) Minimal belief and negation as failure. Artificial Intelligence, 70:53–72, 1994.

    Google Scholar 

  12. T.C. Przymusinski (1988) On the declarative semantics of stratified deductive databases and logic programs. In J. Minker (ed) Foundations of Deductive Databases and Logic Programming, pp. 193–216, Morgan Kauffman, Los Altos, CA.

    Google Scholar 

  13. T.C. Przymusinski (1991) Semantics of disjunctive logic programs and deductive databases. In Proc. Second Int. Conf. on Deductive and Object-Oriented Databases, DOOD'91, Springer Verlag, pp. 85–107.

    Google Scholar 

  14. T.C. Przymusinski (1995) Static semantics for normal and disjunctive logic programs. Annals of Mathematics and Artificial Intelligence

    Google Scholar 

  15. T.C. Przymusinski (1995) Semantics of normal and disjunctive logic programs: A unifying framework. In J. Dix, L. Pereira, and T. Przymusinski (eds.) Proc. Workshop on Non-Monotonic Extensions of Logic Programming. Springer Verlag (LNAI), pp. 43–67.

    Google Scholar 

Download references

Authors
  1. Alexander Bochman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Ulrich Furbach Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bochman, A. (1997). A study of Przymusinski's static semantics. In: Dix, J., Furbach, U., Nerode, A. (eds) Logic Programming And Nonmonotonic Reasoning. LPNMR 1997. Lecture Notes in Computer Science, vol 1265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63255-7_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-63255-7_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63255-9

  • Online ISBN: 978-3-540-69249-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation