351 search results - page 21 / 71 » On the Learnability of Boolean Formulae |
ILP
2003
Springer
14 years 26 days ago
2003
Springer
We study several complexity parameters for first order formulas and their suitability for first order learning models. We show that the standard notion of size is not captured by...
ICLP
2001
Springer
14 years 4 days ago
2001
Springer
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
B
1998
Springer
13 years 12 months ago
1998
Springer
Let predicate P be converted from Boolean to numeric type by writing P , with false being 0 and true being 1, so that in a degenerate sense P can be regarded as `the probability th...
LPAR
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. We describe a novel decision procedure for Quantified Boolean Formulas (QBFs) which aims to unleash the hidden potential of quantified reasoning in applications. The Sk...
CAV
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...