➦   Infinitary equilibrium logic and strongly equivalent logic programs

➦   Human–computer negotiation in a three player market setting

➦   Editorial Board

➦   Model-lite planning: Case-based vs. model-based approaches

➦   An initial study of time complexity in infinite-domain constraint satisfaction

➦   Robust planning with incomplete domain models

➦   The virtues of idleness: A decidable fragment of resource agent logic

➦   Graph aggregation

➦   State space search nogood learning: Online refinement of critical-path dead-end detectors in plannin

➦   A unified framework of active transfer learning for cross-system recommendation

➦   Auction optimization using regression trees and linear models as integer programs

➦   Editorial Board

➦   Constraint acquisition

➦   Empirical decision model learning

➦   Automatic construction of parallel portfolios via algorithm configuration

➦   Alors: An algorithm recommender system

➦   Learning Bayesian network parameters under equivalence constraints

➦   Integer Linear Programming for the Bayesian network structure learning problem

➦   Relational linear programming

➦   Learning an efficient constructive sampler for graphs

➦   Semantic-based regularization for learning and inference

➦   Structured learning modulo theories

➦   A flexible ILP formulation for hierarchical clustering

➦   Cost-optimal constrained correlation clustering via weighted partial Maximum Satisfiability

➦   Skypattern mining: From pattern condensed representations to dynamic constraint satisfaction problem

➦   Constrained clustering by constraint programming

➦   MiningZinc: A declarative framework for constraint-based mining

➦   Mining Top-k motifs with a SAT-based framework

➦   Editorial Board

➦   Introduction to the special issue on Combining Constraint Solving with Mining and Learning

➦   CCEHC: An efficient local search algorithm for weighted partial maximum satisfiability

➦   Query efficient posterior estimation in scientific experiments via Bayesian active learning

➦   Editorial Board

➦   The Configurable SAT Solver Challenge (CSSC)

➦   An approach to decision making based on dynamic argumentation systems

➦   Making friends on the fly: Cooperating with new teammates

➦   Efficient symbolic search for cost-optimal planning

➦   Arbitrary arrow update logic

➦   Distributed fair allocation of indivisible goods

➦   A model of language learning with semantics and meaning-preserving corrections

➦   On rejected arguments and implicit conflicts: The hidden power of argumentation semantics

➦   Editorial Board

➦   Finding a collective set of items: From proportional multirepresentation to group recommendation

➦   Generalized mirror descents in congestion games

➦   Computing and restoring global inverse consistency in interactive constraint satisfaction

➦   A parametric propagator for pairs of Sum constraints with a discrete convexity property

➦   A synthesis of automated planning and reinforcement learning for efficient, robust decision-making

➦   Online belief tracking using regression for contingent planning

➦   SAT Race 2015

➦   MultiWiBi: The multilingual Wikipedia bitaxonomy project