Abstract
We present a generalization of logic All I Know by presenting it as an extension of standard modal logics. We study how this logic can be used to represent complete and incomplete knowledge in Logical Information Systems. In these information systems, a knowledge base is a collection of objects (e.g., files, bibliographical items) described in the same logic as used for expressing queries. We show that usual All I Know (transitive and euclidean accessibility relation) is convenient for representing complete knowledge, but not for incomplete knowledge. For this, we use serial All I Know (serial accessibility relation).
This author is supported by a scholarship from CNRS and Région Bretagne
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
A. Bowen. Model Theory for Modal Logic. D. Reidel, London, 1979.
Chen. The logic of only knowing as a unified framework for non-monotonic reasoning. FUNDINF: Fundamenta Informatica, 21, 1994.
P. T. Devanbu and M. A. Jones. The use of description logics in KBSE systems. In Bruno Fadini, editor, Proceedings of the 16th International Conference on Software Engineering, pages 23–38, Sorrento, Italy, May 1994. IEEE Computer Society Press.
F. M. Donini, D. Nardi, and R. Rosati. Autoepistemic description logics. In IJCAI, 1997.
Sébastien Ferré and Olivier Ridoux. A file system based on concept analysis. In Yehoshua Sagiv, editor, International Conference on Rules and Objects in Databases, LNCS 1861, pages 1033–1047. Springer, 2000.
R. Godin, R. Missaoui, and A. April. Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. International Journal of Man-Machine Studies, 38(5):747–767, 1993.
Hector Levesque. All I know: a study in autoepistemic logic. Artificial Intelligence, 42(2), March 1990.
V. Lifschitz. Nonmonotonic databases and epistemic queries. In 12th International Joint Conference on Artificial Intelligence, pages 381–386, 1991.
Fabio Massacci. Strongly analytic tableaux for normal modal logics. In Alan Bundy, editor, Proceedings of the 12th International Conference on Automated Deduction, LNAI 814, pages 723–737, Berlin, 1994. Springer.
John McCarthy. Applications of circumscription to formalizing common sense knowledge. Artificial Intelligence, 28(1), 1986.
Robert C. Moore. Semantical considerations on nonmonotonic logic. Artificial Intelligence, 25(1):75–94, 1985.
Raymond Reiter. What should a database know? Journal of Logic Programming, 14(1–2):127–153, October 1992.
Riccardo Rosati. Tableau calculus for only knowing and knowing at most. In Roy Dickhoff, editor, TABLEAUX, LNCS 1847. Springer, 2000.
Rudolf Wille. Ordered Sets, chapter Restructuring lattice theory: an approach based on hierarchies of concepts, pages 445–470. Reidel, Dordrecht Boston, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ferré, S. (2001). Complete and Incomplete Knowledge in Logical Information Systems. In: Benferhat, S., Besnard, P. (eds) Symbolic and Quantitative Approaches to Reasoning with Uncertainty. ECSQARU 2001. Lecture Notes in Computer Science(), vol 2143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44652-4_69
Download citation
DOI: https://doi.org/10.1007/3-540-44652-4_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42464-2
Online ISBN: 978-3-540-44652-1
eBook Packages: Springer Book Archive