Generality in artificial intelligence
Communications of the ACM
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Multilanguage hierarchical logics, or: how we can do without modal logics
Artificial Intelligence
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Local models semantics, or contextual reasoning = locality + compatibility
Artificial Intelligence
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Building Large Knowledge-Based Systems; Representation and Inference in the Cyc Project
Distributing Timed Model Checking - How the Search Order Matters
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Comparing formal theories of context in AI
Artificial Intelligence
GridSAT: A Chaff-based Distributed SAT Solver for the Grid
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
Contextual reasoning is NP-complete
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
This paper delineates the computational complexity of propositional multi-context systems. We establish NP-membership by translating multi-context systems into bounded modal Kn, and obtain more refined complexity results by achieving the so-called bounded model property: the number of local models needed to satisfy a set of formulas Φ in a multicontext system MS is bounded by the number of contexts addressed by Φ plus the number of bridge rules in MS. Exploiting this property of multi-context systems, we are able to encode contextual satisfiability into purely propositional satisfiabliIty, providing for the implementation of contextual reasoners based on already existing specialized SAT solvers. Finally, we apply our results to improve complexity bounds for McCarthy's propositional logic of context - we show that satisfiability in this framework can be settled in nondeterministic polynomial time O(|Φ|2).