{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T07:38:41Z","timestamp":1723016321016},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,8]]},"abstract":"<jats:p>We propose and study, theoretically and empirically, a new random model for the abstract argumentation framework (AF).  Our model overcomes some intrinsic difficulties of the only random model of  directed graphs in the literature  that is relevant to  AFs, and makes it possible to study the typical-case complexity of AF instances in terms of  threshold behaviours and phase transitions.  We proved that  the probability for a random AF instance to  have a  stable\/preferred extension goes through a sudden change (from 1 to 0) at the \n\nthreshold of the parameters of the new model D(n, p, q),  satisfying the equation 4q\/((1 + q)(1+q)) = p.  We showed, empirically,  that in this new model, there is a clear easy-hard-easy pattern of hardness (for a typical backtracking-style exact solvers)  associated with the phase transition. Our empirical  studies indicated that instances from the new model at phase transitions are much harder than those from an Erdos-Renyi-style model with equal edge density.  In addition to being an analytically tractable model for  understanding  the interplay between problems structures and effectiveness of  (branching) heuristics  used in practical argumentation solvers,  the model can also be used to generate, in a systematic way,  non-trivial AF instances with controlled features to evaluate the performance of other AF solvers.<\/jats:p>","DOI":"10.24963\/ijcai.2017\/71","type":"proceedings-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T05:14:07Z","timestamp":1501218847000},"page":"503-509","source":"Crossref","is-referenced-by-count":1,"title":["A Random Model for Argumentation Framework:  Phase Transitions, Empirical Hardness, and Heuristics"],"prefix":"10.24963","author":[{"given":"Yong","family":"Gao","sequence":"first","affiliation":[{"name":"University of British Columbia Okanagan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"10584","event":{"number":"26","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)","University of Technology Sydney (UTS)","Australian Computer Society (ACS)"],"acronym":"IJCAI-2017","name":"Twenty-Sixth International Joint Conference on Artificial Intelligence","start":{"date-parts":[[2017,8,19]]},"theme":"Artificial Intelligence","location":"Melbourne, Australia","end":{"date-parts":[[2017,8,26]]}},"container-title":["Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T07:52:06Z","timestamp":1501228326000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2017\/71"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2017,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2017\/71","relation":{},"subject":[],"published":{"date-parts":[[2017,8]]}}}