A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kazakov, Yevgeny, Pratt-Hartmann, Ian
Format:	Preprint
Published:	2009
Subjects:	Logic in Computer Science Artificial Intelligence Computational Complexity F.4.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/0905.3108