Journal of Logic, Language and Information

, Volume 11, Issue 4, pp 471–518

ML Systems: A Proof Theory for Contexts

Authors

  • Luciano Serafini
    • Centro per la Ricerca Scientifica e TecnologicaITC–IRST
  • Fausto Giunchiglia
    • University of Trento
Article

DOI: 10.1023/A:1019967901393

Cite this article as:
Serafini, L. & Giunchiglia, F. Journal of Logic, Language and Information (2002) 11: 471. doi:10.1023/A:1019967901393

Abstract

In the last decade the concept of context has been extensivelyexploited in many research areas, e.g., distributed artificialintelligence, multi agent systems, distributed databases, informationintegration, cognitive science, and epistemology. Three alternative approaches to the formalization of the notion ofcontext have been proposed: Giunchiglia and Serafini's Multi LanguageSystems (ML systems), McCarthy's modal logics of contexts, andGabbay's Labelled Deductive Systems.Previous papers have argued in favor of ML systems with respect to theother approaches. Our aim in this paper is to support these arguments froma theoretical perspective. We provide a very general definition of ML systems, which covers allthe ML systems used in the literature, and we develop a proof theoryfor an important subclass of them: the MR systems. We prove variousimportant results; among other things, we prove a normal form theorem,the sub-formula property, and the decidability of an importantinstance of the class of the MR systems. The paper concludes with a detailed comparison among the alternativeapproaches.

contextual reasoning distributed information-oriented theories modal logics multi context systems normal form proof theory

Copyright information

© Kluwer Academic Publishers 2002