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.