Model-Checking for Ability-Based Logics with Constrained Plans - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Model-Checking for Ability-Based Logics with Constrained Plans

Résumé

We investigate the complexity of the model-checking problem for a family of modal logics capturing the notion of "knowing how". We consider the most standard abilitybased knowing how logic, for which we show that modelchecking is PSpace-complete. By contrast, a multi-agent variant based on an uncertainty relation between plans in which uncertainty is encoded by a regular language, is shown to admit a PTime model-checking problem. We extend with budgets the above-mentioned ability-logics, as done for ATLlike logics. We show that for the former logic enriched with budgets, the complexity increases to at least ExpSpacehardness, whereas for the latter, the PTime bound is preserved. Other variant logics are discussed along the paper. (also available at https://ojs.aaai.org/index.php/AAAI/article/view/25776)
Fichier principal
Vignette du fichier
aaai23.pdf (415.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03997096 , version 1 (22-03-2023)

Identifiants

  • HAL Id : hal-03997096 , version 1

Citer

Stéphane Demri, Raul Fervari. Model-Checking for Ability-Based Logics with Constrained Plans. 37th AAAI Conference on Artificial Intelligence (AAAI-23), AAAI, Feb 2023, Washignton DC, United States. ⟨hal-03997096⟩
72 Consultations
27 Téléchargements

Partager

Gmail Facebook X LinkedIn More