1 | -- | 3 | Lisa Hellerstein, Lev Reyzin, György Turán. Foreword |
5 | -- | 24 | André Abramé, Djamal Habet, Donia Toumi. Improving configuration checking for satisfiable random k-SAT instances |
25 | -- | 44 | Balasim Al-Saedi, Olivier Fourdrinoy, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs. About some UP-based polynomial fragments of SAT |
45 | -- | 75 | Salem Benferhat, Zied Bouraoui, Odile Papini, Eric Würbel. Prioritized assertional-based removed sets revision of DL-Lite belief bases |
77 | -- | 128 | Natalia Flerova, Radu Marinescu 0002, Rina Dechter. Weighted heuristic anytime search: new schemes for optimization over graphical models |
129 | -- | 144 | Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi. Boosting conditional probability estimators |
145 | -- | 162 | Utz-Uwe Haus, Carla Michini. Compact representations of all members of an independence system |
163 | -- | 179 | Gabriele Kern-Isberner, Marco Wilhelm, Christoph Beierle. Probabilistic knowledge representation using the principle of maximum entropy and Gröbner basis theory |
181 | -- | 203 | Seishi Ouchi, Tomohiko Okayama, Keisuke Otaki, Ryo Yoshinaka, Akihiro Yamamoto. Learning concepts and their unions from positive data with refinement operators |
205 | -- | 227 | Xia Qu, Prashant Doshi. On the role of fairness and limited backward induction in sequential bargaining games - New behavioral models and analyses |
229 | -- | 244 | Takahisa Toda. Dualization of boolean functions using ternary decision diagrams |
245 | -- | 266 | Piotr J. Wojciechowski, Pavlos Eirinakis, K. Subramani. Analyzing restricted fragments of the theory of linear arithmetic |