An algorithm to generate prime implicants and its application to the selection problem
From MaRDI portal
Publication:2557226
DOI10.1016/S0020-0255(72)80014-8zbMath0251.94037OpenAlexW2071888360MaRDI QIDQ2557226
Publication date: 1972
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0255(72)80014-8
Search theory (90B40) Classical propositional logic (03B05) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04) Software, source code, etc. for problems pertaining to information and communication theory (94-04)
Cites Work
- Simplest normal truth functions
- Branch-and-Bound Methods: A Survey
- A New Algorithm for Generating Prime Implicants
- On Cores and Prime Implicants of Truth Functions
- An Application of Symbolic Logic to a Selection Problem
- Application of game tree searching techniques to sequential pattern recognition
- Experiments With Some Programs That Search Game Trees
This page was built for publication: An algorithm to generate prime implicants and its application to the selection problem