• Analytics-based decomposition of a class of bilevel problems 

  Fajemisin, Adejuyigbe; Climent, Laura; Prestwich, Steven D. (Springer Nature Switzerland AG, 2019-06-15)

  This paper proposes a new class of multi-follower bilevel problems. In this class the followers may be nonlinear, do not share constraints or variables, and are at most weakly constrained. This allows the leader variables ...
• Modelling Dynamic Programming-based global constraints in Constraint Programming 

  Visentin, Andrea; Prestwich, Steven D.; Rossi, Roberto; Tarim, Armagan (Springer Nature Switzerland AG, 2019-06-15)

  Dynamic Programming (DP) can solve many complex problems in polynomial or pseudo-polynomial time, and it is widely used in Constraint Programming (CP) to implement powerful global constraints. Implementing such constraints ...
• Relating the structure of a problem and its explanation 

  Freuder, Eugene C. (Association for the Advancement of Artificial Intelligence (AAAI), 2019-01)

  As AI becomes more ubiquitous there is increasing interest in computers being able to provide explanations for their conclusions. This paper proposes exploring the relationship between the structure of a problem and its ...
• Constrainedness in stable matching 

  Escamocher, Guillaume; O'Sullivan, Barry (Institute of Electrical and Electronics Engineers (IEEE), 2018-12-17)

  In constraint satisfaction problems, constrainedness provides a way to predict the number of solutions: for instances of a same size, the number of constraints is inversely correlated with the number of solutions. However, ...
• A Linked Data browser with recommendations 

  Durao, Frederico; Bridge, Derek G. (Institute of Electrical and Electronics Engineers (IEEE), 2018-12-17)

  It is becoming more common to publish data in a way that accords with the Linked Data principles. In an effort to improve the human exploitation of this data, we propose a Linked Data browser that is enhanced with ...

View more