Which Semantics for Neighbourhood Semantics?

Carlos Areces 1 Diego Figueira 2
1 TALARIS - Natural Language Processing: representation, inference and semantics
Inria Nancy - Grand Est, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 DAHU - Verification in databases
CNRS - Centre National de la Recherche Scientifique : UMR8643, Inria Saclay - Ile de France, ENS Cachan - École normale supérieure - Cachan, LSV - Laboratoire Spécification et Vérification [Cachan]
Abstract : In this article we discuss two alternative proposals for neighbourhood semantics (which we call strict and loose neighbourhood semantics, Ny =intarondduNce respectively) that have been previously introduced in the literature. Our main tools are suitable notions of bisimulation. While an elegant notion of bisimulation exists for N, the required bisimulation for N= is rather involved. We propose a simple extension of N= with a universal modality that we call N=(E), which comes together with a natural notion of bisimulation. We also investigate the complexity of the satisfiability problem for N and N=(E).
Document type :
Conference papers
Complete list of metadatas

Contributor : Areces Carlos <>
Submitted on : Friday, October 9, 2009 - 11:37:47 AM
Last modification on : Tuesday, February 5, 2019 - 1:46:01 PM


  • HAL Id : inria-00423047, version 1



Carlos Areces, Diego Figueira. Which Semantics for Neighbourhood Semantics?. Twenty-first International Joint Conference on Artificial Intelligence - IJCAI 09, Jul 2009, Pasadena, California, United States. pp.671--676. ⟨inria-00423047⟩



Record views