351 search results - page 61 / 71 » On the Learnability of Boolean Formulae |
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
We present a general framework for logics of transition systems based on Stone duality. Transition systems are modelled as coalgebras for a functor T on a category X. The propositi...
DNA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Speed of computation and power consumption are the two main parameters of conventional computing devices implemented in microelectronic circuits. As performance of such d...
FORMATS
2004
Springer
14 years 1 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. During the recent years, the development of tools for deciding Quantified Boolean Formulas (QBFs) has been accompanied by a steady supply of real-world instances, i.e., ...
STACS
2004
Springer
14 years 1 months ago
2004
Springer
We present two simple algorithms for SAT and prove upper bounds on their running time. Given a Boolean formula F in conjunctive normal form, the first algorithm finds a satisfyin...