Skip to main content
Conference ProceedingsOPEN ACCESS

Rough contraction through partial meets

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2005) 3776 LNCS 726-731
DOI: 10.1007/11590316_117
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The paper addresses the problem of constructing rough belief change functions. Contraction and revision postulates using the notion of rough consequence and rough consistency have been proposed in [2]. The base logic is a reasoning framework ℒ-R, that has a semantics of rough truth. We demonstrate here that functions satisfying the contraction postulates can be constructed through the method of partial meets [1]. As a result, a construction of rough revision functions is also obtained. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Banerjee, M., & Singh, P. (2005). Rough contraction through partial meets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 726–731). https://doi.org/10.1007/11590316_117

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free