351 search results - page 16 / 71 » On the Learnability of Boolean Formulae |
141
click to vote
COCO
2007
Springer
15 years 11 months ago
2007
Springer
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
127
click to vote
DNA
2005
Springer
15 years 10 months ago
2005
Springer
We introduce a class of generalized DNF formulae called wDNF or weighted disjunctive normal form, and present a molecular algorithm that learns a wDNF formula from training example...
146
click to vote
FOIKS
2004
Springer
15 years 10 months ago
2004
Springer
We introduce a simple and practically efficient method for repairing inconsistent databases. The idea is to properly represent the underlying problem, and then use off-the-shelf a...
142
click to vote
ECAI
2008
Springer
15 years 6 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...
193
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....