资源分类
》 资源 》论文》Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete Fe?lix Bou Marco Cerami and Francesc Esteva

Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete Fe?lix Bou Marco Cerami and Francesc Esteva

2019-11-12 | |  36 |   34 |   0
Abstract It is well-known that satis?ability (and hence validity) in the minimal classical modal logic is a PSPACE-complete problem. In this paper we consider the satis?ability and validity problems (here they are not dual, although mutually reducible) for the minimal modal logic over a ?nite Lukasiewicz chain, and show that they also are PSPACE-complete. This result is also true when adding either the Delta operator or truth constants in the language, i.e. in all these cases it is PSPACEcomplete.

上一篇：Description Logics over Lattices with Multi-Valued Ontologies Stefan Borgwardt and Rafael Pen?aloza

下一篇：Modeling Attempt and Action Failure in Probabilistic stit Logic

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...