Abstract
This paper is an attempt to apply domain-theoretic ideas to a new area, viz. knowledge representation. We present an algebraic model of a belief system. The model consists of an information domain of special kind (belief algebra) and a binary relation on it (entailment). It is shown by examples that several natural belief algebras are, essentially, algebras of flat records. With an eye on this, we characterise those domains and belief algebras that are isomorphic to domains or algebras of records. For illustration, we suggest a system of axioms for revision in such a model and describe an explicit construction of what could be called a maxichoise revision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alchaurrón, C.E., Gärdenfors, P., Makinson D.: On the logic of theory change: Partial meet contraction and revision functions. J. Symb. Logic 50 (1985) 512–530
Amadio, R.M., Curien, P.-L.: Domains and lambda calculi. Cambridge University Press 1998
Birkhoff, G.: Lattice theory. Providence, Rhode Island 1967
Buneman, P., Jung, A., Ohori, A.: Using powerdomains to generalize relational databases. Theoret. Comput. Sci. 91 (1991) 23–55
Burmeister, P.: A Model Theoretic Approach to Partial Algebras. Akademie-Verlag, Berlin 1986
Cardeli, L., Mitchell, J.C.: Operations on records. Math. Structures in Computer Sci. 1 (1991) 3–48
Cīrulis, J.: Dynamic logic out of database updating. 10-th Int. Congr. Logic, Methodol. and Philos. Sci (Florence, 1995). Abstracts 197
Cīrulis, J.: Subtractive nearlattices. Proc. Latvian Acad. Sci., Sect. B 52 (1998) 228–233
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press 1990
Gärdenfors, P. (ed.): Belief revision. Cambridge University Press 1992
Gärdenfors, P.: Belief revision: an introduction. In [10], 1–28
Grätzer, G.: General Lattice Theory. Birkhäuser Verl., 1978
Libkin, L.: A relational algebra for complex objects based on partial information. MFDBS’91, Lect. Notes Comput. Sci. 495 (1991) 29–43
Katsuno, H., Mendelzon, A.O.: Prepositional knowledge base revision and minimal change. Artificial Intelligence 52 (1991) 263–294
Katsuno, H., Mendelzon, A.O.: On the difference between updating a knowledge base and revising it. In [10], 183–203
Németi, I., Andréka, H.: General Algebraic Logic: A Perspective on ‘What is Logic’. In: Gabbay D.M. (ed.), What Is a Logical System? Oxford Univ. Press 1994, 393–443
Ohori, A.: Semantics of types for database objects. Theoret. Comput. Sci. 76 (1990) 53–91
Pratt, W.: Dynamic Algebras: Examples, Constructions, Applications. Studia Logica 51 (1991) 571–605
Spruit, P., Wieringa, R., Meyer, J.-J.: Axiomatization, declarative semantics and operational semantics of passive and active updates in logic databases. J. Logic Computat. 5 (1995) 27–70
Tsirulis, Ya. P.: Formal logic system for describing databases (in Russian). TV All-Union Conf. Appl. Math. Logic (Tallin, 1986), Sect. Logic of Interactive Processes. Abstracts 74–77
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cīrulis, J. (1999). An Algebraic Approach to Knowledge Representation. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-48340-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66408-6
Online ISBN: 978-3-540-48340-3
eBook Packages: Springer Book Archive