Skip to main content
SpringerLink
Log in
Book cover

Australian Joint Conference on Artificial Intelligence

AI 1997: Advanced Topics in Artificial Intelligence pp 246–254Cite as

Specification morphisms for nonmonotonic knowledge systems

  • Knowledge Representation and Reasoning
  • Conference paper
  • First Online:

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

Abstract

Conservative extensions of (classical) logical theories play an important role in software engineering, because they provide a formal basis for program refinement and guarantee the integrity and transparency of modules and objects. Similarly specification morphisms play a central role for information hiding and combining modules. Surprisingly, while the use of nonmonotonic theories for describing knowledge systems which may contain incomplete or uncertain data has been advocated for some time now, the above concepts have yet to be applied in this area. The aim of this work is to develop and apply analogues of these concepts in a nonmonotonic context. This paper builds on previous results, which focus on conservative extensions, extending the ideas to the more general case of specification morphisms.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Antoniou, C. K. MacNish and N. Y. Foo. Conservative Expansion Concepts for Default Theories. In Proc. PRICAI'96, Springer 1996, LNAI 1114, 522–533

    Google Scholar 

  2. J.P. Delgrande, T. Schaub and W.K. Jackson. Alternative Approaches to default logic. Artificial Intelligence 70 (1994): 167–237

    Google Scholar 

  3. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification Vol. 2. Springer 1990

    Google Scholar 

  4. W. Lukaszewicz. Considerations of default logic: an alternative approach. Computational Intelligence 4,1 (1988): 1–16

    Google Scholar 

  5. C. MacNish. Hierarchical default logic. In Symbolic and Quantitative Approaches to Uncertainty: Proc. European Conference. Springer-Verlag Lecture Notes in Computer Science 548, pp 246–253, 1991

    Google Scholar 

  6. A. Mikitiuk and M. Truszczynski. Constrained and rational default logics. In Proc. International Joint Conference on Artificial Intelligence 1995

    Google Scholar 

  7. R. Reiter. A logic for default reasoning. Artificial Intelligence 13 (1980): 81–132

    Article  Google Scholar 

  8. W.M. Turski and T.S.E. Maibaum. The Specification of Computer Programs. Addison-Wesley, Reading Massachusetts, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Western Australia, 6907, Nedlands, WA, Australia

    C. K. MacNish

  2. School of Computing & Information Technology, Griffith University, 4111, QLD, Australia

    Grigoris Antoniou

Authors
  1. C. K. MacNish
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grigoris Antoniou
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Abdul Sattar

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

MacNish, C.K., Antoniou, G. (1997). Specification morphisms for nonmonotonic knowledge systems. In: Sattar, A. (eds) Advanced Topics in Artificial Intelligence. AI 1997. Lecture Notes in Computer Science, vol 1342. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63797-4_77

Download citation

  • DOI: https://doi.org/10.1007/3-540-63797-4_77

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63797-4

  • Online ISBN: 978-3-540-69649-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation