期刊
MATHEMATICS
卷 9, 期 3, 页码 -出版社
MDPI
DOI: 10.3390/math9030252
关键词
knowledge-based systems; computer algebra; variable forgetting; conservative retraction
类别
资金
- State Investigation Agency (Agencia Estatal de Investigacion) [PID2019-109152GB-I00/AEI/10.13039/501100011033]
In the paradigm of Knowledge-Based Systems, designing methods to simplify reasoning through an algebraic perspective can lead to more efficient processes. This work introduces the notion of basis and dimension for Knowledge Bases in Propositional Logic associated with knowledge forgetting, based on the translation of logic into Computer Algebra. The concept of weak base, defined as a set of variables sufficient for consistency decisions using variable forgetting, is presented along with its applications in KBS reasoning.
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据