Extensions of modal logic S5 preserving NP-completeness
Résumé
We present a family of multi-modal logics having NP-complete satisfiability problems and admitting in the language S5-like modal operators, common knowledge and distributed knowledge operators. Our motivation is to find out interaction conditions between the modal operators that affect the computational complexity of the logics.
Origine : Fichiers éditeurs autorisés sur une archive ouverte