- finite-model-theory - lists.rwth-aachen.de

Paraconsistent Newsletter -- Spring 2020
by jean-yves beziau 17 Jun '20

17 Jun '20

The coronavirus free spring 2020 edition of the paraconsistent newsletter is ready with - the latest papers, books, events, videos of interest for paraconsistentists - a fuzzy interview with Didier Dubois http://www.paraconsistency.org/2020spring Enjoy ! JYB

1 0

LICS 2020 Call for Participation
by Sam Staton 16 Jun '20

16 Jun '20

CALL FOR PARTICIPATION Thirty-Fifth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) co-located with ICALP 8–11 July 2020 preceded by workshops 6-7 July 2020 Registration (including free option): https://lics2020.saarland-informatics-campus.de/lics-registration/ Preliminary schedule: https://lics2020.saarland-informatics-campus.de/programme/ Accepted papers: https://lics.siglog.org/lics20/accepted.php Keynotes from Mariangiola Dezani Jerome Leroux Andrew Yao Tutorials from Erich Grädel Brigitte Pientka Workshops: AATG: Algorithmic Aspects of Temporal Graphs INFINITY: Verification of Infinite-State SystemsLCC: Logic and Computational Complexity LMW: Logic Mentoring Workshop PRiML: Programming Research in Mainstream Languages

1 0

[Call for Participation] SAT 2020 - The 23rd International Conference on Theory and Applications of Satisfiability Testing
by Laura Pandolfo 16 Jun '20

16 Jun '20

********************* Call for Participation ************** The 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020) 3-10 July 2020 http://sat2020.idea-researchlab.org/ Due to the COVID-19 restrictions, SAT2020 is going virtual *********************************************************** ***SAT 2020*** The International Conference on Theory and Applications of Satisfiability Testing (SAT) is the premier annual meeting for researchers focusing on the theory and applications of the propositional satisfiability problem, broadly construed. In addition to plain propositional satisfiability, it also includes Boolean optimization (such as MaxSAT and Pseudo-Boolean (PB) constraints), Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. ***REGISTRATION*** Registration is FREE and REQUIRED for all participants of the virtual conference, including the authors of the accepted papers. REGISTRATION LINK: https://sat2020.idea-researchlab.org/registration/ ***PROGRAM*** The SAT 2020 main conference and all the workshops will be held in a virtual manner from 4pm – 8pm, latest (CET) in order to cover all the time zones and allow the widest participation. The conference format is a mix of pre-recorded and asynchronous talks, and live engagement such as Q&A sessions. Full details of the main conference program can be seen here: https://sat2020.idea-researchlab.org/program/ Details on workshops are available here: https://sat2020.idea- researchlab.org/workshops/ <https://sat2020.idea-researchlab.org/workshops/> *** INVITED SPEAKERS *** Georg Gottlob, University of Oxford and TU Wien, Austria Aarti Gupta, Princeton University, US ***CONFERENCE SCHEDULE AT A GLANCE*** WORKSHOP DAY, July 3 Pragmatics of SAT (POS) SAT 2020 DAY 1, July 6 Invited Speaker - Aarti Gupta (Princeton University, US) Q&A Live Sessions SAT 2020 DAY 2, July 7 Invited Speaker - Georg Gottlob (University of Oxford and TU Wien) Q&A Live Sessions SAT 2020 DAY 3, July 8 Q&A Live Sessions Competition WORKSHOP DAY, July 9 QBF Workshop WORKSHOP DAY, July 10 Model Counting ***ORGANIZATION*** Program Chairs * Luca Pulina, University of Sassari * Martina Seidl, Johannes Kepler University Linz Workshop Chair * Florian Lonsing, Stanford University Publicity Chair * Laura Pandolfo, University of Sassari -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

COMPUTABILITY IN EUROPE 2020 CALL FOR PARTICIPATION -- EXTENDED DEADLINE
by acie＠acie.eu 16 Jun '20

16 Jun '20

COMPUTABILITY IN EUROPE 2020 CALL FOR PARTICIPATION -- EXTENDED DEADLINE CiE 2020: Virtually in Salerno, Italy Due to the Covid-19 outbreak, this edition will be an online conference. June 29 - July 3, 2020 https://www.acie.eu/cie-conference-series/cie2020 https://www.acie.eu IMPORTANT DATES: 21 JUNE: REGISTRATION DEADLINE (extended) Registration (https://www.acie.eu/cie-conference-series/cie2020) is now open and free of charge. Registration is mandatory to attend the talks. S. BARRY COOPER PRIZE During the conference, we will have the ceremony for awarding the inaugural edition of the S. Barry Cooper Prize [1] to Bruno Courcelle [2] who will give a lecture on Thursday July 2nd at 16:30. Registration to the conference is mandatory to attend the ceremony. CiE 2020 is the 16th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), and Durham (2019). TUTORIALS _Fine-Grained Complexity_ - Virginia Vassilevska Williams (MIT) _Computable Analysis_ - Martin Ziegler (Korea Advanced Institute of Science and Technology) INVITED TALKS: _Centralities in Network Analysis_ -- Paolo Boldi (University of Milan) _A game-theoretic approach for the automated synthesis of complex systems _-- Véronique Bruyère (University of Mons) On-the-fly classification of structures -- Ekatarina Fokina (Vienna University of Technology) _A Survey on Analog Models of Computation_ -- Amaury Pouly (CNRS Paris) _On the Repetitive Structure of Words_ -- Antonio Restivo (University of Palermo) _Molecular algorithms using reprogrammable DNA self-assembly_ -- Damien Woods (Maynooth University) HOSTED BY: Department of Computer Science, University of Salerno Due to the Covid-19 outbreak, this edition will be an online conference. SPECIAL SESSIONS: Algorithmic Learning Theory Combinatorial String Matching Computable Topology HAPOC session on Fairness in Algorithms Large scale Bioinformatics and Computational Sciences Modern aspects of Formal Languages The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics. Links: ------ [1] https://www.acie.eu/2020/06/03/2020-s-barry-cooper-prize-awarded-to-bruno-c… [2] https://en.wikipedia.org/wiki/Bruno_Courcelle

1 0

Highlights of Logic, Games, and Automata: Call for Contributed Presentations
by Nathanaël Fijalkow 15 Jun '20

15 Jun '20

HIGHLIGHTS 2020: 8th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 15-18 September 2020, Online http://highlights-conference.org Call for Contributed Presentations Deadline: 19 June 5pm GMT SUBMISSION SERVER: https://easychair.org/conferences/?conf=highlights2020 ================================================ HIGHLIGHTS 2020 is the 8th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic and Finite Model Theory, Automata Theory, and Games for Logic and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. Participating in the annual Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. The speakers are encouraged to present their best recent work at Highlights, whether already published elsewhere or not. The conference is short (from 15 to 18 September). The participation costs are modest (zero) and the location is easy to reach (your office). The Contributed Presentations will be around ten minutes long. TUTORIAL (September 15) Two tutorials of 3 hours each: + Laure Daviaud, Probabilistic Automata, + Uri Zwick, Algorithms for Turn-based Stochastic games. KEYNOTES + Michael Benedikt + Stéphane Demri + Mehryar Mohri + Anca Muscholl

1 0

Postdoctoral fellowship in Oxford (All Souls College)
by Sam Staton 09 Jun '20

09 Jun '20

Hello, All Souls College in Oxford are advertising a five-year postdoctoral fellowship in theoretical computer science. Key points: * for people awarded their PhDs between 1 August 2018 and 1 October 2021, with possible exemptions * closing date 11 September 2020 NOON * typical start date 1 Oct 2021 (I’m not on the panel, I just extracted these from the ad, so do check them yourselves!) This looks like a very nice opportunity. All Souls in an interesting college, and Oxford is a lively place for computer science. https://www.asc.ox.ac.uk/post-doctoral-research-fellowships Sam.

1 0

PostDoc Position in Knowledge-based Systems and Artificial Intelligence. Vienna, Austria. Application deadline: July 15, 2020
by Mihaela Rozman 09 Jun '20

09 Jun '20

A PostDoc position is available at the Database and Artificial Intelligence Group at TU Wien (Vienna University of Technology), Austria. We invite highly motivated applicants interested both in the theory and practice of - Description Logics - Answer Set Programming - Knowledge Representation and Reasoning - Reasoning about Actions and Change - Database Theory In particular, we are seeking to strengthen our research teams in two foundational research projects “Ontology-mediated Queries for Graph Databases”[1] and “KtoAPP: Compiling Knowledge into Applications”[2] funded by the Austrian Science Fund (FWF). ================= YOUR PROFILE ================= - A PhD degree in Computer Science, Mathematics, or other closely related field - Excellent academic record - High motivation to succeed in academia - Very good English writing skills ================= WE OFFER ================= - Employment at TU Wien from 2 years to 3.5 years, depending on research tasks - Gross salary of approx. 54.453 EUR per year (approx. 35.463 EUR per year after taxes in basic circumstances) - A department that offers top research expertise, and a stimulating and supportive environment - TU Wien is a great place for professional growth (e.g., the Austrian Science Fund offers multiple funding opportunities for young researchers to advance their independent scientific careers). - Vienna is a beautiful city that offers excellent quality of life [4] ================= APPLICATION PROCESS ================= Application Deadline: July 15, 2020 Please send your application to Dr. Mantas Šimkus (simkus(a)dbai.tuwien.ac.at <mailto:simkus@dbai.tuwien.ac.at> ) Application Documents: - Curriculum Vitae - PhD thesis and/or the list of publications - At least 2 names of referees ================= LINKS ================= [1] <http://www.simkus.info/projects/fwf-project-p30360/> http://www.simkus.info/projects/fwf-project-p30360/ [2] <http://www.simkus.info/projects/fwf-project-p30873/> http://www.simkus.info/projects/fwf-project-p30873/ [3] <https://logic-cs.at/> https://logic-cs.at [4] <https://mobilityexchange.mercer.com/Insights/quality-of-living-rankings> https://mobilityexchange.mercer.com/Insights/quality-of-living-rankings

1 0

PhD Position in Artificial Intelligence at TU Wien, Vienna, Austria. Application deadline: July 15, 2020
by Mihaela Rozman 09 Jun '20

09 Jun '20

A PhD position is available at the Database and Artificial Intelligence Group at TU Wien, Austria (under the supervision of Dr. Mantas Šimkus). We invite highly motivated applicants interested both in the theory and practice of - Description Logics - Answer Set Programming - Knowledge Representation and Reasoning - Reasoning about Actions and Change - Database Theory In particular, we are seeking to strengthen our research teams in two foundational research projects “Ontology-mediated Queries for Graph Databases”[1] and “KtoAPP: Compiling Knowledge into Applications”[2] funded by the Austrian Science Fund (FWF). ===================== YOUR PROFILE ===================== - A degree in Computer Science, Mathematics, or other closely related field - A very strong study record, especially in foundational topics (like discrete mathematics, logic, logic programming, algebra, theory of computation, computational complexity, combinatorics, graph theory, automata theory, data structures and algorithms) - Very good English writing skills ===================== WE OFFER ===================== - Employment at TU Wien for up to 3.5 years, with Dr. Mantas Šimkus as PhD advisor - Gross salary of approx. 30.754 EUR per year (approx. 22.506 EUR per year after taxes in basic circumstances) - The candidate student would join the LogiCS doctoral program [3] which offers top research expertise, and a stimulating and supportive environment - A research and study environment that is friendly and gender-balanced - TU Wien is a great place for professional growth (e.g., the Austrian Science Fund offers multiple funding opportunities for young researchers to advance their independent scientific careers). - Vienna is a beautiful city that offers excellent quality of life [4] ===================== APPLICATION PROCESS ===================== Application Deadline: July 15, 2020 Please send your application to Dr. Mantas Šimkus (simkus(a)dbai.tuwien.ac.at <mailto:simkus@dbai.tuwien.ac.at> ) ===================== APPLICATION DOCUMENTS ===================== -A motivation letter, which should make a connection to one of the research projects mentioned above -Curriculum Vitae -Transcripts (academic record) showing high performance in prior studies -Abstract of the Master thesis -2 letters of recommendation ===================== QUALITY OF LIFE ===================== Vienna, the city features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields. Finally, Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide. ===================== LINKS ===================== [1] <http://www.simkus.info/projects/fwf-project-p30360/> http://www.simkus.info/projects/fwf-project-p30360/ [2] <http://www.simkus.info/projects/fwf-project-p30873/> http://www.simkus.info/projects/fwf-project-p30873/ [3] <https://logic-cs.at/> https://logic-cs.at [4] <https://mobilityexchange.mercer.com/Insights/quality-of-living-rankings> https://mobilityexchange.mercer.com/Insights/quality-of-living-rankings ===================== WEBSITE ===================== www.vcla.at/positions/ <http://www.vcla.at/positions/>

1 0

PhD position(s) in Structural and Algorithmic Aspects of Preference-based Problems in Social Choice - Vienna, Austria - Deadline: July 31, 2020
by Mihaela Rozman 09 Jun '20

09 Jun '20

PhD POSITION(S) PROJECT Structural and Algorithmic Aspects of Preference-based Problems in Social Choice STARTING DATE: Negotiable LOCATION: Vienna, Austria INSTITUTION: Algorithms and complexity group at the Faculty of Informatics, Technische Universität Wien (Vienna University of Technology) FUNDING: The PhD candidates receive an employment contract for the initial period of 3 years, thus study fees do not apply. Salary range starts at 22.000 net/year EUR for 30h/week. APPLICATION DEADLINE: July 31, 2020 ========================================================== We invite applications for PhD position(s) (3 years with the possibility of extension), working with Jiehua Chen in the Algorithms and Complexity Group at the Vienna University of Technology (Technische Universität Wien – TU Wien), Vienna, Austria. The PhD position(s) is available for the WWTF research project (Vienna Science and Technology Fund) titled Structural and Algorithmic Aspects of Preference-based Problems in Social Choice: https://www.wwtf.at/programmes/vienna_research_groups/VRG18-012/index.php?l… The research topics include voting, structured preferences, stable matching (matchings under preferences) with a focus on parameterized and approximation algorithm design. =============================== YOUR PROFILE =============================== Applicants with a solid background in areas such as algorithm design (including BUT NOT LIMITED to parameterized algorithms and approximation algorithms), computational complexity, and/or discrete mathematics are welcome to apply. =============================== WE OFFER =============================== -The PhD position(s) entails an employment contract. -The position(s) is available immediately and the starting date is quite flexible - A research and study environment that is friendly and gender-balanced - TU Wien is a great place for professional growth (e.g., the Austrian Science Fund and other funding agencies offer multiple funding opportunities for young researchers to advance their independent scientific careers) - Vienna, the city, features a vibrant and excellence-driven research landscape, with several leading research institutes (e.g., University of Vienna, IST, AIT, SBA) and universities continuously establishing collaborations in various fields - Vienna has been consistently ranked by Mercer over the last years the best city for quality of life worldwide. =============================== APPLICATION =============================== Please send your application, including - your academic CV, - a motivation letter, including an explanation of your research interests, - your Master's thesis and - a list of subjects studied, giving sufficient details and grades/marks obtained directly to Jiehua Chen: jiehua.chen(a)tuwien.ac.at <mailto:jiehua.chen@tuwien.ac.at> (If possible all in a single PDF file) DEADLINE: 31. July 2020 For informal inquiries you can also contact via the above email address. =============================== ADDITIONAL INFORMATION =============================== Faculty of Informatics: https://informatics.tuwien.ac.at/ Research group website: https://www.ac.tuwien.ac.at/ Outreach: www.vcla.at <http://www.vcla.at> Twitter: @vclaTUwien

1 0

[CfP] CASUAL2020: Workshop on Causal Reasoning and Explanation in Logic Programming
by Laura Pandolfo 09 Jun '20

09 Jun '20

[Apologies if you receive multiple copies of this email. Please distribute to interested parties.] Workshop on Causal Reasoning and Explanation in Logic Programming CALL FOR PAPERS *** CAUSAL 2020 *** (September 17 or 18, 2020) Workshop on Causal Reasoning and Explanation in Logic Programming CAUSAL 2020 is a workshop co-located with ICLP 2020 in University of Calabria, Rende, Italy. *NOTE ABOUT COVID-19: We will follow advice from the ICLP2020 organizers on the situation, and we will revise our workshop timeline and other procedures accordingly if needed.* CAUSAL 2020 IMPORTANT DATES ------------------------- * Paper submission: July 15th 2020 * Notification: July 30th 2020 * Final Versions: August 15th 2020 * Workshop Date: September 17th or 18th 2020 ------------------------ Sophisticated causal reasoning has long been prevalent in human society and continues to have an undeniable impact on the advancement of science, technology, medicine, and other significant fields. From the development of ancient tools to modern roots of causal analysis in business and industry, reasoning about causality and having the ability to explain causal mechanisms enables us to identify how an outcome of interest came to be and gives insight into how to bring about, or even prevent, similar outcomes in future scenarios. This workshop aims to bring together researchers and practitioners of logic programming with a dedicated focus on methods and trends emerging from the study of causality and explanation. We welcome the submission of papers on systems, tools, and applications of logic programming methods for causal reasoning and explanation. In particular, we encourage submissions presenting recent developments, including works in progress. The workshop will present the latest research and application developments in these areas and provide opportunities to discuss current and future research directions and relationships to other fields (e.g. Machine Learning, Explainable AI, Diagnosis, Natural Language Processing and Understanding, Philosophy of Science). An important expected outcome of this workshop is to collect first-hand feedback from the ICLP community about the role and placement of causal reasoning and explanation in the landscape of modern computer theory as well as in the software industry. TOPICS ------ Topics of interests include (but are not limited to): * Modeling causal theories in logic programming * Formalization of types of causes: sufficient, necessary, actual, etc * Causality, temporal reasoning and action theories * Causality and counterfactual reasoning * Causality, learning and experimental design * Causality and probability * Causality and equivalence * Causality and ontology * Relating LP based causality and Causal Networks * Challenging problems and benchmark examples * Justifications and argumentation * Explanations for diagnosis and debugging * Tools, systems and applications Submissions must describe original research and be prepared using the Springer LNAI/LNCS format and should be no longer than 13 pages. https://www.springer.com/gp/authors-editors/conference-proceedings/conferen… Please submit your paper via EasyChair: https://easychair.org/conferences/?conf=causal2020 At least one co-author of each accepted paper must register for and attend the workshop. Please check the ICLP 2020 website for registration procedure and fees. https://iclp2020.unical.it/ ORGANIZERS ---------- Emily LeBlanc, US Naval Research Lab, USA, emily.leblanc(a)nrl.navy.mil Joost Vennekens, KU Leuven, Belgium Tran Cao Son, New Mexico State University, USA Pedro Cabalar, Corunna University, Spain Jorge Fandiño, University of Potsdam, Germany Marcello Balduccini, Saint Joseph's University, USA Yuliya Lierler, University of Nebraska at Omaha, USA -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0