91 search results - page 13 / 19 » On Computing Backbones of Propositional Theories |
108
click to vote
CAV
2012
Springer
13 years 2 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...
CIE
2007
Springer
15 years 5 months ago
2007
Springer
The intuition guiding the de…nition of computation has shifted over time, a process that is re‡ected in the changing formulations of the Church-Turing thesis. The theory of co...
101
click to vote
AAAI
2004
15 years 1 months ago
2004
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
100
click to vote
ATAL
2010
Springer
15 years 24 days ago
2010
Springer
Aggregating the judgments of a group of agents regarding a set of interdependent propositions can lead to inconsistent outcomes. One of the parameters involved is the agenda, the ...
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— We consider the computational complexity and algorithm challenges in designing survivable access networks. With limited routing capability, the structure of an access n...