341 search results - page 40 / 69 » Learning to satisfy |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we present a new way to preprocess Boolean formulae in Conjunctive Normal Form (CNF). In contrast to most of the current pre-processing techniques, our app...
ESANN
2008
13 years 9 months ago
2008
This paper presents a review of methodology for semi-supervised modeling with kernel methods, when the manifold assumption is guaranteed to be satisfied. It concerns environmental ...
SPLC
2008
13 years 9 months ago
2008
NASA is, with the rest of industry, turning to product-line engineering to reduce costs and improve quality by effectively managing reuse. Experience in industry has shown that it...
AAAI
1997
13 years 9 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
IJMMS
2006
13 years 7 months ago
2006
In this paper, we evaluate mass knowledge acquisition using modified ALICE chatterbots. In particular we investigate the potential of allowing subjects to modify chatterbot respon...