351 search results - page 5 / 71 » On the Learnability of Boolean Formulae |
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In this paper we define a class of truth-value assignments, called bounded assignments, using a certain substitutional property. We show that every satisfiable Boolean ...
LICS
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper presents a decidable characterization of tree languages that can be defined by a boolean combination of Σ1 formulas. This is a tree extension of the Simon theorem,...
CP
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. In this paper we consider the problem of computing the density of states of a Boolean formula in CNF, a generalization of both MAX-SAT and model counting. Given a Boolean...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...
DAM
2008
13 years 7 months ago
2008
We consider {0, 1}n as a sample space with a probability measure on it, thus making pseudo-Boolean functions into random variables. We then derive explicit formulas for approximat...