Semantical considerations on nonmonotonic logic
Artificial Intelligence
Applications of circumscription to formalizing common-sense knowledge
Artificial Intelligence
All I know: a study in autoepistemic logic
Artificial Intelligence
Journal of Logic Programming
International Journal of Man-Machine Studies
The use of description logics in KBSE systems: experience report
ICSE '94 Proceedings of the 16th international conference on Software engineering
Tableau Calculus for Only Knowing and Knowing at Most
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Strongly Analytic Tableaux for Normal Modal Logics
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Autoepistemic description logics
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Nonmonotonic databases and epistemic queries
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
The Use of Associative Concepts in the Incremental Building of a Logical Context
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
Modal Logic for Evaluating Formulas in Incomplete Contexts
ICCS '02 Proceedings of the 10th International Conference on Conceptual Structures: Integration and Interfaces
A possibility theory-oriented discussion of conceptual pattern structures
SUM'10 Proceedings of the 4th international conference on Scalable uncertainty management
Negation, opposition, and possibility in logical concept analysis
ICFCA'06 Proceedings of the 4th international conference on Formal Concept Analysis
Hi-index | 0.00 |
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).