503 search results - page 88 / 101 » Interpolative Boolean Logic |
112
click to vote
FUZZIEEE
2007
IEEE
15 years 8 months ago
2007
IEEE
— The application of Qualitative Reasoning to Learning Algorithms can provide these models with the capability of automate common-sense and expert reasoning. Learning algorithms ...
115
click to vote
IJCNN
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— This paper presents the use of a newly created network structure known as a Self-Delaying Dynamic Network (SDN). The SDNs were created to process data which varies with...
106
click to vote
DAC
2007
ACM
16 years 3 months ago
2007
ACM
The ability of modern SAT solvers to produce proofs of unsatisfiability for Boolean formulas has become a powerful tool for EDA applications. Proofs are generated from a resolve t...
101
click to vote
DAC
2003
ACM
16 years 3 months ago
2003
ACM
In some cases, minimum Sum-Of-Products (SOP) expressions of Boolean functions can be derived by detecting decomposition and observing the functional properties such as unateness, ...
127
click to vote
DAC
2004
ACM
16 years 3 months ago
2004
ACM
Bounded Model Checking (BMC) relies on solving a sequence of highly correlated Boolean satisfiability (SAT) problems, each of which corresponds to the existence of counter-example...