Generality in artificial intelligence
Communications of the ACM
Multilanguage hierarchical logics, or: how we can do without modal logics
Artificial Intelligence
Multi-agent reasoning with belief contexts: the approach and a case study
ECAI-94 Proceedings of the workshop on agent theories, architectures, and languages on Intelligent agents
Ideal and real belief about belief: some intuitions
MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
Local models semantics, or contextual reasoning = locality + compatibility
Artificial Intelligence
Mechanizing Multi-Agent Reasoning with Belief Contexts
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Reasoning About Theory Adequacy. A New Solution To The Qualification Problem
Fundamenta Informaticae
From abstract to concrete norms in agent institutions
FAABS'04 Proceedings of the Third international conference on Formal Approaches to Agent-Based Systems
Knowledge management framework for the collaborative distribution of information
EDBT'04 Proceedings of the 2004 international conference on Current Trends in Database Technology
Hi-index | 0.00 |
We investigate the relationship between two well known formalizations of context: Propositional Logic of Context (PLC) [4], and Local Models Semantics (LMS) [11]. We start with a summary of the desiderata for a logic of context, mainly inspired by McCarthy's paper on generality in AI [15] and his notes on formalizing context [16]. We briefly present LMS, and its axiomatization using MultiContext Systems (MCS) [14]. Then we present a revised (and simplified) version of PLC, and we show that local vocabularies - as they defined in [4] - are inessential in the semantics of PLC. The central part of the paper is the definition of a class of LMS (and its axiomatization in MCS, called MMCC), which is provably equivalent to the axiomatization of PLC as described in [4]. Finally, we go back to the general desiderata and discuss in detail how the two formalisms fulfill (or do not fulfill) each of them.