FIRST-ORDER ROUGH LOGIC I: APPROXIMATE REASONING VIA ROUGH SETS

Article type: Research Article

Authors: Lin, T.Y. | Liu, Qing

Affiliations: Mathematics and Computer Science Department, San José State University, San José, California 95192, U.S.A., E-mail: tylin@sjsumcs.SJSU.EDU | Department of Computer Science. NanChang University. NanChang. Jiangxi 330047. P. R. China

Abstract: Earlier the authors have shown that rough sets can be characterized by six topological properties. In this paper, a new formal logic system based on such axioms is proposed. It will be called First-Order Logic for Rough Approximation or simply Rough Logic. The axiom schemas of rough logic turn out to be the same as those of the modal logic S5. In other words, topological and modal logic considerations led to the same conclusion. So rough logic must have captured the intrinsic meaning of approximate reasoning However, their interpretations are different. To reflect the differences in semantics, possible worlds are renamed as observable worlds. Each observable world represents a different rough observation of the actual world. Rough logic also provides a frame work for approximation. It integrates imperfect observations (observable worlds) into an approximation of actual world. Any good approximation theory should have a convergence theorem-its details are deferred to next paper. A sample theorem is as follows: If there is a convergent sequence of rough observations (namely, equivalence relations), then the corresponding rough models converge to the Tarskian model of first-order classical logic.

DOI: 10.3233/FI-1996-272303

Journal: Fundamenta Informaticae, vol. 27, no. 2-3, pp. 137-153, 1996