{"id":21,"date":"2020-06-16T09:25:23","date_gmt":"2020-06-16T07:25:23","guid":{"rendered":"http:\/\/events.dimes.unical.it\/ai3-2020\/?page_id=21"},"modified":"2020-10-27T16:36:58","modified_gmt":"2020-10-27T15:36:58","slug":"program","status":"publish","type":"page","link":"https:\/\/events.dimes.unical.it\/ai3-2020\/program\/","title":{"rendered":"Program"},"content":{"rendered":"<section><\/section>\n<section>\n<h4 align=\"justify\">Wednesday 25th November:<\/h4>\n<p align=\"justify\"><strong><span style=\"color: #800080\">10:30<\/span><\/strong><\/p>\n<p align=\"justify\"><strong><span style=\"color: #800080\">Opening<\/span><\/strong><\/p>\n<p align=\"justify\"><strong><span style=\"color: #800080\">10:40 <\/span><\/strong><\/p>\n<ul>\n<li><strong>Invited speaker:<\/strong> <a href=\"https:\/\/www.cs.helsinki.fi\/u\/mjarvisa\/\">Matti J\u00e4rvisalo<\/a><br \/>\n<strong>Title<\/strong>: SAT-based reasoning beyond acceptance.<br \/>\n<strong>Abstract<\/strong>: I will give a personal account of recent advances in harnessing modern Boolean satisfiability (SAT) solver technology for the development of practical reasoning systems for abstract argumentation. As witnessed by e.g. recent ICCMA competitions, SAT solving has turned out to be a key technology for reasoning over abstract argumentation frameworks. Going beyond more &#8220;classical&#8221; reasoning tasks such as acceptance problems, I will overview recent progress in practical SAT-based algorithms for reasoning over argumentation frameworks in dynamic and uncertain contexts as well as explaining and diagnosing rejection of arguments.<\/li>\n<\/ul>\n<p align=\"justify\"><strong><span style=\"color: #800080\">11:40<\/span><\/strong><\/p>\n<ol>\n<li>Markus Brenneis\u00a0and Martin Mauve.<br \/>\nDo I Argue Like Them? A Human Baseline for Comparing Attitudes in Argumentations.<\/li>\n<li>Gianvincenzo Alfano, Sergio Greco, Francesco Parisi and Irina Trubitsyna.<br \/>\nOn the Semantics of Recursive Bipolar AFs and Partial Stable Models.<\/li>\n<\/ol>\n<\/section>\n<section>\n<h4 align=\"justify\">Thursday 26th November:<\/h4>\n<p align=\"justify\"><strong><span style=\"color: #800080\">14:00<\/span><\/strong><\/p>\n<ol>\n<li>Tobia Zanetti,\u00a0Massimiliano Giacomin, Mauro Vallati\u00a0and Federico Cerutti.<br \/>\nAn Efficient Algorithm for Admissible Argumentation Stages.<\/li>\n<li>Bettina Fazzinga, Sergio Flesca and Filippo Furfaro.<br \/>\nComputational strategies for Trust-aware Abstract Argumentation Frameworks.<\/li>\n<li>Stefano Ferilli.<br \/>\nTowards a General Model for Abstract Argumentation Frameworks.<\/li>\n<li>Stefano Bistarelli and Carlo Taticchi.<br \/>\nA Concurrent Language for Argumentation.<\/li>\n<li>Stefano Bistarelli,\u00a0Lars Kotthoff,\u00a0Francesco Santini\u00a0and Carlo Taticchi.<br \/>\nA First Overview of ICCMA\u201919.<\/li>\n<li>Mario Leiva,\u00a0Gerardo Simari\u00a0and\u00a0Alejandro Garc\u00eda.<br \/>\nTowards Effective and Efficient Approximate Query Answering in Probabilistic DeLP.<\/li>\n<\/ol>\n<\/section>\n","protected":false},"excerpt":{"rendered":"<p>Wednesday 25th November: 10:30 Opening 10:40 Invited speaker: Matti J\u00e4rvisalo Title: SAT-based reasoning beyond acceptance. Abstract: I will give a personal account of recent advances in harnessing modern Boolean satisfiability (SAT) solver technology for the development of practical reasoning systems for abstract argumentation. As witnessed by e.g. recent ICCMA competitions, SAT solving has turned out [&hellip;]<\/p>\n","protected":false},"author":15,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"inline_featured_image":false,"footnotes":""},"class_list":["post-21","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/pages\/21","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/users\/15"}],"replies":[{"embeddable":true,"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/comments?post=21"}],"version-history":[{"count":17,"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/pages\/21\/revisions"}],"predecessor-version":[{"id":147,"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/pages\/21\/revisions\/147"}],"wp:attachment":[{"href":"https:\/\/events.dimes.unical.it\/ai3-2020\/wp-json\/wp\/v2\/media?parent=21"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}