论文信息 - A Tractable Paraconsistent Fuzzy Description Logic

A Tractable Paraconsistent Fuzzy Description Logic

In this paper, we introduce the tractable pf-EL++ logic, a paraconsistent version of the fuzzy logic f-EL++. Within pf-EL++, it is possible to tolerate contradictions under incomplete and vague knowledge. pf-EL++ extends the f-EL++ language with a paraconsistent negation in order to represent contradictions. This paraconsistent negation is defined under Belnap's bilattices. It is important to observe that pf -EL++ is a conservative extension of f-EL++, thus assuring that the polynomial-time reasoning algorithm used in f-EL++ can also be used in pf -EL++.

Henrique Viana | João F. L. Alcântara | Ana Teresa C. Martins | Thiago Alves Rocha

[1] Franz Baader,et al. Pushing the EL Envelope , 2005, IJCAI.

[2] Pascal Hitzler,et al. Paraconsistent Reasoning for Expressive and Tractable Description Logics , 2008, Description Logics.

[3] Matthew L. Ginsberg,et al. Multivalued logics: a uniform approach to reasoning in artificial intelligence , 1988, Comput. Intell..

[4] Giorgos Stoilos,et al. Tractable Reasoning Based on the Fuzzy EL++ Algorithm , 2008, URSW.

[5] Jeff Z. Pan,et al. Classifying Fuzzy Subsumption in Fuzzy-EL+ , 2008, Description Logics.

[6] Nuel D. Belnap,et al. A Useful Four-Valued Logic , 1977 .

[7] Diego Calvanese,et al. The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[8] Pascal Hitzler,et al. Algorithms for Paraconsistent Reasoning with OWL , 2007, ESWC.