A continuous approach to inductive inference
Mathematical Programming: Series A and B
Logic Minimization Algorithms for VLSI Synthesis
Logic Minimization Algorithms for VLSI Synthesis
Principles in the Evolutionary Design of Digital Circuits—Part I
Genetic Programming and Evolvable Machines
A Probabilistic 3-SAT Algorithm Further Improved
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Design of combinational logic circuits through an evolutionary multiobjective optimization approach
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Finding Efficient Circuits Using SAT-Solvers
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Finding efficient circuits for ensemble computation
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Optimization principles for arithmetic functions in hardware-software co-design
Proceedings of the Winter Simulation Conference
| Hi-index | 0.00 |
We present a systematic procedure to synthesise and minimise digital circuits using propositional satisfiability. After encoding the truth table into a canonical sum of at most k different products, we seek its minimal satisfiable representation. We show how to use an interesting local search landscape for this minimisation. This approach can be very useful since we can generate exact minimal solutions within reasonably computational resources.