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

TABLEAUX 2019 (London): DEADLINE EXTENSION and final call for papers
by Andrei Popescu 23 Apr '19

23 Apr '19

TABLEAUX 2019 The 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods London, UK, September 3-5, 2019 Website: https://www.tableaux2019.org Contact: chair(a)tableaux2019.org Due to requests from potential authors and from current authors wishing to polish their papers, we have extended the submission deadlines. The new deadlines are: 1 May 2019 (abstract), 8 May 2019 (paper) Authors who have a good paper and are in doubt whether to send it to TABLEAUX may note some highlights of this year's edition: two affiliated workshops, two affiliated tutorials, a financially supported best paper award for young researchers, five outstanding invited speakers (to be announced soon) and some support for young researchers traveling to the conference (including widely available cheap accommodation). We hope to see many of you this September in London -- in the beautiful campus of the Middlesex University, located 40 minutes from the city center and 20 minutes from Camden Town's iconic music venues! GENERAL INFORMATION The 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2019) will take place in London. It will be hosted by the Department of Computer Science at the Middlesex University London, on 3-5 September 2019. TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- of the mechanization of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organized on an annual basis; in 2001, 2004, 2006, 2008, 2010, 2012, 2014, 2016 and 2018 as a constituent of IJCAR. TABLEAUX 2019 will be co-located with the 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For many logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations; * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * flexible, easily extendable, light-weight methods for theorem proving; novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, proof assistants, logical frameworks, model checkers, etc.); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); * extensions of tableau procedures with conflict-driven learning; * techniques for proof generation and compact (or humanly readable) proof representation; * theoretical and practical aspects of decision procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real-world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning and on logical aspects of the solution. SUBMISSION GUIDELINES Submissions are invited in three categories: (A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references; (B) system descriptions, with length up to 9 pages excluding references; (C) position papers and brief reports on work in progress, with length up to 9 pages excluding references. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version. For category A submissions, the reported results must be original and not submitted for publication elsewhere. For category B submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories A and B will be published in the conference proceedings. Accepted papers in category C will be published as a Technical Report of the Middlesex University London. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: http://easychair.org/conferences/?conf=tableaux2019 For all accepted papers at least one author is required to attend the conference and present the paper. A title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui… IMPORTANT DATES Abstract submission: 1 May 2019 Paper submission: 8 May 2019 Notification of paper decisions: 6 Jun 2019 Camera-ready papers due: 1 Jul 2019 TABLEAUX conference: 3-5 Sep 2019 PUBLICATION DETAILS The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARDS The program committee will select (1) the TABLEAUX 2019 Best Paper and (2) the TABLEAUX 2019 Best Paper by a Junior Researcher, of which the latter will be supported by 500 Euros. Researchers will be considered junior if either they are students or their PhD degree date is less than two years from the first day of the meeting. "Paper by a Junior Researcher" means that the paper's main author(s) is/are junior; this information should be indicated by adding a star (*) at the submission's title and at the submission's junior author(s) name(s). The two awards will be presented at the conference. SUPPORT FOR STUDENT AND YOUNG RESEARCHER PARTICIPATION We have some limited funding for supporting students and young researchers traveling to the conference -- courtesy of direct sponsorship from Amazon and Springer and indirect sponsorship from the Association for Symbolic Logic. In addition, some funding will be available through the EUTypes COST action website. In all cases, authors of accepted papers will be given precedence. Please see the conference website for more details. In addition, the Middlesex University is offering accommodation at a £30 daily rate in some excellently maintained shared flats located close to the conference venue (https://www.mdx.ac.uk/student-life/accommodation/platt-hall). AFFILIATED EVENTS (COMMON WITH FroCoS) WORKSHOPS: * The 25th Workshop on Automated Reasoning (ARW 2019, http://arw.csc.liv.ac.uk) Organizers: Florian Kammueller (Middlesex University) and Alexander Bolotov (University of Westminster) * Journeys in Computational Logic: Tributes to Roy Dyckhoff Organizers: Stéphane Graham-Lengrand (SRI International), Ekaterina Komendantskaya (Heriot-Watt University) and Mehrnoosh Sadrzadeh (Queen Mary University of London) TUTORIALS: * Formalising concurrent computation: CLF, Celf, and applications (joint FroCoS/TABLEAUX tutorial). Presenters: Sonia Marin (IT-University of Copenhagen), Giselle Reis (Carnegie Mellon University in Qatar) and Iliano Cervesato (Carnegie Mellon University) * How to Build an Automated Theorem Prover - An Introductory Tutorial (invited TABLEAUX tutorial). Presenter: Jens Otten (University of Oslo) PROGRAM COMMITTEE Peter Baumgartner, Data61/CSIRO, Australia Maria Paola Bonacina, Università degli Studi di Verona, Italy James Brotherston, University College London, UK Serenella Cerrito, IBISC, Univ. Evry, Paris Saclay University, France Agata Ciabattoni, Technische Universität Wien, Austria Anupam Das, University of Copenhagen, Denmark Clare Dixon, University of Liverpool, UK Camillo Fiorentini, University of Milano, Italy Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Martin Giese, Universitetet i Oslo, Norway Laura Giordano, DISIT, Università del Piemonte Orientale, Italy Rajeev Goré, The Australian National University, Australia Stéphane Graham-Lengrand, SRI International, USA Reiner Hähnle, TU Darmstadt, Germany Ori Lahav, Tel Aviv University, Israel Tomer Libal, American University of Paris, France George Metcalfe, Universität Bern, Switzerland Dale Miller, INRIA and LIX/Ecole Polytechnique, France Leonardo de Moura, Microsoft Research, USA Neil Murray, SUNY at Albany, USA Cláudia Nalon, University of Brasília, Brazil Sara Negri, University of Helsinki, Finland Hans de Nivelle, Nazarbayev University, Kazakhstan Nicola Olivetti, LSIS, Aix-Marseille Université, France Jens Otten, Universitetet i Oslo, Norway Valeria De Paiva, Nuance Communications, USA Nicolas Peltier, CNRS, Laboratoire d'Informatique de Grenoble, France Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Francesca Poggiolesi, CNRS, IHST Paris, France Andrei Popescu, Middlesex University London, UK Gian Luca Pozzato, University of Turin, Italy Giles Reger, University of Manchester, UK Giselle Reis, Carnegie Mellon University, Qatar Renate Schmidt, University of Manchester, UK Viorica Sofronie-Stokkermans, Universität Koblenz-Landau, Germany Alwen Tiu, Australian National University, Australia Sophie Tourret, Max-Planck-Institut für Informatik, Saarbrücken, Germany Dmitriy Traytel, ETH Zürich, Switzerland Josef Urban, Czech Institute of Informatics, Robotics and Cybernetics, Czech Republic Luca Viganò, King's College, London, UK Uwe Waldmann, Max-Planck-Institut für Informatik, Saarbrücken, Germany Bruno Woltzenlogel Paleo, Vienna University of Technology, Austria PC CHAIRS Serenella Cerrito, IBISC, Univ. Evry, Paris Saclay University, France Andrei Popescu, Middlesex University London, UK LOCAL ORGANIZATION COMMITTEE Kelly Androutsopoulos, Middlesex University London, UK Jaap Boender, Middlesex University London, UK Michele Bottone, Middlesex University London, UK Florian Kammueller, Middlesex University London, UK Rajagopal Nagarajan, Middlesex University London, UK Andrei Popescu, Middlesex University London, UK Franco Raimondi, Middlesex University London, UK CONFERENCE CHAIR Andrei Popescu, Middlesex University London, UK

1 0

QBF 2019 - call for papers
by HUBERT MING CHEN 23 Apr '19

23 Apr '19

[We apologize if you receive multiple copies of this call] ---------------------------------------------------------------------- CALL FOR PAPERS QBF 2019 -------- International Workshop on Quantified Boolean Formulas and Beyond Lisbon, Portugal, July 7, 2019 http://fmv.jku.at/qbf19/ Affiliated to and co-located with: Int. Conf. on Theory and Applications of Satisfiability Testing (SAT'19) Lisbon, Portugal, July 7-12, 2019 ---------------------------------------------------------------------- Quantified Boolean formulas (QBF) are an extension of propositional logic which allows for explicit quantification over propositional variables. The decision problem of QBF is PSPACE-complete, compared to the NP-completeness of the decision problem of propositional logic (SAT). Many problems from application domains such as model checking, formal verification or synthesis are PSPACE-complete, and hence could be encoded in QBF in a natural way. Considerable progress has been made in QBF solving throughout the past years. However, in contrast to SAT, QBF is not yet widely applied to practical problems in academic or industrial settings. For example, the extraction and validation of models of (un)satisfiability of QBFs and has turned out to be challenging, given that state-of-the-art solvers implement different solving paradigms. The goal of the International Workshop on Quantified Boolean Formulas (QBF Workshop) is to bring together researchers working on theoretical and practical aspects of QBF solving. In addition to that, it addresses (potential) users of QBF in order to reflect on the state-of-the-art and to consolidate on immediate and long-term research challenges. The workshop also welcomes work on reasoning with quantifiers in related problems, such as dependency QBF (DQBF), quantified constraint satisfaction problems (QCSP), and satisfiability modulo theories (SMT) with quantifiers. =============== INVITED SPEAKER =============== Alexander Feldman, PARC =============== IMPORTANT DATES =============== May 15: Submission June 1: Notification June 15: Camera-ready versions Please see the workshop webpage for any updates: http://fmv.jku.at/qbf19/ ====================== CALL FOR CONTRIBUTIONS ====================== The workshop is concerned with all aspects of current research on all formalisms enriched by quantifiers, and in particular QBF. The topics of interest include (but are not limited to): Applications, encodings and benchmarks with quantifiers QBF Proof theory and complexity results Experimental evaluations of solvers or related tools Case studies illustrating the power of quantifiers Certificates and proofs for QBF, QCSP, SMT with quantifiers, etc. Formats of proofs and certificates Implementations of proof checkers and verifiers Decision procedures Calculi and their relationships Data structures, implementation details and heuristics Pre- and inprocessing techniques Structural reasoning ========== SUBMISSION ========== Submissions of extended abstracts are invited and will be managed via Easychair: https://easychair.org/conferences/?conf=qbf19 In particular, we invite the submission of extended abstracts on work that has been published already, novel unpublished work, or work in progress. The following forms of submissions are solicited: - Proposals for short tutorial presentations on topics related to the workshop. Tutorial proposals will be reviewed by the PC. The number of accepted tutorials depends on the overall number of accepted papers and talks, with the aim to set up a balanced workshop program. - Talk abstracts reporting on already published work. Such an abstract should include an outline of the planned talk, and pointers to relevant bibliography. - Talk proposals presenting work that is unpublished or in progress. - Submissions which describe novel applications of QBF or related formalisms in various domains are particularly welcome. Additionally, this call comprises known applications which have been shown to be hard for QBF solvers in the past as well as new applications for which present QBF solvers might lack certain features still to be identified. Each submission should have an overall length of 1-4 pages in LNCS format. Authors may decide to include an appendix with additional material. Appendices will be considered at the reviewers' discretion. The accepted extended abstracts will be published on the workshop webpage. The workshop does not have formal proceedings. Authors of accepted contributions are expected to give a talk at the workshop. ======= CONTACT ======= qbf19(a)easychair.org =============================== PROGRAM CHAIRS AND ORGANIZATION =============================== Hubie Chen, Birbeck, University of London Florian Lonsing, Stanford University Martina Seidl, University of Linz, Austria Friedrich Slivovsky, TU Wien, Austria

1 0

FroCoS 2019 (London): DEADLINE EXTENSION and final call for papers
by Andrei Popescu 23 Apr '19

23 Apr '19

FroCoS 2019 The 12th International Symposium on Frontiers of Combining Systems London, UK, September 4-6, 2019 Website: https://www.frocos2019.org Contact: chair(a)frocos2019.org Due to requests from potential authors and from current authors wishing to polish their papers, we have extended the submission deadlines. The new deadlines are: 1 May 2019 (abstract), 8 May 2019 (paper) Authors who have a good paper and are in doubt whether to send it to FroCoS may note some highlights of this year's edition: two affiliated workshops, two affiliated tutorials, a financially supported best paper award, five outstanding invited speakers (to be announced soon) and some support for young researchers traveling to the conference (including widely available cheap accommodation). We hope to see many of you this September in London -- in the beautiful campus of the Middlesex University, located 40 minutes from the city center and 20 minutes from Camden Town's iconic music venues! GENERAL INFORMATION The 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019) will take place in London. It will be hosted by the Department of Computer Science at the Middlesex University London, from 4 to 6 September 2019. FroCoS is the main international event for research on the development of techniques and methods for the combination and integration of formal systems, their modularization and analysis. The first FroCoS symposium was held in Munich, Germany, in 1996. Initially held every two years, since 2004 it has been organized annually with alternate years forming part of IJCAR. If we also count the IJCAR editions, this year FroCoS celebrates its 20th edition. FroCoS 2019 will be co-located with the 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2019). The two conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference systems for selected tasks. To be usable in practice, these specialized systems must be combined with each other and integrated into general purpose systems. This has led to the development of techniques and methods for the combination and integration of dedicated formal systems, as well as for their modularization and analysis. FroCoS traditionally focuses on these types of research questions and activities. Like its predecessors, FroCoS 2019 seeks to offer a common forum for research in the general area of combination, modularization, and integration of systems, with emphasis on logic-based methods and their practical use. Topics of interest for FroCoS 2019 include (but are not restricted to): * combinations of logics (such as higher-order, first-order, temporal, modal, description or other non-classical logics) * combination and integration methods in SAT and SMT solving * combination of decision procedures, satisfiability procedures, constraint solving techniques, or logical frameworks * combination of logics with probability and/or fuzzy measures * combinations and modularity in ontologies * integration of equational and other theories into deductive systems * hybrid methods for deduction, resolution and constraint propagation * hybrid systems in knowledge representation and natural language semantics * combined logics for distributed and multi-agent systems * logical aspects of combining and modularizing programs and specifications * integration of data structures into constraint logic programming and deduction * combinations and modularity in term rewriting * methods and techniques for the verification and analysis of information systems * methods and techniques for combining logical reasoning with machine learning SUBMISSION GUIDELINES The program committee seeks high-quality submissions describing original work, written in English, not overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages in total, including references and figures. Any additional material (going beyond the page limit) can be included in a clearly marked appendix. This appendix will be read at the discretion of the committee, and must be removed for the camera-ready version. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via EasyChair at https://easychair.org/conferences/?conf=frocos2019 Log in to EasyChair for FroCoS 2019<https://easychair.org/conferences/?conf=frocos2019> easychair.org EasyChair uses cookies for user authentication. To use EasyChair, you should allow your browser to save cookies from easychair.org. For each accepted paper, at least one of the authors is required to attend the conference and present the work. Prospective authors must register a title and an abstract three days before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui… IMPORTANT DATES Abstract submission: 1 May 2019 Paper submission: 8 May 2019 Notification of paper decisions: 6 Jun 2019 Camera-ready papers due: 1 Jul 2019 FroCoS conference: 4-6 Sep 2019 PUBLICATION DETAILS The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARD The program committee will select the FroCoS 2019 Best Paper, which will be awarded 500 Euros. The award will be presented at the conference. SUPPORT FOR STUDENT AND YOUNG RESEARCHER PARTICIPATION We have some limited funding for supporting students and young researchers traveling to the conference -- courtesy of direct sponsorship from Amazon and Springer and indirect sponsorship from the Association for Symbolic Logic. In addition, some funding will be available through the EUTypes COST action website. In all cases, authors of accepted papers will be given precedence. Please see the conference website for more details. In addition, the Middlesex University is offering accommodation at a £30 daily rate in some excellently maintained shared flats located close to the conference venue (https://www.mdx.ac.uk/student-life/accommodation/platt-hall). AFFILIATED EVENTS (COMMON WITH TABLEAUX) WORKSHOPS: * The 25th Workshop on Automated Reasoning (ARW 2019, http://arw.csc.liv.ac.uk) Organizers: Florian Kammueller (Middlesex University) and Alexander Bolotov (University of Westminster) * Journeys in Computational Logic: Tributes to Roy Dyckhoff Organizers: Stephane Graham-Lengrand (SRI International), Ekaterina Komendantskaya (Heriot-Watt University) and Mehrnoosh Sadrzadeh (Queen Mary University of London) TUTORIALS: * Formalising concurrent computation: CLF, Celf, and applications (joint FroCoS/TABLEAUX tutorial). Presenters: Sonia Marin (IT-University of Copenhagen), Giselle Reis (Carnegie Mellon University in Qatar) and Iliano Cervesato (Carnegie Mellon University) * How to Build an Automated Theorem Prover - An Introductory Tutorial (invited TABLEAUX tutorial). Presenter: Jens Otten (University of Oslo) PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Córdoba, Argentina Alessandro Artale, Free University of Bolzano-Bozen, Italy Franz Baader, TU Dresden, Germany Christoph Benzmüller, Free University of Berlin, Germany Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, Netherlands Torben Braüner, Roskilde University, Denmark Clare Dixon, University of Liverpool, UK Marcelo Finger, University of São Paulo, Brazil Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Silvio Ghilardi, Università degli Studi di Milano, Italy Jürgen Giesl, RWTH Aachen, Germany Andreas Herzig, CNRS, IRIT, France Moa Johansson, Chalmers University, Sweden Jean Christoph Jung, University of Bremen, Germany Cezary Kaliszyk, University of Innsbruck, Austria Ekaterina Komendantskaya, Heriot-Watt University, UK Roman Kontchakov, Birkbeck, University of London, UK Alessio Lomuscio, Imperial College London, UK Assia Mahboubi, INRIA, France Stefan Mitsch, Carnegie Mellon University Cláudia Nalon, University of Brasília, Brazil Andrei Popescu, Middlesex University London, UK Silvio Ranise, Fondazione Bruno Kessler-Irst, Italy Christophe Ringeissen, LORIA-INRIA, France Philipp Rümmer, Uppsala University, Sweden Renate Schmidt, University of Manchester, UK Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany Christian Sternagel, University of Innsbruck, Austria Andrzej Szalas, Linköping University, Sweden Cesare Tinelli, University of Iowa, US Ashish Tiwari, SRI International, US Christoph Weidenbach, Max Planck Institute for Informatics, Germany PC CHAIRS Andreas Herzig, CNRS, IRIT, France Andrei Popescu, Middlesex University London, UK LOCAL ORGANIZATION COMMITTEE Kelly Androutsopoulos, Middlesex University London, UK Jaap Boender, Middlesex University London, UK Michele Bottone, Middlesex University London, UK Florian Kammueller, Middlesex University London, UK Rajagopal Nagarajan, Middlesex University London, UK Andrei Popescu, Middlesex University London, UK Franco Raimondi, Middlesex University London, UK LOCAL ORGANIZATION CHAIR Franco Raimondi, Middlesex University London, UK

1 0

LCC'19: 2nd Call for Contributions
by Lauri Hella (TAU) 18 Apr '19

18 Apr '19

=========================================================== 2nd Call for Contributions LCC 2019 20th International Workshop on Logic and Computational Complexity July 8, 2019, Patras, Greece Collocated with ICALP 2019 http://www.cs.swansea.ac.uk/lcc/ =========================================================== LCC meetings are aimed at the foundational interconnections between logic and computational complexity, as present, for example, in implicit computational complexity (descriptive and type-theoretic methods); deductive formalisms as they relate to complexity (e.g. ramification, weak comprehension, bounded arithmetic, linear logic and resource logics); complexity aspects of finite model theory and databases; complexity-mindful program derivation and verification; computational complexity at higher type; and proof complexity. The program will consist of invited lectures as well as contributed talks selected by the Program Committee. IMPORTANT DATES: * submission May 1, 2019 * notification May 20, 2019 * workshop July 8, 2019 INVITED SPEAKERS: * Daniel Leivant <https://www.cs.indiana.edu/~leivant/> (Indiana University, US) * Thomas Seiller <https://www.seiller.org/> (CNRS Paris, France) * Thomas Zeume (TU Dortmund, Germany) SUBMISSION: Submissions must be in English and in the form of an abstract of about 3-4 pages. All submissions should be submitted through Easychair at: https://easychair.org/conferences/?conf=lcc19<https://easychair.org/conferences/?conf=lcc1> We also welcome submissions of abstracts based on work submitted or published elsewhere, provided that all pertinent information is disclosed at submission time. There will be no formal reviewing as is usually understood in peer-reviewed conferences with published proceedings. The program committee checks relevance and may provide additional feedback. PROGRAM COMMITTEE: Lauri Hella, Co-chair, Tampere University, Finland Monika Seisenberger, Co-chair, Swansea University, UK Sam Buss, University of California, San Diego, US Anupam Das, University of Copenhagen, Denmark Anuj Dawar, University of Cambridge, UK Akitoshi Kawamura, Kyushu University, Fukuoka, Japan Arne Meier, University of Hannover, Germany Lidia Tendera, University of Opole, Poland REGISTRATION: via ICALP 2019 registration

1 0

Conference Kurt Goedel's Legacy: Does Future lie in the Past?, July 25-27, 2019, VIENNA
by Mihaela Rozman 18 Apr '19

18 Apr '19

The Kurt Goedel Society would like to cordially invite you to celebration of the 70th anniversary of Goedel's seminal publication and the 100th anniversary of the decisive experimental verification of general relativity, taking place at the University of Vienna, July 25-27, 2019: KURT GOEDEL`s LEGACY: DOES FUTURE LIE IN THE PAST? This event will bring together the most prominent researchers from the fields of Physics, Mathematics, Philosophy and Artificial Intelligence. The conference will be complemented by a special exhibition about life and work of Kurt Goedel with emphasis on the Goedel's solution. Program will consist of the invited talks, contributed talks and posters. Confirmed invited speakers include: Markus Aspelmeyer, John D.Barrow, Charles L. Bennett, David Bennett, George F.R. Ellis, Juliet Floyd, Georg Gottlob, Jan von Plato, Wolfgang Schleich, Marika Taylor, Toby Walsh, Nobel laureate Rainer Weiss and Palle Yourgrau. Dana Scott is the Honorary Chair of the Conference. IMPORTANT DATES April 23, 2019: Submission deadline for contributed posters and talks May 10, 2019: Early registration deadline PROGRAM COMMITTEE -Peter C. Aichelburg, University of Vienna -Matthias Baaz, Vienna University of Technology (Chair) -Piotr T. Chruściel, University of Vienna -Daniel Grumiller, Vienna University of Technology -Gary Mar, Stony Brook University -Vesna Sabljakovic-Fritz, Vienna University of Technology and IJCAI -Karl Sigmund, University of Vienna -Friedrich K. Stadler, University of Vienna ORGANIZERS AND SPONSORS Organized by the Kurt Goedel Society, with a kind support of the Institute of Discrete Mathematics and Geometry at TU Wien, ÖAW, TURIS, the Vienna Center for Logic and Algorithms (VCLA at TU WIEN), Universität Wien, Vienna Circle, and the Vienna Circle Society. WEBSITE https://kgs.logic.at/goedels-legacy/ FACEBOOK https://www.facebook.com/events/301928290466410/ TWITTER #Time4Goedel

1 0

PhD position on Formal Methods for Multi-agent Systems at TU Wien (Vienna University of Technology)
by Mihaela Rozman 16 Apr '19

16 Apr '19

There is an opening for a fully funded research assistant position (PhD student) at the Formal Methods in Systems Engineering group at TU Wien, Vienna, Austria. The successful candidate will be supervised by Prof. Florian Zuleger, and co-supervised by Benjamin Aminof, PhD. The proposed research will apply formal methods (logics and automatic methods enabling temporal and strategic reasoning) for the verification and synthesis of multi-agent systems and their interaction with realistic environments. The work has strong connections to artificial intelligence, distributed computing, and mobile agents/robots. The position is available immediately, a starting date until Fall 2019 is intended. The position is for 3 years. APPLICATION The application should include the candidate's CV, an abstract of their diploma/masters thesis, a short motivation letter, and two letters of recommendation (all five items in a single pdf file; letters of recommendation can also be sent directly). The application should also mention possible starting dates and should be sent to zuleger(a)forsyte.at. Informal inquiries with Prof Zuleger are welcome. A first screening of applications will start on May 6, 2019.

1 0

SIGLOG/VCLA TRAVEL AWARDS FOR WOMEN IN LOGIC WORKSHOP 2019 (WiL 2019)
by Mihaela Rozman 15 Apr '19

15 Apr '19

It is our pleasure to announce the call for the SIGLOG/VCLA Travel Awards for attendees of Women in Logic Workshop 2019 (WiL) associated with the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) 2019. ELIGIBILITY Thanks to the generous support of the SIGLOG and Vienna Center for Logic and Algorithms (VCLA), applications for awards are invited to facilitate students and postdocs, who are the authors of accepted talks and papers to register and travel to the WiL 2019 (June 23, 2019). SIGLOG/VCLA AWARDS · The awardees of the SIGLOG/VCLA Travel Award will be reimbursed for a portion of their travel expenses, and registration costs. · There will be at most one award per paper. APPLICATION PROCESS To submit a nomination for the SIGLOG/VCLA Travel Awards please include: 1. Basic information about the applicant 2. Information about her/his accepted WiL 2019 contribution 3. A statement about how attendance at WiL 2019 will impact the applicant 4. Resume/CV of the applicant 5. A nomination consists of a recommendation letter of up to 300 words by the applicant´s supervisor Please submit using the subject WiL 2019 Travel Awards to the WiL Program Co-chairs, Valeria de Paiva at <mailto:valeria.depaiva@gmail.com> valeria.depaiva(a)gmail.com and Amy Felty <mailto:atafelty@uottawa.ca> atafelty(a)uottawa.ca SIGLOG/VCLA TRAVEL AWARDS IMPORTANT DATES · Nominations must arrive no later than May 15, 2019 · The winners will be notified by May 25, 2019 WIL 2019 CALL FOR TALKS AND PAPERS Contributions should be written in English and can be submitted in the form of full papers (with a maximum of 10 pages), short papers (with a maximum of 5 pages), or talk abstracts (1 page). · Talk/Paper submission deadline: April 21, 2019 · Author Notification: May 7, 2019 More: https://sites.google.com/site/womeninlogic2019/call-for-papers

1 0

FroCoS 2019 (London): second call for papers
by Andrei Popescu 12 Apr '19

12 Apr '19

FroCoS 2019 The 12th International Symposium on Frontiers of Combining Systems London, UK, September 4-6, 2019 Website: https://www.frocos2019.org Contact: chair(a)frocos2019.org Submission deadlines: 21 Apr 2019 (abstract), 24 Apr 2019 (paper) GENERAL INFORMATION The 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019) will take place in London. It will be hosted by the Department of Computer Science at the Middlesex University London, from 4 to 6 September 2019. FroCoS is the main international event for research on the development of techniques and methods for the combination and integration of formal systems, their modularization and analysis. The first FroCoS symposium was held in Munich, Germany, in 1996. Initially held every two years, since 2004 it has been organized annually with alternate years forming part of IJCAR. If we also count the IJCAR editions, this year FroCoS celebrates its 20th edition. FroCoS 2019 will be co-located with the 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2019). The two conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE In various areas of computer science, such as logic, computation, program development and verification, artificial intelligence, knowledge representation, and automated reasoning, there is an obvious need for using specialized formalisms and inference systems for selected tasks. To be usable in practice, these specialized systems must be combined with each other and integrated into general purpose systems. This has led to the development of techniques and methods for the combination and integration of dedicated formal systems, as well as for their modularization and analysis. FroCoS traditionally focuses on these types of research questions and activities. Like its predecessors, FroCoS 2019 seeks to offer a common forum for research in the general area of combination, modularization, and integration of systems, with emphasis on logic-based methods and their practical use. Topics of interest for FroCoS 2019 include (but are not restricted to): * combinations of logics (such as higher-order, first-order, temporal, modal, description or other non-classical logics) * combination and integration methods in SAT and SMT solving * combination of decision procedures, satisfiability procedures, constraint solving techniques, or logical frameworks * combination of logics with probability and/or fuzzy measures * combinations and modularity in ontologies * integration of equational and other theories into deductive systems * hybrid methods for deduction, resolution and constraint propagation * hybrid systems in knowledge representation and natural language semantics * combined logics for distributed and multi-agent systems * logical aspects of combining and modularizing programs and specifications * integration of data structures into constraint logic programming and deduction * combinations and modularity in term rewriting * methods and techniques for the verification and analysis of information systems * methods and techniques for combining logical reasoning with machine learning SUBMISSION GUIDELINES The program committee seeks high-quality submissions describing original work, written in English, not overlapping with published or simultaneously submitted work to a journal or conference with archival proceedings. Selection criteria include accuracy and originality of ideas, clarity and significance of results, and quality of presentation. The page limit in Springer LNCS style is 16 pages in total, including references and figures. Any additional material (going beyond the page limit) can be included in a clearly marked appendix. This appendix will be read at the discretion of the committee, and must be removed for the camera-ready version. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via EasyChair at https://easychair.org/conferences/?conf=frocos2019 For each accepted paper, at least one of the authors is required to attend the conference and present the work. Prospective authors must register a title and an abstract three days before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui… IMPORTANT DATES Abstract submission: 21 Apr 2019 Paper submission: 24 Apr 2019 Notification of paper decisions: 6 Jun 2019 Camera-ready papers due: 1 Jul 2019 FroCoS conference: 4-6 Sep 2019 PUBLICATION DETAILS The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARD The program committee will select the FroCoS 2019 Best Paper, which will be awarded 500 Euros. The award will be presented at the conference. TRAVEL GRANTS FOR STUDENTS Some funding will be available to support students traveling to FroCoS 2019. More details will be given on the conference website in due time. PROGRAM COMMITTEE Carlos Areces, FaMAF - Universidad Nacional de Córdoba, Argentina Alessandro Artale, Free University of Bolzano-Bozen, Italy Franz Baader, TU Dresden, Germany Christoph Benzmüller, Free University of Berlin, Germany Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, Netherlands Torben Braüner, Roskilde University, Denmark Clare Dixon, University of Liverpool, UK Marcelo Finger, University of São Paulo, Brazil Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Silvio Ghilardi, Università degli Studi di Milano, Italy Jürgen Giesl, RWTH Aachen, Germany Andreas Herzig, CNRS, IRIT, France Moa Johansson, Chalmers University, Sweden Jean Christoph Jung, University of Bremen, Germany Cezary Kaliszyk, University of Innsbruck, Austria Ekaterina Komendantskaya, Heriot-Watt University, UK Roman Kontchakov, Birkbeck, University of London, UK Alessio Lomuscio, Imperial College London, UK Assia Mahboubi, INRIA, France Stefan Mitsch, Carnegie Mellon University Cláudia Nalon, University of Brasília, Brazil Andrei Popescu, Middlesex University London, UK Silvio Ranise, Fondazione Bruno Kessler-Irst, Italy Christophe Ringeissen, LORIA-INRIA, France Philipp Rümmer, Uppsala University, Sweden Renate Schmidt, University of Manchester, UK Viorica Sofronie-Stokkermans, University Koblenz-Landau, Germany Christian Sternagel, University of Innsbruck, Austria Andrzej Szalas, Linköping University, Sweden Cesare Tinelli, University of Iowa, US Ashish Tiwari, SRI International, US Christoph Weidenbach, Max Planck Institute for Informatics, Germany PC CHAIRS Andreas Herzig, CNRS, IRIT, France Andrei Popescu, Middlesex University London, UK LOCAL ORGANIZATION COMMITTEE Kelly Androutsopoulos, Middlesex University London, UK Jaap Boender, Middlesex University London, UK Michele Bottone, Middlesex University London, UK Florian Kammueller, Middlesex University London, UK Rajagopal Nagarajan, Middlesex University London, UK Andrei Popescu, Middlesex University London, UK Franco Raimondi, Middlesex University London, UK LOCAL ORGANIZATION CHAIR Franco Raimondi, Middlesex University London, UK

1 0

TABLEAUX 2019 (London): second call for papers
by Andrei Popescu 12 Apr '19

12 Apr '19

TABLEAUX 2019 The 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods London, UK, September 3-5, 2019 Authors, please note a change compared to the first call: The references are not counted in the page limits. Website: https://www.tableaux2019.org Contact: chair(a)tableaux2019.org Submission deadlines: 21 Apr 2019 (abstract), 24 Apr 2019 (paper) GENERAL INFORMATION The 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2019) will take place in London. It will be hosted by the Department of Computer Science at the Middlesex University London, on 3-5 September 2019. TABLEAUX is the main international conference at which research on all aspects -- theoretical foundations, implementation techniques, systems development and applications -- of the mechanization of tableaux-based reasoning and related methods is presented. The first TABLEAUX conference was held in Lautenbach near Karlsruhe, Germany, in 1992. Since then it has been organized on an annual basis; in 2001, 2004, 2006, 2008, 2010, 2012, 2014, 2016 and 2018 as a constituent of IJCAR. TABLEAUX 2019 will be co-located with the 12th International Symposium on Frontiers of Combining Systems (FroCoS 2019). The conferences will provide a rich programme of workshops, tutorials, invited talks, paper presentations and system descriptions. SCOPE OF CONFERENCE Tableau methods offer a convenient and flexible set of tools for automated reasoning in classical logic, extensions of classical logic, and a large number of non-classical logics. For many logics, tableau methods can be generated automatically. Areas of application include verification of software and computer systems, deductive databases, knowledge representation and its required inference engines, teaching, and system diagnosis. Topics of interest include but are not limited to: * tableau methods for classical and non-classical logics (including first-order, higher-order, modal, temporal, description, hybrid, intuitionistic, substructural, fuzzy, relevance and non-monotonic logics) and their proof-theoretic foundations; * sequent calculi and natural deduction calculi for classical and non-classical logics, as tools for proof search and proof representation; * related methods (SMT, model elimination, model checking, connection methods, resolution, BDDs, translation approaches); * flexible, easily extendable, light-weight methods for theorem proving; novel types of calculi for theorem proving and verification in classical and non-classical logics; * systems, tools, implementations, empirical evaluations and applications (provers, proof assistants, logical frameworks, model checkers, etc.); * implementation techniques (data structures, efficient algorithms, performance measurement, extensibility, etc.); * extensions of tableau procedures with conflict-driven learning; * techniques for proof generation and compact (or humanly readable) proof representation; * theoretical and practical aspects of decision procedures; * applications of automated deduction to mathematics, software development, verification, deductive and temporal databases, knowledge representation, ontologies, fault diagnosis or teaching. We also welcome papers describing applications of tableau procedures to real-world examples. Such papers should be tailored to the tableau community and should focus on the role of reasoning and on logical aspects of the solution. SUBMISSION GUIDELINES Submissions are invited in three categories: (A) research papers reporting original theoretical research or applications, with length up to 15 pages excluding references; (B) system descriptions, with length up to 9 pages excluding references; (C) position papers and brief reports on work in progress, with length up to 9 pages excluding references. Submissions will be reviewed by the PC, possibly with the help of external reviewers, taking into account readability, relevance and originality. Any additional material (going beyond the page limit) can be included in a clearly marked appendix, which will be read at the discretion of the committee and must be removed for the camera-ready version. For category A submissions, the reported results must be original and not submitted for publication elsewhere. For category B submissions, a working implementation must be accessible via the internet. Authors are encouraged to publish the implementation under an open source license. The aim of a system description is to make the system available in such a way that people can use it, understand it, and build on it. Accepted papers in categories A and B will be published in the conference proceedings. Accepted papers in category C will be published as a Technical Report of the Middlesex University London. Papers must be edited in LaTeX using the llncs style and must be submitted electronically as PDF files via the EasyChair system: http://easychair.org/conferences/?conf=tableaux2019 For all accepted papers at least one author is required to attend the conference and present the paper. A title and a short abstract of about 100 words must be submitted before the paper submission deadline. Formatting instructions and the LNCS style files can be obtained at http://www.springer.com/br/computer-science/lncs/conference-proceedings-gui… IMPORTANT DATES Abstract submission: 21 Apr 2019 Paper submission: 24 Apr 2019 Notification of paper decisions: 6 Jun 2019 Camera-ready papers due: 1 Jul 2019 TABLEAUX conference: 3-5 Sep 2019 PUBLICATION DETAILS The conference proceedings will be published in the Springer series Lecture Notes in Artificial Intelligence (LNAI/LNCS). BEST PAPER AWARDS The program committee will select (1) the TABLEAUX 2019 Best Paper and (2) the TABLEAUX 2019 Best Paper by a Junior Researcher, of which the latter will be supported by 500 Euros. Researchers will be considered "junior" if either they are students or their PhD degree date is less than two years from the first day of the meeting. The two awards will be presented at the conference. TRAVEL GRANTS FOR STUDENTS Some funding will be available to support students traveling to TABLEAUX 2019. More details will be given on the conference website in due time. PROGRAM COMMITTEE Peter Baumgartner, Data61/CSIRO, Australia Maria Paola Bonacina, Università degli Studi di Verona, Italy James Brotherston, University College London, UK Serenella Cerrito, IBISC, Univ. Evry, Paris Saclay University, France Agata Ciabattoni, Technische Universität Wien, Austria Anupam Das, University of Copenhagen, Denmark Clare Dixon, University of Liverpool, UK Camillo Fiorentini, University of Milano, Italy Pascal Fontaine, LORIA, INRIA, University of Lorraine, France Didier Galmiche, LORIA, University of Lorraine, France Martin Giese, Universitetet i Oslo, Norway Laura Giordano, DISIT, Università del Piemonte Orientale, Italy Rajeev Goré, The Australian National University, Australia Stéphane Graham-Lengrand, SRI International, USA Reiner Hähnle, TU Darmstadt, Germany Ori Lahav, Tel Aviv University, Israel Tomer Libal, American University of Paris, France George Metcalfe, Universität Bern, Switzerland Dale Miller, INRIA and LIX/Ecole Polytechnique, France Leonardo de Moura, Microsoft Research, USA Neil Murray, SUNY at Albany, USA Cláudia Nalon, University of Brasília, Brazil Sara Negri, University of Helsinki, Finland Hans de Nivelle, Nazarbayev University, Kazakhstan Nicola Olivetti, LSIS, Aix-Marseille Université, France Jens Otten, Universitetet i Oslo, Norway Valeria De Paiva, Nuance Communications, USA Nicolas Peltier, CNRS, Laboratoire d'Informatique de Grenoble, France Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brazil Francesca Poggiolesi, CNRS, IHST Paris, France Andrei Popescu, Middlesex University London, UK Gian Luca Pozzato, University of Turin, Italy Giles Reger, University of Manchester, UK Giselle Reis, Carnegie Mellon University, Qatar Renate Schmidt, University of Manchester, UK Viorica Sofronie-Stokkermans, Universität Koblenz-Landau, Germany Alwen Tiu, Australian National University, Australia Sophie Tourret, Max-Planck-Institut für Informatik, Saarbrücken, Germany Dmitriy Traytel, ETH Zürich, Switzerland Josef Urban, Czech Institute of Informatics, Robotics and Cybernetics, Czech Republic Luca Viganò, King's College, London, UK Uwe Waldmann, Max-Planck-Institut für Informatik, Saarbrücken, Germany Bruno Woltzenlogel Paleo, Vienna University of Technology, Austria PC CHAIRS Serenella Cerrito, IBISC, Univ. Evry, Paris Saclay University, France Andrei Popescu, Middlesex University London, UK LOCAL ORGANIZATION COMMITTEE Kelly Androutsopoulos, Middlesex University London, UK Jaap Boender, Middlesex University London, UK Michele Bottone, Middlesex University London, UK Florian Kammueller, Middlesex University London, UK Rajagopal Nagarajan, Middlesex University London, UK Andrei Popescu, Middlesex University London, UK Franco Raimondi, Middlesex University London, UK CONFERENCE CHAIR Andrei Popescu, Middlesex University London, UK

1 0

FSCD 2019 - Call for Participation (early registration ends May 13th)
by Sandra Alves 11 Apr '19

11 Apr '19

(Apologies for multiple copies of this announcement. Please circulate.) ================================================================== CALL FOR PARTICIPATION Fourth International Conference on Formal Structures for Computation and Deduction (FSCD 2019) 24 -- 30 June 2019, Dortmund, Germany http://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> FSCD covers all aspects of formal structures for computation and deduction from theoretical foundations to applications. Building on two communities, RTA (Rewriting Techniques and Applications) and TLCA (Typed Lambda Calculi and Applications), FSCD embraces their core topics and broadens their scope to closely related areas in logics, models of computation (e.g. quantum computing, probabilistic computing, homotopy type theory), semantics and verification in new challenging areas (e.g. blockchain protocols or deep learning algorithms). REGISTRATION The registration page is already open and linked from: http://easyconferences.eu/fscd2019/registration-2/ <http://easyconferences.eu/fscd2019/registration-2/> The early registration deadline is *** 13 May 2019 ***. (for more details please visit the conference webpage). INVITED SPEAKERS Titles and abstracts available at http://easyconferences.eu/fscd2019/invited-speakers/ <http://easyconferences.eu/fscd2019/invited-speakers/> * Beniamino Accattoli (INRIA, Paris, France) https://sites.google.com/site/beniaminoaccattoli/ <https://sites.google.com/site/beniaminoaccattoli/> * Amy Felty (University of Ottawa, Canada) http://www.site.uottawa.ca/~afelty/ <http://www.site.uottawa.ca/~afelty/> * Sarah Winkler (University of Innsbruck, Austria) http://cl-informatik.uibk.ac.at/users/swinkler/ <http://cl-informatik.uibk.ac.at/users/swinkler/> * Hongseok Yang (KAIST, Korea) https://sites.google.com/view/hongseokyang/ <https://sites.google.com/view/hongseokyang/> SATELLITE EVENTS - UNIF: 33rd International Workshop on Unification (http://www.mat.unb.br/unif2019 <http://www.mat.unb.br/unif2019>) - WPTE: 6th International Workshop on Rewriting Techniques for Program Transformations and Evaluation (http://nigam.info/conferences/wpte2019/main.html <http://nigam.info/conferences/wpte2019/main.html>) - IWC: 8th International Workshop on Confluence (http://iwc2019.cic.unb.br <http://iwc2019.cic.unb.br/>) - TLLA: 3rd Trends in Linear Logic and Applications (http://tlla.linear-logic.org/2019 <http://tlla.linear-logic.org/2019>) - SD: 5th International Workshop on Structures and Deduction (http://www.anupamdas.com/sd19 <http://www.anupamdas.com/sd19>) - HOR: 10th International Workshop on Higher-Order Rewriting (http://imft.ftn.uns.ac.rs/HOR2019 <http://imft.ftn.uns.ac.rs/HOR2019>) - IFIP: 22nd IFIP Working Group 1.6: Rewriting (http://cbr.uibk.ac.at/ifip-wg1.6/events/event-2019.html <http://cbr.uibk.ac.at/ifip-wg1.6/events/event-2019.html>) PROGRAM CHAIR Herman Geuvers, Radboud U. Nijmegen CONFERENCE CHAIR Jakob Rehof, TU Dortmund LOCAL WORKSHOP CHAIR Boris Düdder, U. of Copenhagen PROGRAM COMMITTEE H. Geuvers, Radboud U. Nijmegen Z. Ariola, U. of Oregon M. Ayala Rincón, U. of Brasilia A. Bauer, U. of Ljubljana F. Bonchi, U. of Pisa S. Broda, U. of Porto U. Dal Lago, U. of Bologna & Inria U. De'Liguoro, U. of Torino D. Kapur, U. of New Mexico P. Dybjer, Chalmers U. of Technology M. Fernandez, King's College London J. Giesl, RWTH Aachen N. Hirokawa, JAIST S. Lucas, U. Politecnica de Valencia A. Middeldorp, U. of Innsbruck F. Pfenning, Carnegie Mellon U. B. Pientka, McGill U. J. van de Pol, Aarhus U. & U. of Twente F. van Raamsdonk, VU Amsterdam C. Schürmann, ITU Copenhagen P. Severi, U. of Leicester A. Silva, U. College London S. Staton, Oxford U. T. Streicher, TU Darmstadt A. Stump, U. of Iowa N. Tabareau, Inria S. Tison, U. of Lille A. Tiu, Australian National U. T. Tsukada, U. of Tokyo J. Urban, CTU Prague P. Urzyczyn, U. of Warsaw J. Waldmann, Leipzig U. of Applied Sciences STEERING COMMITTEE WORKSHOP CHAIR Jamie Vicary, Oxford U. PUBLICITY CHAIR Sandra Alves , Porto U. FSCD STEERING COMMITTEE S. Alves (Porto U.), M. Ayala-Rincón (Brasilia U.) C. Fuhs (Birkbeck, London U.) D. Kesner (Chair, Paris U.) H. Kirchner (Inria) N. Kobayashi (U. Tokyo) C. Kop (Radboud U. Nijmegen) D. Miller (Inria) L. Ong (Chair, Oxford U.) B. Pientka (McGill U.) S. Staton (Oxford U.) Looking forward to seeing you in Dortmund! ==================================================================

1 0