Towards a Notion of Basis for Knowledge-Based Systems—Applications

Abstract

In the paradigm of Knowledge-Based Systems (KBS), the design of methods to simplify the reasoning leads to more efficient processes. A point of view that provides valuable insights is the algebraic one. In this work, a notion of basis (and dimension) for Knowledge Bases in Propositional Logic associated with knowledge forgetting is introduced. It is based on ideas that come from the translation of such logic in (Computer) Algebra, particularly from the interpretation of variable forgetting. In this paper, the concept of weak base is defined as a set of variables sufficient to decide the consistency using variable forgetting. Several applications of weak bases are presented in order to show their usefulness in KBS reasoning and to justify their study and use in solving problems within this topic.

A Logical–Algebraic Approach to Revising Formal Ontologies: Application in Mereotopology

“…The reason is that the designer aims to represent in E all the information to be preserved in the extensions, even if some of it is redundant to satisfy both properties of the above definition. If this was not the case, the application of techniques developed in [108] would allow (after passing to propositional formulas) us to reduce the size of the skeleton if necessary while preserving the information. Theorem 1.…”

A Prototype of a Decision Support System for Equine Cardiovascular Diseases Diagnosis and Management

“…There are recent innovative approaches in the line of research of algebraization of logic and RBES such as [19,20].…”