Contextual Reasoning Is NP-Complete
نویسنده
چکیده
The logic of context with the ist (c;p) modality has been proposed by McCarthy as a foundation for con-textual reasoning. This paper shows that proposi-tional 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 tradeoo between compactness of representation and tractability of reasoning.
منابع مشابه
Cant Ext Ual Easoning Is N
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 ...
متن کاملBounded Model Property for Multi-Context Systems
Our general interest is to understand the inherent complexity of contextual reasoning. In this paper we establish the bounded model property for propositional multi-context systems with finite sets of bridge rules: the number of local models needed to satisfy a set of formulas in such systems is bounded by the number of formulas in that set plus the number of bridge rules of the system. Using t...
متن کاملA Complete Classi cation of Tractabilityin the Spatial Theory RCC - 5
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satissability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classiication of satissability for all these subclasses into polynomial and NP-complete respec...
متن کاملA Complete Classi cation of Tractability inRCC
We investigate the computational properties of the spatial algebra RCC-5 which is a restricted version of the RCC framework for spatial reasoning. The satissability problem for RCC-5 is known to be NP-complete but not much is known about its approximately four billion subclasses. We provide a complete classiication of satissability for all these subclasses into polynomial and NP-complete respec...
متن کاملComplexity of Contextual Reasoning
It has been widely argued that the establishment of a solid paradigm for contextual knowledge representation and reasoning is of paramount importance for the development of sophisticated theory and applications in Artificial Intelligence. McCarthy [7] pleaded for a formalization of context as a possible solution to the problem of generality, whereas Giunchiglia [4] emphasized the principle of l...
متن کامل