Paraconsistent Logic Programs with Four-Valued Rough Sets
This paper presents a language for defining four-valued rough sets and to reason about them. Our framework brings together two major fields: rough sets and paraconsistent logic programming. On the one hand it provides a paraconsistent approach, based on four-valued rough sets, for integrating knowledge from different sources and reasoning in the presence of inconsistencies. On the other hand, it also caters for a specific type of uncertainty that originates from the fact that an agent may perceive different objects of the universe as being indiscernible. This paper extends the ideas presented in . Our language allows the user to define similarity relations and use the approximations induced by them in the definition of other four-valued sets. A positive aspect is that it allows users to tune the level of uncertainty or the source of uncertainty that best suits applications.
KeywordsLogic Programming Boundary Case Paraconsistent Logic Ground Instance Rule Language
Unable to display preview. Download preview PDF.
- 2.Belnap, N.: A useful four-valued logic. In: Epstein, G., Dunn, J.M. (eds.) Modern Uses of Many Valued Logic, pp. 8–37. Reidel (1977)Google Scholar
- 3.Damásio, C.V., Pereira, L.M.: A survay of paraconsistent semantics for logic programs. In: Gabbay, D.M., Smets, P. (eds.) Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 2, pp. 241–320. Kluwer Academic Publishers, Dordrecht (1998)Google Scholar
- 6.Ginsberg, M.: Multivalued logics: a uniform approach to reasoning in AI. Computational Intelligence 4, 256–316 (1988)Google Scholar