472 search results - page 6 / 95 » Limiting Negations in Formulas |
JSAT
2006
13 years 7 months ago
2006
Several propositional fragments have been considered so far as target languages for knowledge compilation and used for improving computational tasks from major AI areas (like infe...
TYPES
2007
Springer
14 years 1 months ago
2007
Springer
We consider propositional formulas built on implication. The size of a formula is the number of occurrences of variables in it. We assume that two formulas which differ only in th...
ICIP
1998
IEEE
14 years 9 months ago
1998
IEEE
: An explicit formula is presented for reconstructing a This article derives an explicit formula for the integer values finite-support object defined on a lattice of points and tak...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
A model for learning in the limit is defined where a (so-called iterative) learner gets all positive examples from the target language, tests every new conjecture with a teacher ...
JSAT
2010
13 years 2 months ago
2010
Groote and Zantema proved that a particular OBDD computation of the pigeonhole formula has exponential size, and that limited OBDD derivations cannot simulate resolution polynomia...