28532 articles – 22057 references  [version française]

inria-00423047, version 1

Which Semantics for Neighbourhood Semantics?

Carlos Areces 1, Diego Figueira 2

Twenty-first International Joint Conference on Artificial Intelligence - IJCAI 09 (2009) 671--676

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).

  • 1:  TALARIS (INRIA Nancy - Grand Est / LORIA)
  • CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL)
  • 2:  DAHU (INRIA Saclay - Ile de France)
  • INRIA – Ecole Nationale Supérieure de Cachan – CNRS : UMR8643
  • Domain : Computer Science/Logic in Computer Science
 
  • inria-00423047, version 1
  • http://hal.inria.fr/inria-00423047
  • oai:hal.inria.fr:inria-00423047
  • From: Areces Carlos <>
  • Submitted on: Friday, 9 October 2009 11:37:47
  • Updated on: Thursday, 15 October 2009 10:58:46