351 search results - page 12 / 71 » On the Learnability of Boolean Formulae |
130
click to vote
JAIR
2006
15 years 4 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
143
click to vote
TCC
2005
Springer
15 years 10 months ago
2005
Springer
Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an en...
125
click to vote
ALT
2000
Springer
15 years 8 months ago
2000
Springer
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
122
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
142
click to vote
FM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. The paper introduces the construct of temporal testers as a compositional basis for the construction of automata corresponding to temporal formulas in the PSL logic. Temp...