351 search results - page 64 / 71 » On the Learnability of Boolean Formulae |
BVAI
2007
Springer
13 years 9 months ago
2007
Springer
This paper presents the implementation of ARQ-PROP II, a limited-depth propositional reasoner, via the compilation of its specification into an exact formulation using the satyrus...
CPAIOR
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. The stochastic satisfiability modulo theories (SSMT) problem is a generalization of the SMT problem on existential and randomized (aka. stochastic) quantification over di...
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
An important drawback to the popular Belief, Desire, and Intentions (BDI) paradigm is that such systems include no element of learning from experience. In particular, the so-calle...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background. This paper attempts ...
JAR
2006
13 years 7 months ago
2006
Abstract. As products are growing more complex, so is their documentation. With an increasing number of product options, the diversity in service and maintenance procedures grows a...