A natural language for implementing algebraically Expert Systems

According to previous mathematical results, Expert Systems can be quickly and easily implemented on specialized mathematical software (‘Computer Algebra Systems’). These mathematical results provide two equivalent different approaches to implement algebraically Expert Systems: one based on propositional Boolean logic and another based on the ‘concept–attribute–value’ representation paradigm. Both approaches are equivalent in the sense that every Expert System implemented through one algebraic approach can be also implemented on the other algebraic approach. However, the performance of these algebraic approaches depend on the specific Expert System, and therefore, the Expert System must be implemented in both algebraic approaches in order to compare their performances. In this paper we have designed a natural language to implement algebraically Expert Systems which provides these three main advantages: we can implement directly any Expert System in both algebraic approach since our language is independent of the algebraic approach used; we can use any Computer Algebra System since our language is independent of the Computer Algebra System used; and we do not need to be acquainted with specialized abstract mathematical concepts like Groebner bases or normal forms since our language is natural and does not make use of these concepts.