351 search results - page 40 / 71 » On the Learnability of Boolean Formulae |
119
click to vote
FROCOS
2009
Springer
15 years 4 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
DFT
2003
IEEE
15 years 3 months ago
2003
IEEE
In this paper, we propose a new concept of testing only functionally testable transition faults in Broadside Transition testing via a novel constrained ATPG. For each functionally...
JSYML
2006
14 years 9 months ago
2006
The quantified relevant logic RQ is given a new semantics in which a formula xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are mo...
COLT
2005
Springer
15 years 3 months ago
2005
Springer
We consider a natural framework of learning from correlated data, in which successive examples used for learning are generated according to a random walk over the space of possibl...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
Design and verification of systems at the Register-Transfer (RT) or behavioral level require the ability to reason at higher levels of abstraction. Difference logic consists of an...