 |
|
|
|
| HAL : hal-00482337, version 1 |
| Fiche détaillée |  Récupérer au format |
|
|
| 17th Workshop on Logic, Language, Information and Computation - WoLLIC 2010, Brasilia : Brazil (2010) |
|
|
|
|
| Modal Logics with Counting |
|
|
Carlos Areces 1Guillaume Hoffmann 1 |
|
|
| (2010) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1 : | TALARIS (INRIA Nancy - Grand Est / LORIA) |
|
|
|
CNRS : UMR7503 – INRIA – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine (INPL) |
|
|
|
|
|
|
|
|
|
| Domaine | : | Mathématiques/Logique Informatique/Interface homme-machine |
|
|
| Modal logics – Counting |
|
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|||||
|
|
|
| hal-00482337, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00482337 | |
| oai:hal.archives-ouvertes.fr:hal-00482337 | |
| Contributeur : Alexandre Denis | |
| Soumis le : Lundi 10 Mai 2010, 11:43:26 | |
| Dernière modification le : Lundi 17 Mai 2010, 14:39:42 | |
