Abstract
In this paper we explore possible foundations for reasoning about knowledge discovered from incomplete information. The basic idea is to employ Kripke’s classical definitions of semantic structure and truth in a semantic structure, but to make the notion of structure more specific. Namely, we intend to present structures that are derived directly from data provided by a user and to develop logical systems for reasoning about these structures. We assume that the user’s data consist of descriptions of some objects in terms of their properties, and we refer to the collection of these descriptions as explicit information. It happens that this kind of information is very often provided in application domains, and is a basis for a great variety of knowledge representation and processing methods. From explicit information we derive relationships among objects. They constitute implicit information contained in users’ data. These relationships have the form of binary relations in a set of objects such that each of the relations is determined by a subset of properties of the respective objects. These relations reflect some aspects of incompleteness of explicit information. We consider relational structures, referred to as frames, that consist of a set of objects and a family of (accessibility) relations that are parameterised with subsets of a set, with the intuition that these subsets consist of properties of objects. These relations are referred to as information relations.
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
Balbiani, Ph.: 1997, ‘Axiomatization of logics based on Kripke models with relative accessibility relations’, in Orłowska, E. (ed.), Incomplete Information: Rough Set Analysis, Physica Verlag, Berlin, (forthcoming).
Demri, S.: 1996, private communication.
Demri, S.: 1996a, ‘The validity problem for logic DALLA is decidable’, Bulletin of the PAS, Mathematics 44, No. 1, pp. 79–86.
Demri, S.: 1996b, ‘A class of information logics with a decidable validity problem’, Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, Krakow, Poland, September 1996, Springer Lecture Notes in Computer Science, to appear.
Demri, S.: 1997, ‘A completeness proof for a logic with an alternative necessity operator’, Studia Logica, to appear.
Demri, S., Orłowska, E.: 1996, ‘Every finitely reducible logic has the finite model property with respect to the class of <>-formulae’ ICS Research Report 10/96, Warsaw University of Technology, pp. 1–22.
Demri, S., Orłowska, E.: 1996a, ‘Logical analysis of indiscernibility’, ICS Research Report 11/96, Warsaw University of Technology, pp. 1–33.
Demri, S., Orłowska, E.: 1996b, ‘Informational representability of models for information logics’, ICS Research Report 9/96, Warsaw University of Technology, pp. 1–15.
Demri, S., Orłowska, E.: 1996c, ‘Informational representability of complementary relations’, manuscript.
Farinas del Cerro, L., Orłowska, E.: 1985, ‘DAL-a logic for data analysis’, Theoretical Computer Science 36, pp. 251–264. Corrigendum: ibid. 47,1986, 345.
Gargov, G.: 1986, ‘Two completeness theorems in the logic for data analysis’, ICS PAS Report 581, Warsaw, pp. 1–12.
Gargov, G., Passy, S., Tinchev, T.: 1987, ‘Modal environment for Boolean speculations’, in Skordev, D. (ed.), Mathematical Logic and Applications, Plenum Press, New York, pp. 253–263.
Humberstone, I.: 1983, ‘Inaccessible worlds’, Notre Dame Journal of Formal Logic 24, pp. 346–352.
Konikowska, B.: 1987, ‘A formal language for reasoning about indiscernibility’, Bulletin of the PAS, Mathematics 35, pp. 239–249.
Konikowska, B.: 1994, ‘A logic for reasoning about similarity’, in Orłowska, E. (ed.), Reasoning with incomplete information, to appear.
Konrad, E., Orłowska, E., Pawlak, Z.: 1981, ‘Knowledge representation systems’, ICS PAS Report 433, pp. 1–44.
Orłowska, E.: 1983, ‘Semantics of vague concepts’, in Dorn, G. and Weingartner, P. (eds.), Foundations of Logic and Linguistics. Problems and Solutions. Selected contributions to the 7th International Congress of Logic, Methodology, and Philosophy of Science, Salzburg 1983, Plenum Press, London & New York, pp. 465–482.
Orłowska, E.: 1984, ‘Logic of indiscernibility relations’, Lecture Notes in Computer Science 208, Springer, Berlin & Heidelberg & New York, pp. 177–186.
Orłowska, E.: 1985, ‘Logic of nondeterministic information’, Studia Logica 44, pp. 93–102.
Orłowska, E.: 1987, ‘Logic for reasoning about knowledge’, Bulletin of the Section of Logic 16, No. 1, pp. 26–38. Also in Zeitschriftfiiur Mathematische Logik und Grundlagen der Mathematik 35, 1989, pp. 559–572.
Orłowska, E.: 1988, ‘Kripke models with relative accessibility and their application to inferences from incomplete information’, in Mirkowska, G., Rasiowa, H. (eds.), Mathematical Problems in Computation Theory, Banach Center Publications 21, Warsaw, pp. 329–339.
Orłowska, E.: 1988a, ‘Logical aspects of learning concepts’, Journal of Approximate Reasoning 2, pp. 349–364.
Pomykala, J. A.: 1987, ‘Approximation operations in approximation space’, Bulletin of the PAS, Mathematics 35, pp. 653–662.
Pomykala, J.A.: 1988, ‘On definability in the nondeterministic information system’, Bulletin of the PAS, Mathematics 36, pp. 193–210.
Rasiowa, H.: 1988, ‘Logic of approximation reasoning’, Lecture Notes in Computer Science 239, Springer, Berlin & Heidelberg & New York, pp. 188–210.
Rasiowa, H.: 1991, ‘On approximation logics, a survey. Jahrbuch 1990’, Kurt Gödel Gesellschaft, Vienna 1990, pp. 63–87.
Rasiowa, H., Skowron, A.: 1985, ‘Approximation logic’, in Bibel, W., Jantke, K.P. (eds.), Mathematical Methods of Synthesis and Specification of Software Systems, Mathematical Research 31, Akademie Verlag, Berlin, pp. 123–139.
Rauszer, C., Skowron, A.: 1992, ‘The discernibility matrices and functions in information systems’, in Slowinski, R. (ed.), Intelligent decision support. Handbook of applications and advances in the rough set theory, Kluwer Academic Publishers, Dordrecht, pp. 331–362.
Shepherdson, J.C.: 1956, ‘On the interpretation of Aristotelian syllogistic’, Journal of Symbolic Logic 21, pp. 137–147.
Sotirov, V., Vakarelov, D.: 1996, Private communication.
Vakarelov, D.: 1987, ‘Abstract characterization of some knowledge representation systems and the logic NIL of non deterministic information’, in Ph. Jorrand, V. Sgurev (eds.), Artificial Intelligence II, Methodology, Systems, Applications, North Holland Publishing Company, Amsterdam, pp. 255–260.
Vakarelov, D.: 1989, ‘Modal logics for knowledge representation’, Lecture Notes in Computer Science 363, Springer, Berlin & Heidelberg & New York, pp. 257–277.
Vakarelov, D.: 1991a, ‘Logical analysis of positive and negative similarity relations in property systems’, Proceedings of the First World Conference on the Fundamentals of Artificial Intelligence, Paris, Ministere de la Recherche et de la Technologie, Paris, pp. 491–500.
Vakarelov, D.: 1991b, ‘A modal logic for similarity relations in Pawlak knowledge representation systems’, Fundamenta Informaticae 15, pp. 61–79.
Wedberg, A.: 1948, ‘The Aristotelian theory of classes’, Ajatus 15, pp. 299–314.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Orłowska, E. (1998). Studying Incompleteness of Information: A Class of Information Logics. In: Kijania-Placek, K., Woleński, J. (eds) The Lvov-Warsaw School and Contemporary Philosophy. Synthese Library, vol 273. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5108-5_23
Download citation
DOI: https://doi.org/10.1007/978-94-011-5108-5_23
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6146-9
Online ISBN: 978-94-011-5108-5
eBook Packages: Springer Book Archive