Modal Logics with Counting - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Modal Logics with Counting

Résumé

We present a modal language that includes explicit operators to count the number of elements that a model might include in the extension of a formula, and we discuss how this logic has been previously investigated under different guises. We show that the language is related to graded modalities and to hybrid logics. We illustrate a possible application of the language to the treatment of plural objects and queries in natural language. We investigate the expressive power of this logic via bisimulations, discuss the complexity of its satisfiability problem, define a new reasoning task that retrieves the cardinality bound of the extension of a given input formula, and provide an algorithm to solve it.

Mots clés

Fichier principal
Vignette du fichier
wollic09.pdf (139.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00482337 , version 1 (10-05-2010)

Identifiants

  • HAL Id : hal-00482337 , version 1

Citer

Carlos Areces, Guillaume Hoffmann, Alexandre A. J. Denis. Modal Logics with Counting. 17th Workshop on Logic, Language, Information and Computation - WoLLIC 2010, Jul 2010, Brasilia, Brazil. ⟨hal-00482337⟩
277 Consultations
383 Téléchargements

Partager

Gmail Facebook X LinkedIn More