Complexity Sources in Fuzzy Description Logic

@inproceedings{Cerami2014ComplexitySI,
  title={Complexity Sources in Fuzzy Description Logic},
  author={Marco Cerami and Umberto Straccia},
  booktitle={Description Logics},
  year={2014}
}
In recent years many Fuzzy Description Logics (FDLs) based on infinite t-norms have been proved to be undecidable. On the other hand, several FDLs based on finite t-norms, not only have been proved to be decidable, but they have been proved to belong to the same complexity classes as the corresponding crisp DLs. In light of such results, a question that naturally arises is whether the finite-valued fuzzy framework is no more complex than the crisp-valued formalism. The aim of this work is to… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 23 references

Concept satisfiability in finite-valued fuzzy description logics is pspace-complete (extended abstract)

  • F. Bou, M. Cerami, F. Esteva
  • Terui, K., Preining, N. (eds.) Proceedings of the…
  • 2012
Highly Influential
4 Excerpts

Proceedings of the 6 th International Conference on Web Reasoning and Rule Systems ( RR 2012 )

  • M. Krötzsch, U. Straccia
  • Lecture Notes in Computer Science
  • 2012

Similar Papers

Loading similar papers…