scientific article; zbMATH DE number 1533821
From MaRDI portal
Publication:4517034
The purpose of the article is to study algorithms for realization of transformations of formulas in Boolean algebras. Basic transformations, such as evaluation of minimum forms and applications of rules, are considered. Their realization is implemented by means of the FABULA computer algebra system. For the entire collection see [Zbl 0944.00028].
Recommendations
- System of transformations of certain representations of Boolean functions
- Minimization of Boolean functions in the basis OR-NOT (AND-NOT)
- Transformations of discrete functions calculation algorithms to Boolean equations
- Relational Methods in Computer Science
- scientific article; zbMATH DE number 3864540
Cited in
(6)- Transformations of discrete functions calculation algorithms to Boolean equations
- A tool for evaluating solution economy of algebraic transformations
- A mechanism of uncovering of quantifiers in Boolean variables
- How to augment a formal system with a Boolean algebra component
- FABULA
- scientific article; zbMATH DE number 474729 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517034)