125 search results - page 3 / 25 » Boolean Satisfiability with Transitivity Constraints |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We analyze judgement aggregation problems in which a group of agents independently votes on a set of complex propositions that has some interdependency constraint between them (e....
ECCC
2010
13 years 5 months ago
2010
We study the approximability of two natural Boolean constraint satisfaction problems: Horn satisfiability and exact hitting set. Under the Unique Games conjecture, we prove the fo...
CORR
1999
Springer
13 years 5 months ago
1999
Springer
A variational approach to finite connectivity spin-glass-like models is developed and applied to describe the structure of optimal solutions in random satisfiability problems. Our ...
TSP
2008
13 years 5 months ago
2008
Probabilistic Boolean networks (PBNs) have been recently introduced as a paradigm for modeling genetic regulatory networks. One of the objectives of PBN modeling is to use the netw...
TACAS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...