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

SAT2020: DEADLINES EXTENDED
by Laura Pandolfo 12 Feb '20

12 Feb '20

We would like to inform you that we have decided to extend SAT2020 deadlines for submissions as follows: Abstract submission by February 22, 2020 (was February 15) Paper submission by February 29, 2020 (was February 19) The updated call for paper follows. ******************** Call for Papers ******************** The 23rd International Conference on Theory and Applications of Satisfiability Testing (SAT 2020) 5-9 July 2020, Alghero, Italy http://sat2020.idea-researchlab.org/ <http://sat2020.idea-researchlab.org/> ********************************************************* 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. *** Scope *** SAT 2020 welcomes scientific contributions addressing different aspects of the satisfiability problem, interpreted in a broad sense. Topics include, but are not restricted to: * Theoretical advances * Practical search algorithms * Knowledge compilation * Implementation-level details of SAT solving tools * Problem encodings and reformulations * Applications * Case studies based on rigorous experimentation *** Invited Speakers *** * Georg Gottlob, TU Wien, Austria * Aarti Gupta, Princeton University, US *** Out of Scope *** Papers claiming to resolve a major long-standing open theoretical question in Mathematics or Computer Science (such as those for which a Millennium Prize is offered), are outside the scope of the conference because there is insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal. *** Paper Categories *** Submissions to SAT 2020 are solicited in three categories, describing original contributions. * Long papers (9 to 15 pages, excluding references) * Short papers (up to 8 pages, excluding references) * Tool papers (up to 6 pages, excluding references) Long and short papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementations available with their submission. Submissions on applications and cases studies are especially welcome. Such papers should describe details, weaknesses and strengths of the considered approaches in sufficient depth, but they are not expected to introduce novel solving approaches. Tool papers must obey to specific content criteria. A tool paper should describe the implemented tool and its novel features. Here “tools” are interpreted in a broad sense, including descriptions of implemented solvers, preprocessors, etc. as well as systems that exploit SAT solvers or their extensions for use in interesting problem domains. A demonstration is expected to accompany a tool presentation. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool. Long and short papers will be evaluated with the same quality standards, and are expected to contain a similar contribution per page ratio. *** Submissions *** Submissions should not be under review elsewhere nor be submitted elsewhere while under review for SAT 2020, and should not consist of previously published material. Submissions not consistent with the above guidelines may be returned without review. All papers submissions are done exclusively via EasyChair in Springer’s LaTeX llncs2e style. One author of each accepted paper is expected to present it at the conference. Further details can be found at the website of SAT 2020: http://sat2020..idea-researchlab.org/ <http://sat2020.idea-researchlab.org/> *** Proceedings *** The proceedings will be published by Springer in the series Lecture Notes in Computer Science, seewww.springer.com/lncs <https://www.springer.com/lncs>. *** Important Dates *** Workshops July 5, 2020 Conference July 6-9, 2020 Abstract submission February 22, 2020 Paper submission February 29, 2020 Author response period March 29 – April 2, 2020 Author notification April 18, 2020 Camera-ready May 3, 2020 *** 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 Program Committee * Fahiem Bacchus, University of Toronto * Olaf Beyersdorff, Friedrich Schiller University Jena * Armin Biere, Johannes Kepler University Linz * Nikolaj Bjorner, Microsoft * Maria Luisa Bonet, Universitat Politècnica de Catalunya * Sam Buss, University of California San Diego * Florent Capelli, Université de Lille * Pascal Fontaine, Université de Liège, Belgium * Marijn Heule, Carnegie Mellon University * Alexey Ignatiev, Universidade de Lisboa * Mikolas Janota, University of Lisbon * Matti Järvisalo, University of Helsinki * Oliver Kullmann, Swansea University * Jie-Hong Roland Jiang, National Taiwan University * Jan Johannsen, Ludwig Maximilian University of Munich * Benjamin Kiesl, CISPA Helmholtz Center for Information Security * Daniel Le Berre, Université d’Artois * Florian Lonsing, Stanford University * Ines Lynce, Universidade de Lisboa * Vasco Manquinho, Universidade de Lisboa, Portugal * Felip Manyà, IIIA-CSIC * Joao Marques-Silva, University of Toulouse * Ruben Martins, Carnegie Mellon University * Kuldeep S. Meel, National University of Singapore * Alexander Nadel, Intel * Aina Niemetz, Stanford University * Jakob Nordstrom, University of Copenhagen * Markus N. Rabe, Google * Roberto Sebastiani, University of Trento * Natasha Sharygina, Università della Svizzera italiana * Laurent Simon, Bordeaux Institute of Technology * Friedrich Slivovsky, Vienna University of Technology * Stefan Szeider, Vienna University of Technology * Ralf Wimmer, Concept Engineering GmbH & Albert-Ludwigs-Universität Freiburg * Christoph M. Wintersteiger, Microsoft *** Contact *** For any questions, please contact sat2020(a)easychair.org <mailto:sat2020@easychair.org> -- -- *Dona il 5x1000* all'Università degli Studi di Sassaricodice fiscale: 00196350904

1 0

RAMiCS CFSC
by Michael Winter 10 Feb '20

10 Feb '20

CALL FOR SHORT CONTRIBUTIONS / POSTERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08 to 11 April 2020, Palaiseau, France http://ramics18.gforge.inria.fr/ As a novelty this year, and additionally to the standard CfP, RAMICS is also calling for short contributions and posters. We are hence calling for presentations of original, unfinished, already published, or otherwise interesting work within the topics of the RAMICS conferences. The submission can be in the form of a poster, an abstract, a paper submitted to or published at another conference, etc. Short contributions will *not* be published in the conference proceedings. IMPORTANT DATES: Submission: 14 February 2020 Notification: 28 February 2020 Note that these dates coincide with the ones for WATA 2020, which will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage double submissions of short contributions. https://wata2020.lis-lab.fr/ INVITED TALKS: Christel Baier, Technische Universitaet Dresden, Germany Manfred Droste, Universitaet Leipzig, Germany Daniela Petrisan, Universite Paris Diderot, France GENERAL INFORMATION: Since 1994, the RAMICS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite short submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications SUBMISSION INSTRUCTIONS: Please send your short submission to ramics18-info(a)lists.gforge.inria.fr by 14 February 2020. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane Warsaw University,Poland Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Stef Joosten Open Universiteit, Netherlands Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh University College London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

1 1

ICALP 2020 - Conference relocation and deadline extension
by Anuj Dawar 07 Feb '20

07 Feb '20

======= ICALP 2020 - Conference relocation and deadline extension ======== The ICALP and the LICS steering committee have agreed together with the conference chairs in Beijing to relocate the two conferences. ICALP and LICS 2020 will take place in Saarbrücken, Germany, July 8-11 (with satellite workshops on July 6-7). We are very grateful to our colleagues in Beijing, for the organization so far, to the colleagues from Saarbrücken, who generously accepted this challenging task, and to all members of the TCS community who offered their help in this difficult situation. The deadline is extended, see below. __________________________________________________________________________ Call for Papers - ICALP 2020 July 8-11 2020, Saarbrücken, Germany (NEW) Paper submission deadline: Tuesday February 18, 2020, 6am GMT (NEW) https://easychair.org/conferences/?conf=icalp2020 ICALP (International Colloquium on Automata, Languages and Programming) is the main European conference in Theoretical Computer Science and annual meeting of the European Association for Theoretical Computer Science (EATCS). ICALP 2020 will be hosted on the Saarland Informatics Campus in Saarbrücken, in co-location with LICS 2020 (ACM/IEEE Symposium on Logic in Computer Science). Invited speakers: Track A: Virginia Vassilevska (MIT), Robert Krauthgamer (Weizmann) Track B: Stefan Kiefer (Oxford) Joint ICALP-LICS: Andrew Yao (Tsinghua), Jérôme Leroux (Bordeaux) Submission Guidelines: see https://easychair.org/conferences/?conf=icalp2020 Important Dates submission: February 18, 2020, 6am GMT notifications: April 15, 2020 camera ready: April 28, 2020 Topics: ICALP 2020 will have the two traditional tracks A (Algorithms, Complexity and Games - including Algorithmic Game Theory, Distributed Algorithms and Parallel, Distributed and External Memory Computing) and B (Automata, Logic, Semantics and Theory of Programming). Papers presenting original, unpublished research on all aspects of theoretical computer science are sought. Typical, but not exclusive topics are: Track A -- Algorithmic Aspects of Networks and Networking, Algorithms for Computational Biology, Algorithmic Game Theory, Combinatorial Optimization, Combinatorics in Computer Science, Computational Complexity, Computational Geometry, Computational Learning Theory, Cryptography, Data Structures, Design and Analysis of Algorithms, Foundations of Machine Learning, Foundations of Privacy, Trust and Reputation in Network, Network Models for Distributed Computing, Network Economics and Incentive-Based Computing Related to Networks, Network Mining and Analysis, Parallel, Distributed and External Memory Computing, Quantum Computing, Randomness in Computation, Theory of Security in Networks Track B -- Algebraic and Categorical Models, Automata, Games, and Formal Languages, Emerging and Non-standard Models of Computation, Databases, Semi-Structured Data and Finite Model Theory, Formal and Logical Aspects of Learning, Logic in Computer Science, Theorem Proving and Model Checking, Models of Concurrent, Distributed, and Mobile Systems, Models of Reactive, Hybrid and Stochastic Systems, Principles and Semantics of Programming Languages, Program Analysis and Transformation, Specification, Verification and Synthesis, Type Systems and Theory, Typed Calculi PC Track A chair: Artur Czumaj (University of Warwick) PC Track B chair: Anuj Dawar (University of Cambridge) Contact All questions about submissions should be emailed to the PC Track chairs: Artur Czumaj A.Czumaj(a)warwick.ac.uk Anuj Dawar Anuj.Dawar(a)cl.cam.ac.uk

1 0

27th WoLLIC 2020 (Lima, Peru) - 3rd Call for Papers
by Ruy de Queiroz 07 Feb '20

07 Feb '20

[Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2020 27th Workshop on Logic, Language, Information and Computation August 4th to 7th, 2020 Lima, Peru ORGANISATION Universidad de Ingenieria y Tecnologia, Lima, Peru Centro de Informática, Universidade Federal de Pernambuco, Brazil CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-seventh WoLLIC will be held at Universidad de Ingenieria y Tecnologia, Lima, Peru from August 4th to 7th, 2020. It is scientifically sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2020 EasyChair website. (Please go to http://wollic.org/wollic2020/instructions.html for instructions.) PROCEEDINGS The proceedings of WoLLIC 2020, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2020 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Catarina Dutilh Novaes (VU Amsterdam) Santiago Figueira (Universidad de Buenos Aires, Argentina) Andreas Herzig (IRIT, France) Cláudia Nalon (UnB - Brazil) Giselle Reis (CMU - Qatar) STUDENT GRANTS ASL sponsorship of WoLLIC 2020 will permit ASL student members to apply for a limited travel grant (deadline: 90 days before the event starts). Visit https://aslonline.org/meetings/student-travel-awards/ for details. IMPORTANT DATES April 15, 2020: Full paper deadline May 23, 2020: Author notification May 30, 2019: Final version deadline (firm) PROGRAMME COMMITTEE Carlos Areces (Cordoba, Argentina) Arthur Amorim Azevedo (CMU, USA) Paul Brunet (UCL, UK) Nina Gierasimczuk (Technical University of Denmark, Denmark) Helle Hansen (TU Delft, The Netherlands) Justin Hsu (University of Wisconsin–Madison, USA) Fairouz Kamareddine (Heriot-Watt University, UK) Sandra Kiefer (Aachen University, Germany) Clemens Kupke (Strathclyde University, Scotland) Konstantinos Mamouras (Rice University, USA) Maria Vanina Martinez (Universidad de Buenos Aires, Argentina) Larry Moss (Indiana Univ, USA) Claudia Nalon (University of Brasília, Brazil) Valeria de Paiva (Samsung Research, USA) Elaine Pimentel (UFRN, Brazil) Revantha Ramanayake (TU Wien, Austria) Jurriaan Rot (Radboud University, The Netherlands) Yamilet Serrano (UTEC, Peru) Alexandra Silva (Univ College London) (Co-Chair) Christine Tasson (IRIF, France) Sebastiaan Terwijn (Radboud University, The Netherlands) Renata Wassermann (Univ São Paulo) (Co-Chair) STEERING COMMITTEE Samson Abramsky, Anuj Dawar, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Lawrence Moss, Luke Ong, Valeria de Paiva, Ruy de Queiroz. ADVISORY COMMITTEE Johan van Benthem, Joe Halpern, Wilfrid Hodges, Angus Macintyre, Hiroakira Ono, Jouko Väänänen. ORGANISING COMMITTEE Ernesto Quadro-Vargas (Universidad de Ingenieria y Tecnologia, Lima, Peru) (Local chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS It is planned to have a special session with the exhibition of a one-hour documentary film about a remarkable mathematician whose contributions were recognized with a Fields Medal just a few years before her untimely death. It is a joint production (still on its course) of The Mathematical Sciences Research Institute (MSRI) and George Csicsery (Zala Films): ‘Secrets of the Surface - The Mathematical Vision of Maryam Mirzakhani’. “The biographical film is about Maryam Mirzakhani, a brilliant woman, and Muslim immigrant to the United States who became a superstar in her field. The story of her life will be complemented with sections about Mirzakhani’s mathematical contributions, as explained by colleagues and illustrated with animated sequences. Throughout, we will look for clues about the sources of Mirzakhani’s insights and creativity." (http://www.zalafilms.com/secrets/) FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2020/

1 0

CfP: NLA'20 Deadline Extended: final
by Roussanka Loukanova 07 Feb '20

07 Feb '20

Special Session on Natural Language and Argumentation 2020 (NLA'20) https://www.dcai-conference.net/special-sessions/nla20 at DCAI 2020: 17th International Conference on Distributed Computing and Artificial Intelligence L'Aquila, Italy, 17-19 June 2020 Paper Submission Deadline Extended: **** 17th February, 2020 **** Scope We are in the reality of natural and computational systems of argumentation provided by reasoning, with natural and artificial languages. Intelligent systems of argumentation target advanced methods for exchanging, saving, reasoning, accessing, and updating information in memory. The special session on Natural Language and Argumentation (NLA) covers theories and applications. Formal models of argumentation like the Dung framework assume that natural language arguments have properly been mapped to logical formulas or partial proofs. Argument mining, when mainly working with existing machine learning methods, encounters difficulties to properly analyse arguments and relations between arguments, over general data, and especially when natural language expressions involve logical constructions. On the other side, traditional methods map sentences to logical formulas, which can be available after having been handled by a theorem prover. E.g., categorial analyses yield discourse representation structures, by using a parser (like Boxer, or Grail), and theorem provers (e.g., Coq) handle corresponding logical representations. The first two approaches (the Dung framework, and typical argument mining) suffer from the lack of development of the relations between natural language texts and dialogues, and do not handle the logical structure of meanings, while the third one (the predominant, traditional logical approach) is limited by the lack of sophisticated semantic lexicon for encompassing the logical structure carried by some words, and interconnections with other methods. Topics We welcome submissions on the following topics, without limiting to them, across approaches, methods, theories, implementations, and applications, in support of argumentation: - Formal models of argumentations (e.g., Dung's framework) - Logic of preferences - Argument mining - Theorem provers and assistants - Model checkers - Theory of computation - Theory of information - Natural language inference - Beliefs, attitudes, persuasions - theories and applications - Formal languages in support of reasoning and argumentation - Algorithms related to natural language and argumentation - theories, implementations, applications - Mapping NL expressions into logical representations - Syntactic and semantic analyses of natural language - Computational methods to natural language - approaches, theories - Computational syntax, semantics, and/or interfaces between them - NLP argument mining - Ambiguity and underspecification in syntax and semantics - Discourse and context dependency - Reasoning with ambiguity and underspecification - Interactive computation, reasoning, argumentation - Computation with heterogeneous information - Reasoning with heterogeneous and/or inconsistent information - Dialog, interactions - Interdisciplinary approaches to language, computation, reasoning, memory, relevant for argumentation - Argumentation in AI applications: e.g., to business, economy, justice, health, medical sciences - ... Important Dates Paper submission deadline: 17th February, 2020 (extended from: 31 January, 2020) Notification of acceptance: 09 March, 2020 Camera-Ready papers due: 30 March, 2020 Conference: 17-19 June, 2020 Paper Submission https://www.dcai-conference.net/special-sessions All papers must be formatted according to the AISC, Springer, template, with a maximum length of 8 pages, including figures and references. All proposed papers must be submitted in electronic form (PDF format) using the DCAI 2020 conference management system: https://www.dcai-conference.net/submission Publication For inclusion of an accepted paper in the conference proceedings, at least one of the authors will be required to register and attend the symposium to present the paper. All accepted and presented papers will be published by the Advances in Intelligent Systems and Computing, AISC, Springer Verlag. Organizing Committee Stergios Chatzikyriakidis, University of Gothenburg, Sweden Emiliano Lorini, CNRS, IRIT, France Roussanka Loukanova, Stockholm University, Sweden; and, IMI, Bulgarian Academy of Sciences, Bulgaria Richard Moot, LIRMM-CNRS, Montpellier, France Christian Retoré, Université de Montpellier and LIRMM-CNRS, Montpellier, France

1 0

WiL 2020 - Call for contributions
by Sandra Alves 07 Feb '20

07 Feb '20

------------------------------------------------------------------------------- Are you a woman working in logic? Are you planning to participate at FSCD-IJCAR 2020 in Paris? Please join us at WiL, give a talk, and enjoy a day with Women in Logic ! Please submit an abstract of 1-2 pages by April 22, 2020 via EasyChair. This will help us provide an interesting program, with only a light-weight selection procedure. More information below: ------------------------------------------------------------------------------------------------ Call for Contributions WiL 2020: 4th Women in Logic Workshop Paris, France 30 June 2020 ------------------------------------------------------------------------------ Women in Logic 2020 is part of "Paris Nord Summer of LoVe 2020" (https://lipn.univ-paris13.fr/summer-of-love-2020/ <https://lipn.univ-paris13.fr/summer-of-love-2020/>), a joint event on LOgic and VErification at Université Paris 13, made of Petri Nets 2020, IJCAR 2020, FSCD 2020, and over 20 satellite events. The Women in Logic workshop (WiL) provides an opportunity to increase awareness of the valuable contributions made by women in the area of logic in computer science. Its main purpose is to promote the excellent research done by women, with the ultimate goal of increasing their visibility and representation in the community. Our aim is to: - provide a platform for female researchers to share their work and achievements; - increase the feelings of community and belonging, especially among junior faculty, post-docs and students through positive interactions with peers and more established faculty; - establish new connections and collaborations; - foster a welcoming culture of mutual support and growth within the logic research community. We believe these aspects will benefit women working in logic and computer science, particularly early-career researchers. Previous versions of Women in Logic (Reykjavik, Iceland 2017, Oxford, UK 2018 and Vancouver, Canada 2019) were very successful in showcasing women's work and as catalysts for recognition of the need for change in the community. Topics of interest include but are not limited to: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. INVITED SPEAKERS TBA IMPORTANT DATES Abstract submission deadline: April 22, 2020 Notification: May 21, 2020 SUBMISSIONS Abstracts should be written in English (1-2 pages), and prepared using the Easychair style (https://easychair.org/publications/for_authors <https://easychair.org/publications/for_authors>). The abstracts should be uploaded to the WiL 2020 Easychair page as a PDF file (https://easychair.org/conferences/?conf=wil2020 <https://easychair.org/conferences/?conf=wil2020>) before the submission deadline of April 22, 2020, anywhere on Earth. ORGANIZING AND PROGRAM COMMITTEE * Sandra Alves (Co-chair, University of Porto) * Amy Felty (University of Ottawa) * Delia Kesner (Université de Paris) * Sandra Kiefer (Co-chair, RWTH Aachen University) * Koko Muroya (RIMS Kyoto University) * Daniele Nantes (University of Brasília) * Valeria de Paiva (Samsung Research America) * Brigitte Pientka (McGill University) * Sonja Smets (ILLC - University of Amsterdam) * Ana Sokolova (Co-chair, University of Salzburg) ---------------------------------------------------------------------------------

1 0

ACKERMANN AWARD 2020: CALL FOR NOMINATIONS
by EACSL Mail-Account 07 Feb '20

07 Feb '20

ACKERMANN AWARD 2020 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR LOGIC IN COMPUTER SCIENCE CALL FOR NOMINATIONS Nominations are now invited for the 2020 Ackermann Award. PhD dissertations in topics specified by the CSL and LICS conferences, which were formally accepted as PhD theses at a university or equivalent institution between 1.1.2018 and 31.12.2019 are eligible for nomination for the award. The deadline for submission is 1 April 2020. Submission details follow below. Nominations can be submitted from 1 January 2020 and should be sent to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de *** The Award The 2020 Ackermann award will be presented to the recipient(s) at CSL 2021, the annual conference of the EACSL. The award consists of * a certificate, * an invitation to present the thesis at the CSL conference, * the publication of the laudatio in the CSL proceedings, and * financial support to attend the conference. The jury is entitled to give the award to more (or less) than one dissertation in a year. *** The Jury The jury consists of: * Christel Baier (TU Dresden); * Michael Benedikt (Oxford University); * Mikolaj Bojanczyk (University of Warsaw); * Jean Goubault-Larrecq (ENS Paris-Saclay); * Prakash Panangaden (McGill University); * Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL; * Thomas Schwentick (TU Dortmund) , the president of EACSL; * Alexandra Silva, (University College London), ACM SigLog representative. *** How to submit The candidate or his/her supervisor should submit 1. the thesis (ps or pdf file); 2. a detailed description (not longer than 20 pages) of the thesis in ENGLISH (ps or pdf file); 3. a supporting letter by the PhD advisor and two supporting letters by other senior researchers (in English); supporting letters can also be sent directly to Thomas Schwentick (thomas.schwentick(a)tu-dortmund.de); 4. a short CV of the candidate; 5. a copy of the document asserting that the thesis was accepted as a PhD thesis at a recognized University (or equivalent institution) and that the candidate has received his/her PhD within the specified period. The submission should be sent by e-mail as attachments to the chairman of the jury, Thomas Schwentick: thomas.schwentick(a)tu-dortmund.de With the following subject line and text: * Subject: Ackermann Award 20 Submission * Text: Name of candidate, list of attachments Submission can be sent via several e-mail messages. If this is the case, please indicate it in the text.

1 0

CSL 2021 first call for papers
by Jean Goubault-Larrecq 07 Feb '20

07 Feb '20

===================================== First call for papers (CSL'21) ===================================== Computer Science Logic (CSL) is the annual conference of the European Association for Computer Science Logic (EACSL), see https://www.eacsl.org/. It is an interdisciplinary conference, spanning across both basic and application oriented research in mathematical logic and computer science. CSL'21 will be held on January 25-28, 2021, in Ljubljana, Slovenia. Submission guidelines: ---------------------- Submitted papers must be in English and must provide sufficient detail to allow the Programme Committee to assess the merits of the paper. Full proofs may appear in a clearly marked technical appendix which will be read at the reviewers' discretion. Authors are strongly encouraged to include a well written introduction which is directed at all members of the PC. The CSL 2020 conference proceedings will be published in Leibniz International Proceedings in Informatics (LIPIcs), see https://submission.dagstuhl.de/documentation/authors. Authors are invited to submit contributed papers of no more than 15 pages in LIPIcs style (not including references), presenting unpublished work fitting the scope of the conference. Papers may not be submitted concurrently to another conference with refereed proceedings. The PC chairs should be informed of closely related work submitted to a conference or a journal. Papers authored or co-authored by members of the PC are not allowed. At least one of the authors of each accepted paper is expected to attend the conference in person to present their papers. Important dates: ---------------- paper submission: July 1, 2020 (AoE) notification: September 25, 2020 conference: January 25-28, 2021 List of topics: --------------- automated deduction and interactive theorem proving constructive mathematics and type theory equational logic and term rewriting automata and games, game semantics modal and temporal logic model checking decision procedures logical aspects of computational complexity finite model theory computational proof theory logic programming and constraints lambda calculus and combinatory logic domain theory categorical logic and topological semantics database theory specification, extraction and transformation of programs logical aspects of quantum computing logical foundations of programming paradigms verification and program analysis linear logic higher-order logic nonmonotonic reasoning Program Committee: ------------------ * Andreas Abel, University of Gothenburg, Sweden * Zena M. Ariola, University of Oregon, USA * Jeremy Avigad, Carnegie Mellon University, USA * Christel Baier, Technische Universität Dresden, Germany (co-chair) * Jasmin Blanchette, Vrije Universiteit Amsterdam, the Netherlands * Jean Goubault-Larrecq, ENS Paris-Saclay, France (co-chair) * Masahito Hasegawa, Kyoto University, Japan * Jean-Baptiste Jeannin, University of Michigan, USA * Michael Kaminski, Technion Haifa, Israel * Delia Kesner, Université de Paris, France * Laura Kovács, Vienna University of Technology, Austria * Martin Lange, University of Kassel, Germany * Sławomir Lasota, Warsaw University, Poland * Florin Manea, Georg-August Universität Göttingen, Germany * Stefan Milius, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany * Antoine Mottet, Charles University, Czech Republic * Andrzej Murawski, University of Oxford, UK * Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brasil * Sophie Pinchinat, IRISA Rennes, France * Simona Ronchi Della Rocca, Università di Torino, Italy * Krishna S, IIT Bombay, India * Peter Selinger, Dalhousie University, Canada * Sebastian Siebertz, Universität Bremen, Germany * Alex Simpson, University of Ljubljana, Slovenia (organizer) * Marie Van Den Bogaard, Université Libre de Bruxelles * Yde Venema, Universiteit van Amsterdam, the Netherlands Organization Committee: ----------------------- Alex Simpson (University of Ljubljana, chair) Andrej Bauer (University of Ljubljana) Daniel Ahman (University of Ljubljana) Contact: -------- Please send all questions about submissions to the PC co-chairs: csl2021(a)easychair.org

1 0

Caleidoscope Complexity School: Call for Participation
by Thomas Seiller 06 Feb '20

06 Feb '20

*** Call for participation *** Caleidoscope: Research School in Computational Complexity Paris, 15-19 June 2020 http://caleidoscope20.sciencesconf.org/ <http://caleidoscope20.sciencesconf.org/> Dear all, We are delighted to announce the second edition of the Caleidoscope Research School in Computational Complexity, to take place in Paris, 15-19 June 2020. The school is aimed at graduate students and researchers who already work in some aspects of computational complexity and/or who would like to learn about the various approaches. DESCRIPTION Computational complexity theory was born more than 50 years ago when researchers started asking themselves what could be computed efficiently. Classifying problems/functions with respect to the amount of resources (e.g. time and/or space) needed to solve/compute them turned out to be an extremely difficult question. This has led researchers to develop a remarkable variety of approaches, employing different mathematical methods and theories. The future development of complexity theory will require a subtle understanding of the similarities, differences and limitations of the many current approaches. In fact, even though these study the same phenomenon, they are developed today within disjoint communities, with little or no communication between them (algorithms, logic, programming theory, algebra...). This dispersion is unfortunate since it hinders the development of hybrid methods and more generally the advancement of computational complexity as a whole. The goal (and peculiarity) of the Caleidoscope school is to reunite in a single event as many different takes on computational complexity as can reasonably be fit in one week. It is intended for graduate students as well as established researchers who wish to learn more about neighbouring areas. LECTURES 1. Algorithms and lower bounds. Lecturer: Ryan Williams, MIT. 2. Hardness of Approximation. Lecturer: Luca Trevisan, Bocconi University. 3. Higher-Order Complexity. Lecturer: Bruce Kapron, University of Victoria. 4. Parametrized Complexity. Lecturer: Daniel Marx, Max Planck Institute Saarbrucken. In addition to these broad-ranging themes, there will also be three tutorials on more focussed topics. 5. Quantum Computation and Complexity. Lecturer: Elham Kashefi, CNRS and Sorbonne University. 6. Static Complexity Analysis. Lecturer: Georg Moser, University of Innsbruck. 7. Complexity Theory for Black-Box Optimization Heuristics. Lecturer: Carola Doerr, CNRS and Sorbonne University. REGISTRATION Registration to the school is free but mandatory. This is to help us plan tea/coffee breaks and social activities. https://caleidoscope20.sciencesconf.org/registration/ <https://caleidoscope20.sciencesconf.org/registration/> FINANCIAL SUPPORT There may be opportunities for financial support for participants. We will make relevant information available via the webpage. https://caleidoscope20.sciencesconf.org/ <https://caleidoscope20.sciencesconf.org/> ORGANISERS Damiano Mazza — CNRS & Université Sorbonne Paris Nord Sylvain Perifel — Université Paris 7 Thomas Seiller — CNRS & Université Sorbonne Paris Nord SPONSORS European Mathematical Society (EMS) DIM RFSI - Région Île-de-France (https://dim-rfsi.fr/) CNRS (https://www.cnrs.fr/en) Université Sorbonne Paris Nord (https://www.univ-paris13.fr/en/) Laboratoire d'Informatique de Paris Nord (https://lipn.univ-paris13.fr/) Université Paris 7 (https://www.univ-paris-diderot.fr) Institut de Recherche en Informatique Fondamentale (https://www.irif.fr/en/index)

1 0

Conference on Erwin Engeler’s 90th birthday and Ernst Specker’s centenary
by Johann A. Makowsky 05 Feb '20

05 Feb '20

https://math.ethz.ch/news-and-events/events/conferences-and-workshops/2020/… Celebrating and commemorating Main content Conference on Erwin Engeler’s 90th birthday and Ernst Specker’s centenary 21–22 February 2020 ETH Zürich, HG G 19.1 In February 2020 will be Ernst Specker’s centenary and Erwin Engeler’s 90th birthday. The Annual Meeting 2020 of the Swiss Society for Logic and Philosophy of Science will celebrate these two great and big birthdays. Succeeding Paul Bernays, these two prominent scientists from Zurich had a sustainable impact on mathematical logic and its relation to philosophy and informatics in the second half of the 20th century. The goal of the conference is to recall the work of those two great Swiss logicians and to point to its continuing significance and effectiveness. As this work is at the interface between mathematics, logic, philosophy, informatics and physics, the conference will be of special interest for researchers and students in those different scientific disciplines. This conference is supported by the Swiss Academy of Sciences as well as by the Swiss Mathematical Society. Organizers Gerhard Jäger (Berne University), Reinhard Kahle (Tübingen University), Giovanni Sommaruga (ETH Zürich) Speakers Titles and abstracts (PDF, 78 KB) In honour of Erwin Engeler and Ernst Specker Friday 21.2.2020 09.35–10.20 Stathis Zachos (Athens) 10.20–11.05 Erich Grädel (Aachen) 11.05–11.50 Angus Macintyre (London) Erwin Engeler’s angels Friday 21.2.2020 13.30–14.15 Karl Aberer (Lausanne) 14.15–15.00 Wolfgang Küchlin (Tübingen) 15.30–16.15 Roman Mäder (Zürich) 16.15–17.00 Preda Mihailescu (Göttingen) 17.00–17.45 Beat Brüderlin (Ilmenau) Ernst Specker reloaded Saturday 22.2.2020 09.30–10.15 Janos Makowsky (Haifa) 10.15–11.00 Jürg Fröhlich (Zürich) 11.00–11.45 Stefan Wolf and Arne Hansen (Berne/Lugano) Additional Information Department of Mathematics Logo Swiss academy of sciences logo Swiss Mathematical Society logo Contact ETH Zurich Professur für Philosophie Prof. Dr. Giovanni Sommaruga CLD C 6 Clausiusstrasse 37 8092 Zürich Switzerland +41 44 632 08 92 E-mail -- Prof. J.A. Makowsky Faculty of Computer Science Technion - Israel Institute of Technology Haifa 32000 http://www.cs.technion.ac.il/~janos

1 0