Published: 2012-09-01

The Tractability of CSP Classes Defined by Forbidden Patterns

D. A. Cohen, M. C. Cooper, P. Creed, D. Marx, A. Z. Salamon

47-78

An approximative inference method for solving ∃∀SO satisfiability problems

H. Vlaeminck, J. Vennekens, M. Denecker, M. Bruynooghe

79-124

Coalition Structure Generation over Graphs

T. Voice, M. Polukarov, N. R. Jennings

165-196

Transforming Graph Data for Statistical Relational Learning

R. A. Rossi, L. K. McDowell, D. W. Aha, J. Neville

363-441

A New Look at BDDs for Pseudo-Boolean Constraints

I. Abío, R. Nieuwenhuis, A. Oliveras, E. Rodríguez-Carbonell, V. Mayer-Eichberger

443-480

Complexity of Judgment Aggregation

U. Endriss, U. Grandi, D. Porello

481-514

Learning to Predict from Textual Data

K. Radinsky, S. Davidovich, S. Markovitch

641-684

Tractable Set Constraints

M. Bodirsky, M. Hils

731-759