351 search results - page 35 / 71 » On the Learnability of Boolean Formulae |
132
click to vote
STOC
2003
ACM
16 years 5 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...
162
Voted
TACAS
2007
Springer
15 years 11 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...
164
click to vote
CORR
2010
Springer
15 years 2 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 ...
139
click to vote
FORMATS
2005
Springer
15 years 10 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 ...
157
click to vote
AAAI
1990
15 years 6 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. ...