• A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences 

  Cseh, Ágnes; Escamocher, Guillaume; Genç, Begüm; Quesada, Luis (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021-10-15)

  We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under diverse configurations. While several constraint models have been proposed ...
• Positive and negative length-bound reachability constraints 

  Quesada, Luis; Brown, Kenneth N. (Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021-10-15)

  In many application problems, including physical security and wildlife conservation, infrastructure must be configured to ensure or deny paths between specified locations. We model the problem as sub-graph design subject ...
• Ethical data curation for AI: An approach based on feminist epistemology and critical theories of race 

  Leavy, Susan; Siapera, Eugenia; O'Sullivan, Barry (Association for Computing Machinery, 2021-05-19)

  The potential for bias embedded in data to lead to the perpetuation of social injustice though Artificial Intelligence (AI) necessitates an urgent reform of data curation practices for AI systems, especially those based ...
• Efficient exact computation of setwise minimax regret for interactive preference elicitation 

  Toffano, Federico; Viappiani, Paolo; Wilson, Nic (ACM; International Foundation for Autonomous Agents and Multiagent Systems, 2021-05-03)

  A key issue in artificial intelligence methods for interactive preference elicitation is choosing at each stage an appropriate query to the user, in order to find a near-optimal solution as quickly as possible. A theoretically ...
• Partial (neighbourhood) singleton arc consistency for constraint satisfaction problems 

  Wallace, Richard J. (AAAI Press, 2018-05)

  Algorithms based on singleton arc consistency (SAC) show considerable promise for improving backtrack search algorithms for constraint satisfaction problems (CSPs). The drawback is that even the most efficient of them is ...

View more