Sciweavers

62 search results - page 12 / 13
» The Complexity of the Warranted Formula Problem in Propositi...
Sort
View
ATAL
2009
Springer
14 years 2 months ago
Boolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be ...
Piotr Faliszewski, Edith Elkind, Michael Wooldridg...
CSL
2007
Springer
14 years 1 months ago
Game Characterizations and the PSPACE-Completeness of Tree Resolution Space
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...
Alexander Hertel, Alasdair Urquhart
AAAI
2008
13 years 9 months ago
Lifted First-Order Belief Propagation
Unifying first-order logic and probability is a long-standing goal of AI, and in recent years many representations combining aspects of the two have been proposed. However, infere...
Parag Singla, Pedro Domingos
SAS
2010
Springer
149views Formal Methods» more  SAS 2010»
13 years 5 months ago
Boxes: A Symbolic Abstract Domain of Boxes
Symbolic Abstract Domain of Boxes Arie Gurfinkel and Sagar Chaki Carnegie Mellon University Abstract. Numeric abstract domains are widely used in program analyses. The simplest nu...
Arie Gurfinkel, Sagar Chaki
AAAI
2006
13 years 9 months ago
A BDD-Based Polytime Algorithm for Cost-Bounded Interactive Configuration
Interactive configurators are decision support systems assisting users in selecting values for parameters that respect given constraints. The underlying knowledge can be convenien...
Tarik Hadzic, Henrik Reif Andersen