Satisfiability of Formulas from the Standpoint of Object Classification: The RST Approach

Issue title: Concurrency Specification and Programming (CS&P)

Article type: Research Article

Authors: Gomolińska, Anna

Affiliations: Department of Mathematics Białystok University Akademicka 2, 15267 Białystok, Poland. anna.gom@math.uwb.edu.pl

Note: [] Address for correspondence: Department of Mathematics, Białystok University, Akademicka 2, 15267 Białystok, Poland

Abstract: In this article we discuss judgment of satisfiability of formulas of a knowledge representation language as an object classification task. Our viewpoint is that of the rough set theory (RST), and the descriptor language for Pawlak's information systems of a basic kind is taken as the study case. We show how certain analogy-based methods can be employed to judge satisfiability of formulas of that language.

Keywords: satisfiability of formulas, valuation, object classification, Pawlak's information system, descriptor language, analogy-based reasoning

Journal: Fundamenta Informaticae, vol. 85, no. 1-4, pp. 139-153, 2008