ML Systems: A Proof Theory for Contexts

  • Authors:

  • Luciano Serafini;Fausto Giunchiglia

  • Affiliations:

  • ITC–IRST, Centro per la Ricerca Scientifica e Tecnologica, via Sommarive 18, 38050 Povo, Trento, Italy. E-mail: serafini@itc.it;University of Trento, Via Inama 5, 38100 Trento, Italy. E-mail: fausto@itc.it

  • Venue:
  • Journal of Logic, Language and Information
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

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.