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.
References
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
J.P. Delgrande, T. Schaub and W.K. Jackson. Alternative Approaches to default logic. Artificial Intelligence 70 (1994): 167–237
H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification Vol. 2. Springer 1990
W. Lukaszewicz. Considerations of default logic: an alternative approach. Computational Intelligence 4,1 (1988): 1–16
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
A. Mikitiuk and M. Truszczynski. Constrained and rational default logics. In Proc. International Joint Conference on Artificial Intelligence 1995
R. Reiter. A logic for default reasoning. Artificial Intelligence 13 (1980): 81–132
W.M. Turski and T.S.E. Maibaum. The Specification of Computer Programs. Addison-Wesley, Reading Massachusetts, 1987
Author information
Authors and Affiliations
Editor information
Rights 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