Computational Complexity

Finite-valued Lukasiewicz modal logic is PSPACE-complete

Publication Type:

Conference Paper

Authors:

Fèlix Bou; Marco Cerami; Francesc Esteva

Source:

Twenty-second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, p.774 - 779 (2011)

ISBN:

978-1-57735-516-8

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.

The coherence of Lukasiewicz assessments is NP-complete

Publication Type:

Journal Article

Authors:

Simone Bova; Tommaso Flaminio

Source:

International Journal of Approximate reasoning, Volume 51, Issue 3, p.294--304 (2010)

Keywords:

Computational Complexity; NP-completeness

Syndicate content