351 search results - page 31 / 71 » On the Learnability of Boolean Formulae |
FLAIRS
2008
13 years 10 months ago
2008
In this paper we describe a class of a problem of goal satisfaction in mutual exclusion network that can be solved in polynomial time. This problem provides a common basis for rea...
ALENEX
2009
13 years 8 months ago
2009
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In MaxSat, we ask for an assignment which satisfies the maximum number of clauses for a boolean formula in CNF. We present an algorithm yielding a run time upper bound of O (2 K 6....
ECCC
2010
13 years 7 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
ENTCS
2007
13 years 7 months ago
2007
We introduce a class of coalgebraic models and a family of modal logics that support the speci cation of spatial properties of distributed applications. The evaluation of a formul...