707 search results - page 88 / 142 » The Nonhomomorphicity of Boolean Functions |
146
Voted
AB
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. In 1973 R. Thomas introduced a logical approach to modeling and analysis of bioregulatory networks. Given a set of Boolean functions describing the regulatory interaction...
134
Voted
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
138
Voted
ICLP
2007
Springer
15 years 9 months ago
2007
Springer
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
146
Voted
CALCO
2005
Springer
15 years 9 months ago
2005
Springer
Every endofunctor B on the category Set can be lifted to a fibred functor on the category (fibred over Set) of equivalence relations and relation-preserving functions. In this pa...
121
Voted
ICALP
2005
Springer
15 years 9 months ago
2005
Springer
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...