Paraconsistent Rough Description Logic

Abstract. In this paper, we introduce a paraconsistent extension of Rough Description Logics which allows the representation of incomplete and contradictory concepts, as well as the lower and upper approximations of these kinds of concepts. Furthermore, we use the notions of approximations, which can be applied successively, to make restrictions or relaxations in the concept queries with the objective of decreasing or increasing the number of results of the queries, respectively.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Henrique Viana, João Alcântara, Ana Teresa C. Martins
• Keywords: Automated Reasoning, Concept Queries, Description Logics, DLOG 2011, Rough Description