351 search results - page 49 / 71 » On the Learnability of Boolean Formulae |
ISCIS
2009
Springer
15 years 4 months ago
2009
Springer
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
102
click to vote
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
FOCS
2003
IEEE
15 years 3 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
101
click to vote
RTSS
1997
IEEE
15 years 1 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
70
Voted
ICCAD
1996
IEEE
15 years 1 months ago
1996
IEEE
A new method is presented to compute the exact observability don't cares (ODC) for multilevel combinational circuits. A new mathematical concept, called polarization, is intr...