Complexity Sources in Fuzzy Description Logic

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 analyze some of the complexity sources that are not present in the crisp framework. To this end, we will consider FDL languages with low expressivity that allow us to observe how the need for more complex deciding strategies, not required in the crisp framework, arises in manyvalued FDLs.

[1]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[2]  Rafael Peñaloza,et al.  A Tableau Algorithm for Fuzzy Description Logics over Residuated De Morgan Lattices , 2012, RR.

[3]  Umberto Straccia,et al.  Web Reasoning and Rule Systems , 2012, Lecture Notes in Computer Science.

[4]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[5]  John Yen,et al.  Generalizing Term Subsumption Languages to Fuzzy Logic , 1991, IJCAI.

[6]  Rafael Peñaloza,et al.  On the Undecidability of Fuzzy Description Logics with GCIs and Product T-norm , 2011, FroCoS.

[7]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.

[8]  Àngel García-Cerdaña,et al.  Fuzzy Description Logics and t-norm based fuzzy logics , 2010, Int. J. Approx. Reason..

[9]  Diego Calvanese,et al.  The description logic handbook: theory , 2003 .

[10]  Umberto Straccia,et al.  On the (un)decidability of fuzzy description logics under Łukasiewicz t-norm , 2013, Inf. Sci..

[11]  Petr Hájek,et al.  Making fuzzy description logic more general , 2005, Fuzzy Sets Syst..

[12]  Umberto Straccia,et al.  A Computationally Tractable Terminological Logic , 1991, SCAI.

[13]  Rafael Peñaloza,et al.  Undecidability of Fuzzy Description Logics , 2012, KR.

[14]  Umberto Straccia,et al.  Foundations of Fuzzy Logic and Semantic Web Languages , 2013, CILC.

[15]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[16]  Lluis Godo,et al.  Monoidal t-norm based logic: towards a logic for left-continuous t-norms , 2001, Fuzzy Sets Syst..

[17]  Rafael Peñaloza,et al.  How Fuzzy Is My Fuzzy Description Logic? , 2012, IJCAR.

[18]  H. Kuhn.  The Hungarian method for the assignment problem , 1955 .

[19]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[20]  P. Mostert,et al.  On the Structure of Semigroups on a Compact Manifold With Boundary , 1957 .

[21]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.