503 search results - page 18 / 101 » Interpolative Boolean Logic |
CORR
2008
Springer
14 years 11 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
102
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Phenomenological information about regulatory interactions is frequently available and can be readily converted to Boolean models. Fully quantitative models, on the ot...
LOGCOM
2006
14 years 11 months ago
2006
For every Kripke complete modal logic L we define its hybrid companion LH . For a reasonable class of logics, we present a satisfiability-preserving translation from LH to L. We p...
MFCS
2009
Springer
15 years 6 months ago
2009
Springer
Let C be a threshold logic circuit computing a Boolean function MODm : {0, 1}n → {0, 1}, where n ≥ 1 and m ≥ 2. Then C outputs “0” if the number of “1”s in an input ...
DBPL
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. We present a simple Data Mining Logic (DML) that can express common data mining tasks, like “Find Boolean association rules” or “Find inclusion dependencies.” At ...