From ONTOLORE

In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. Practical reasoning techniques for ontologies therefore will have to be tolerant to this kind of data, including the ability to handle inconsistencies in a meaningful way. For this purpose, we employ paraconsistent reasoning based on four-valued logic, which is a classical method for dealing with inconsistencies in knowledge bases.

The ParOWL Paraconsistent OWL Reasoner

• The approach is described in Yue Ma, Pascal Hitzler, Zuoquan Lin, Algorithms for Paraconsistent Reasoning with OWL, In: Enrico Franconi, Michael Kifer, Wolfgang May (Eds.), The Semantic Web: Research and Applications. Proceedings of the 4th European Semantic Web Conference, ESWC2007, Innsbruck, Austria, June 2007. Springer Lecture Notes in Computer Science 4519, pp. 399-413.

• The ParOWL Reasoner is publicly available. It is based on KAON2.

Paraconsistent Reasoning Algorithms

• An alternative algorithmisation for the same paraconsistent semantics as realised in ParOWL, based on resolution, has been described in Yue Ma, Pascal Hitzler, Zuoquan Lin, Paraconsistent Resolution for Four-valued Description Logics. In: Diego Calvanese, Enrico Franconi, Volker Haarslev, Domenico Lembo, Boris Motik, Anni-Yasmin Turhan, Sergio Tessaris, Proceedings of the 2007 International Workshop on Description Logics (DL-2007), Brixen-Bressanone, Italy, June 2007. CEUR Workshop Proceedings Vol-250, 2007.
• The approach has been lifted to more expressive DLs in Yue Ma, Pascal Hitzler, Zuoquan Lin, Paraconsistent Reasoning for Expressive and Tractable Description Logics. In: Franz Baader, Carsten Lutz, Boris Motik, Proceedings of the 21st International Workshop on Description Logics, DL2008, Dresden, Germany, May 2008. CEUR Workshop Proceedings Vol. 353, 2008.

Navigation

• up: <ask>Paraconsistent reasoning</ask>