Sciweavers

351 search results - page 9 / 71
» On the Learnability of Boolean Formulae
Sort
View
JEA
2007
62views more  JEA 2007»
13 years 7 months ago
Symmetry breaking for pseudo-Boolean formulas
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
SIAMDM
2002
42views more  SIAMDM 2002»
13 years 7 months ago
Testing Basic Boolean Formulae
Michal Parnas, Dana Ron, Alex Samorodnitsky
JCSS
2011
75views more  JCSS 2011»
13 years 2 months ago
The complexity of Boolean formula minimization
David Buchfuhrer, Christopher Umans
LPAR
2005
Springer
14 years 1 months ago
Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination
Separation logic is a subset of the quantifier-free first order logic. It has been successfully used in the automated verification of systems that have large (or unbounded) inte...
Chao Wang, Franjo Ivancic, Malay K. Ganai, Aarti G...
COLT
1999
Springer
13 years 12 months ago
Uniform-Distribution Attribute Noise Learnability
We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and sho...
Nader H. Bshouty, Jeffrey C. Jackson, Christino Ta...