Proceedings

Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 774-778.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-136

Abstract

It is well-known that satisfiability (and hence validity) in the minimal classical modal logic is a PSPACE-complete problem. In this paper we consider the satisfiability and validity problems (here they are not dual, although mutually reducible) for the minimal modal logic over a finite 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 PSPACE-complete.

Félix Bou, Marco Cerami, and Francesc Esteva. 2011. Finite-Valued Lukasiewicz Modal Logic Is PSPACE-Complete. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 774–778. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-136
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards