351 search results - page 19 / 71 » On the Learnability of Boolean Formulae |
CADE
2002
Springer
14 years 8 months ago
2002
Springer
We show that a conjunctive normal form (CNF) formula F is unsatisfiable iff there is a set of points of the Boolean space that is stable with respect to F. So testing the satisfiab...
ALT
2002
Springer
14 years 4 months ago
2002
Springer
The general dimension is a combinatorial measure that characterizes the number of queries needed to learn a concept class. We use this notion to show that any p-evaluatable concep...
FCS
2007
13 years 9 months ago
2007
Instances of the futile questioning problem abound in applications, especially, in the area of artificial intelligence. The problem can be represented by a particular quantified ...
JSAT
2010
13 years 2 months ago
2010
This paper is devoted to investigate resolution for quantified generalized clause-sets (QCLS). The soundness and refutation completeness are proved. Then quantified generalized Ho...
IANDC
2006
13 years 7 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT