<html><head><meta http-equiv="Content-Type" content="text/html; charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div><div class="">#########<br class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div dir="auto" style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div style="word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><div class=""><div class=""><div class="">The 35th ACM SIGAPP Symposium On Applied Computing <br class="">Brno, Czech Republic<br class="">March 30-April 3, 2020<br class=""><br class="">Track on Knowledge Representation and Reasoning (KRR) <br class="">Website: <a href="http://www.dmi.unipg.it/bista/organizing/KRR@sac2020" class="">http://www.dmi.unipg.it/bista/organizing/KRR@sac2020</a><br class=""><br class="">SUBMISSION DEADLINE: September 15, 2019 <br class=""><br class="">#########<br class=""><br class=""><br class=""><br class="">DEADLINES AND IMPORTANT DATES: <br class="">September 15, 2019: Submission of regular papers and SRC abstracts. <br class="">November 10, 2019: Notification of papers and posters and SRC acceptance/rejection. <br class="">November 25, 2019: Camera-ready copies of accepted papers. <br class="">March 30-April 3, 2020: Conference<br class=""><br class=""><br class=""><br class=""><br class="">SUMMARY OF IMPORTANT INFORMATION FOR AUTHORS:<br class="">The review process is double-blind, so authors need to completely anonymise their submissions.<br class=""><br class="">Size of submissions is -strictly- limited to 8 pages in SAC Latex style (please refer to <br class=""><a href="http://www.sigapp.org/sac/sac2020/" class="">http://www.sigapp.org/sac/sac2020/</a> to download the author kit).<br class="">Two additional pages may be included for an additional fee, only after acceptance.<br class=""><br class="">Submission system: TO BE ANNOUNCED AT <a href="http://www.sigapp.org/sac/sac2020/" class="">http://www.sigapp.org/sac/sac2020/</a><br class=""><br class=""><br class=""><br class=""><br class=""><br class=""><br class="">OVERVIEW: <br class="">The topic of the track covers an important field of research in Artificial Intelligence: Knowledge Representation and Reasoning (KRR) is dedicated to representing information about the world in a form that a computer system can utilise to solve complex tasks. Examples of knowledge representation formalisms include semantic nets, systems architecture, frames, rules, and ontologies. Some examples of automated reasoning engines include inference engines, theorem provers, and classifiers. The KRR track will be a venue for all the researchers and practitioners working on the fundaments and applications of reasoning, and cross-fertilisation among different areas. <br class="">ACM SAC is ranked CORE:B, MAS:A-, SHINE:A. The acceptance rate for each track is below 25% as established by conference guidelines.<br class=""><br class=""><br class=""><br class=""><br class="">CALL FOR PAPERS: <br class="">Knowledge-representation is the field of artificial intelligence that focuses on designing computer representations that capture information about the world that can be used to solve complex problems. Its goal is to understand and build intelligent behavior from the top down, focusing on what an agent needs to know with the purpose to behave intelligently, how this knowledge can be represented symbolically, and how automated reasoning procedures can make this knowledge available as needed. In KRR a fundamental assumption is that an agent's knowledge is explicitly represented in a declarative form, suitable for processing by dedicated reasoning engines. Topics of interest include: <br class=""><br class="">- Argumentation. <br class="">- Belief revision and update, belief merging. <br class="">- Commonsense reasoning. <br class="">- Contextual reasoning. <br class="">- Description logics. <br class="">- Diagnosis, abduction, explanation. <br class="">- Inconsistency and exception tolerant reasoning, paraconsistent logics. <br class="">- KR and autonomous agents: intelligent agents, cognitive robotics, multi-agent systems. <br class="">- KR and decision making, game theory, social choice. <br class="">- KR and machine learning, inductive logic programming, knowledge discovery and acquisition. <br class="">- Logic programming, answer set programming, constraint (logic) programming. <br class="">- Non-monotonic logics, default logics, conditional logics. <br class="">- Preferences: modeling and representation, preference-based reasoning. <br class="">- Reasoning about knowledge and belief, dynamic epistemic logic, epistemic and doxastic logics. <br class="">- Reasoning systems and solvers, knowledge compilation. <br class="">- Spatial reasoning and temporal reasoning, qualitative reasoning. <br class="">- Uncertainty, representations of vagueness, many-valued and fuzzy logics. <br class=""><br class=""><br class="">Submissions fall into the following categories: <br class="">- Original and unpublished research work. <br class="">- Reports of innovative computing applications in the arts, sciences, engineering, and business areas. <br class="">- Reports of successful technology transfer to new problem domains. <br class="">- Reports of industrial experience and demos of new innovative systems. <br class=""><br class=""><br class=""><br class=""><br class="">SUBMISSION INSTRUCTIONS FOR REGULAR PAPERS: <br class="">Original papers addressing any of the listed topics of interest (or related topics) will be considered. Each submitted paper will be fully refereed and undergo a double-blind review process by at least three referees. Accepted papers will be included in the ACM SAC 2020 proceedings and published in the ACM digital library, being indexed by Thomson ISI Web of Knowledge and Scopus. Submissions should be properly anonymised to facilitate blind reviewing: the author(s) name(s) and address(es) must NOT appear in the body of the paper, and self-reference should be in the third person. <br class=""><br class="">Size of submissions is *strictly* limited to 8 pages in SAC style; a maximum of 2 additional pages may be included for an additional fee, by extending the final version of the accepted paper. <br class=""><br class="">Papers that received high reviews (that is acceptable by reviewer standards) but were not accepted due to space limitation can be invited for the poster session. The length of the poster is 3 pages (included in the registration) + 1 page (at extra charge) = 4 pages maximum.<br class=""><br class="">Please check the author kit Latex style on the main SAC website (the format is usually the format used in the ACM templates). Papers failing to comply with length limitations risk immediate rejection. <br class=""><br class="">Submissions will be in electronic format, via the website: (TO BE ANNOUNCED) <br class="">PLEASE REMEMBER TO SELECT THE KRR TRACK BY CHECKING THE KRR TRACK RADIO BUTTON!! <br class=""><br class=""><br class=""><br class=""><br class="">STUDENT RESEARCH COMPETITION (SRC) PROGRAM:<br class="">Graduate students are invited to submit research abstracts (maximum of 4 pages in ACM camera-ready format) following the instructions published at SAC 2020 website. Submission of the same abstract to multiple tracks is not allowed. All research abstract submissions will be reviewed by researchers and practitioners with expertise in the track focus area to which they are submitted. Authors of selected abstracts (up to 18 students) will have the opportunity to give poster and oral presentations of their work and compete for three top-winning places. The SRC committee will evaluate and select First, Second, and Third place winners. The winners will receive medals and cash awards. Winners will be announced during the conference banquet. Invited students receive SRC travel support (US$500) and are eligible to apply to the SIGAPP Student Travel Award Program (STAP) for additional travel support.<br class=""><br class=""><br class=""><br class=""><br class="">PROGRAM COMMITTEE:</div><div class=""><div class="">Mario Alviano, University of Calabria</div><div class="">Franz Baader, TU Dresden</div><div class="">Roman Bartak, Charles University</div><div class="">Emmanuel Desmontils, Univesity of Nantes</div><div class="">Pierpaolo<span class="Apple-tab-span" style="white-space:pre"> </span>Dondio, Dublin Institute of Technology</div><div class="">Wolfgang<span class="Apple-tab-span" style="white-space:pre"> </span>Faber, Huddersfield School of computing</div><div class="">Lluis Godo, Artificial Intelligence Research Institute (IIIA)</div><div class="">Matti Jarvisalo, University of Helsinki</div><div class="">Souhila Kaci, Montpellier</div><div class="">Gabriele Kern-Isberner, TU Dortmund</div><div class="">Boris Konev, University of Liverpool</div><div class="">Costas Koutras, University of Peloponnese</div><div class="">Joao Leite, New University of Lisbon</div><div class="">Jean-Guy Mailly, Paris Descartes</div><div class="">Marco Maratea, University of Genova</div><div class="">Odinaldo Rodrigues, UCL London</div><div class="">Guillermo R. Simari, Universidad Nacional del Sur</div><div class="">Tran Cao Son, New Mexico State University</div><div class="">Paolo Torroni, University of Bologna</div><div class="">Serena Villata, CNRS Sophia-Antipolis</div><div class="">Johannes Wallner, TU Wien</div><div class="">Roland Yap, National University of Singapore</div><br class=""><br class=""><br class=""><br class="">CHAIRS: <br class="">Stefano Bistarelli, University of Perugia, Italy <br class="">Martine Ceberio, University of Texas at El Paso, USA <br class="">Eric Monfroy, University of Nantes, France <br class="">Francesco Santini, University of Perugia, Italy <br class=""><br class=""><br class=""><br class=""><br class="">SAC NO-SHOW POLICY: <br class="">Paper registration is required, allowing the inclusion of the paper/poster in the conference proceedings. An author or a proxy attending ACM SAC MUST present the paper: This is a requirement for the paper/poster to be included in the ACM/IEEE digital library. No-show of scheduled papers and posters will result in excluding them from the ACM/IEEE digital library.<br class=""><br class=""><br class=""><br class=""></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div></div><div class=""><br class="Apple-interchange-newline"><br class="Apple-interchange-newline">
</div>
<br class=""></div></div></div><br class=""><div class="">
<div style="letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; white-space: normal; word-spacing: 0px; -webkit-text-stroke-width: 0px; word-wrap: break-word; -webkit-nbsp-mode: space; line-break: after-white-space;" class=""><span class="Apple-style-span" style="border-collapse: separate; font-variant-ligatures: normal; font-variant-east-asian: normal; font-variant-position: normal; line-height: normal; border-spacing: 0px; -webkit-text-decorations-in-effect: none;"><div style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class=""><span class="Apple-style-span" style="border-collapse: separate; font-family: Helvetica; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-variant-east-asian: normal; font-variant-position: normal; font-weight: normal; letter-spacing: normal; line-height: normal; orphans: 2; text-align: -webkit-auto; text-indent: 0px; text-transform: none; white-space: normal; widows: 2; word-spacing: 0px; border-spacing: 0px; -webkit-text-decorations-in-effect: none; -webkit-text-stroke-width: 0px;"><div style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class=""><div class=""><div apple-content-edited="true" style="orphans: auto; widows: auto;" class="">========================================<br class="">Dr. Francesco Santini (Assistant Professor)<br class="">Department of Mathematics and Computer Science</div><div apple-content-edited="true" style="orphans: auto; widows: auto;" class="">University of Perugia</div><div apple-content-edited="true" style="orphans: auto; widows: auto;" class="">Via Vanvitelli 1</div><div apple-content-edited="true" style="orphans: auto; widows: auto;" class="">06123 Perugia</div><div apple-content-edited="true" style="orphans: auto; widows: auto;" class="">Italy<br class=""><a href="http://www.dmi.unipg.it/francesco.santini" class="">http://www.dmi.unipg.it/francesco.santini</a><br class="">========================================</div></div><div class=""><br class=""></div></div></span></div></span></div></div></div></div></div></div></div></div></div></div></body></html>