@inproceedings{Cyras:2019:10.1609/aaai.v33i01.33012752,
author = {Cyras, K and Letsios, D and Misener, R and Toni, F},
doi = {10.1609/aaai.v33i01.33012752},
pages = {2752--2759},
publisher = {AAAI},
title = {Argumentation for Explainable Scheduling},
url = {http://dx.doi.org/10.1609/aaai.v33i01.33012752},
year = {2019}
}

Download

TY  - CPAPER
AB  - Mathematical  optimization  offers  highly-effective  tools  forfinding solutions for problems with well-defined goals, no-tably  scheduling.  However,  optimization  solvers  are  oftenunexplainable black boxes whose solutions are inaccessibleto users and which users cannot interact with. We define anovel  paradigm  using  argumentation  to  empower  the  inter-action between optimization solvers and users, supported bytractable explanations which certify or refute solutions. A so-lution  can  be  from  a  solver  or  of  interest  to  a  user  (in  thecontext of ’what-if’ scenarios). Specifically, we define argu-mentative and natural language explanations for why a sched-ule is (not) feasible, (not) efficient or (not) satisfying fixeduser decisions, based on models of the fundamental makespanscheduling problem in terms of abstract argumentation frame-works  (AFs).  We  define  three  types  of  AFs,  whose  stableextensions are in one-to-one correspondence with schedulesthat are feasible, efficient and satisfying fixed decisions, re-spectively.  We  extract  the  argumentative  explanations  fromthese AFs and the natural language explanations from the ar-gumentative ones.
AU  - Cyras,K
AU  - Letsios,D
AU  - Misener,R
AU  - Toni,F
DO  - 10.1609/aaai.v33i01.33012752
EP  - 2759
PB  - AAAI
PY  - 2019///
SP  - 2752
TI  - Argumentation for Explainable Scheduling
UR  - http://dx.doi.org/10.1609/aaai.v33i01.33012752
UR  - http://arxiv.org/abs/1811.05437v1
UR  - https://aaai.org/ojs/index.php/AAAI/article/view/4126
ER  - 

Download