351 search results - page 35 / 71 » On the Learnability of Boolean Formulae |
STOC
2003
ACM
14 years 8 months ago
2003
ACM
A real multivariate polynomial p(x1, . . . , xn) is said to sign-represent a Boolean function f : {0, 1}n {-1, 1} if the sign of p(x) equals f(x) for all inputs x {0, 1}n. We gi...
TACAS
2007
Springer
14 years 1 months ago
2007
Springer
ion Randal E. Bryant1 , Daniel Kroening2 , Jo¨el Ouaknine3 , Sanjit A. Seshia4 , Ofer Strichman5 , and Bryan Brady4 1 Carnegie Mellon University, Pittsburgh 2 ETH Z¨urich 3 Oxfor...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
FORMATS
2005
Springer
14 years 1 months ago
2005
Springer
We define quantitative similarity functions between timed transition systems that measure the degree of closeness of two systems as a real, in contrast to the traditional boolean ...
AAAI
1990
13 years 9 months ago
1990
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. ...