First-order logic and automated theorem proving
First-order logic and automated theorem proving
AI Magazine
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Artificial intelligence and mathematical theory of computation
Contexts: a formalization and some applications
Contexts: a formalization and some applications
Multilanguage hierarchical logics, or: how we can do without modal logics
Artificial Intelligence
Is intractability of non-monotonic reasoning a real drawback?
AAAI'94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 2)
Reasoning about knowledge
Strongly Analytic Tableaux for Normal Modal Logics
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Non-omniscient belief as context-based reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
The comparative linguistics of knowledge representation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Fundamenta Informaticae
Single Step Tableaux for Modal Logics
Journal of Automated Reasoning
First-Order Contextual Reasoning
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Complexity of contextual reasoning
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Natural deduction and context as (constructive) modality
CONTEXT'03 Proceedings of the 4th international and interdisciplinary conference on Modeling and using context
A reflective proof system for reasoning in contexts
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
| Hi-index | 0.00 |
The logic of context with the ist (c, p) modality has been proposed by McCarthy as a foundation for contextual reasoning. This paper shows that propositional logic of context is NP-complete and therefore more tractable than multimodal logics or Multi Language hierarchical logics which are PSPACE-complete. This result is given in a proof-theoretical way by providing a tableau calculus, which can be used as a decision procedure for automated reasoning. The computational gap between logic of context and modal logics is analyzed and some indications for the use of either formalisms are drawn on the basis of the tradeoff between compactness of representation and tractability of reasoning.