Fundamenta Informaticae · 1991 · 93 citations · 0 references
EngineeringKnowledge ExtractionKnowledge-based ReasoningSemanticsSemantic WebModal LogicInformation RetrievalPaper MlsimComputational LinguisticsFirst Order SentencesLanguage StudiesKnowledge RepresentationKnowledge DiscoverySimilarity RelationsComputer ScienceComplete Finite AxiomatizationKnowledge BaseSubstructural LogicKnowledge ModelingAutomated ReasoningAlgebraic SemanticsFormal MethodsFirst-order LogicKnowledge CompilationFinite Model Theory
One of the main results of the paper is a characterization of certain kind similarity relations in Pawlak knowledge representation systems by means of first order sentences. As an application we obtain a complete finite axiomatization of the corresponding poly modal logic, called in the paper MLSim. It is proved that MLSim possesses finite model property and is decidable.