Finite Lattices Do Not Make Reasoning in ALCI Harder

Stefan Borgwardt, Rafael Peñaloza
2011 International Semantic Web Conference  
We consider the fuzzy logic ALCI with semantics based on a finite residuated lattice. We show that the problems of satisfiability and subsumption of concepts in this logic are ExpTime-complete w.r.t. general TBoxes and PSpace-complete w.r.t. acyclic TBoxes. This matches the known complexity bounds for reasoning in crisp ALCI.
dblp:conf/semweb/BorgwardtP11 fatcat:7kyzev74wrawdmnjtcxsgnytsa