9 citations · 17 across the 3 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2022★ 1 cited
Finding Counterfactual Explanations through Constraint Relaxations
Sharmi Dev Gupta, Begum Genc, Barry O'Sullivan
Interactive constraint systems often suffer from infeasibility (no solution) due to conflicting user constraints. A common approach to recover infeasibility is to eliminate the con…
cs.AI2017★ 9 cited
Finding Robust Solutions to Stable Marriage
Begum Genc, Mohamed Siala, Barry O'Sullivan +1
We study the notion of robustness in stable matching problems. We first define robustness by introducing (a,b)-supermatches. An -supermatch is a stable matching in which if…