472 search results - page 9 / 95 » Limiting Negations in Formulas |
186
click to vote
DAGSTUHL
1996
15 years 7 months ago
1996
An analysis method for specialization of imperative programs is described in this paper. This analysis is an inter-procedural data flow method operating on control flow graphs and...
186
click to vote
ICANN
2003
Springer
15 years 11 months ago
2003
Springer
The development of microarray technology has supplied a large volume of data to many fields. In particular, it has been applied to prediction and diagnosis of cancer, so that it ex...
141
click to vote
JANCL
2008
15 years 5 months ago
2008
ABSTRACT. In [CON 06b] we introduced the algorithm SQEMA for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general corresp...
137
click to vote
FOCS
2007
IEEE
16 years 5 days ago
2007
IEEE
We show that any k-wise independent probability distribution on {0, 1}n O(m2.22− √ k/10)fools any boolean function computable by an m-clause DNF (or CNF) formula on n variable...
158
click to vote
AAAI
2008
15 years 8 months ago
2008
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all ...