Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Towards monolingual programming environments
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
COSMOS: a compiled simulator for MOS circuits
DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A Parallel Architecture for Discrete Relaxation Algorithm
IEEE Transactions on Pattern Analysis and Machine Intelligence
A satisfiability tester for non-clausal propositional calculus
Information and Computation
Search: A survey of recent results
Exploring artificial intelligence
Introduction to VLSI Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Global Optimization for Satisfiability (SAT) Problem
IEEE Transactions on Knowledge and Data Engineering
PROVIDE: A Process Visualization and Debugging Environment
IEEE Transactions on Software Engineering
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Constraint-Based Searching: Algorithms and Architectures
Constraint-Based Searching: Algorithms and Architectures
Logic simulation using networks of state machines
DATE '00 Proceedings of the conference on Design, automation and test in Europe
SemCast: Semantic Multicast for Content-Based Data Dissemination
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
Formal Methods in System Design
| Hi-index | 0.00 |
We present a Unison algorithm to evaluate arbitrarily complex Boolean expressions. This novel algorithm, based on the total differential of a Boolean function, enables fast evaluation of Boolean expressions in software. Any combination of Boolean operations can be packed into the bits of one computer word and evaluated in parallel by bitwise logical operations. Sample runs of the Unison algorithm show that many Boolean operations can evaluated in one clock cycle. The Unison algorithm is able to evaluate Boolean expressions at an execution speed that is comparable to compiled evaluation while retaining the flexibility of interpreted approaches. The algorithm lends itself well to many practical applications.