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

Women in Science: Helmut Veith Stipend for Female Master´s Students in Computer Science, Deadline November 30, 2018 for the enrollment in 2018/2019
by Mihaela Rozman 23 Oct '18

23 Oct '18

[Apologies if you receive multiple copies of this email. Please distribute to interested parties.] Female students in the field of computer science (CS) who plan to pursue (or are currently pursuing) one of the masters programs in Computer Science at the Vienna University of Technology TU Wien taught in English are invited to apply for the annually awarded Helmut Veith Stipend. The annually awarded Helmut Veith Stipend for female master students is dedicated to the memory of an outstanding computer scientist who worked in the fields of logic in computer science, computer-aided verification, software engineering, and computer security. Professor Helmut Veith (1971-2016). The Helmut Veith Stipend has been established with generous support of TU Wien, Wolfgang Pauli Institute and with contributions by family and friends of the late Helmut Veith. BENEFITS -EUR 6000 per year, for up to two years -Waiver of tuition fees at TU Wien LOCATION OF MASTER STUDY For study in Austria, at Vienna University of Technology TU Wien FOR FIELD OF STUDY Applicants must be eligible for admission to one of the masters programs in computer science at Vienna University of technology - TU Wien that are taught in English. Link: http://www.informatik.tuwien.ac.at/teaching/master Master in <http://www.informatik.tuwien.ac.at/studium/angebot/master> Logic and Computation Master in <http://www.informatik.tuwien.ac.at/studium/angebot/master> Business Informatics European <http://www.informatik.tuwien.ac.at/studium/angebot/master> Master in Computational Logic Master in <http://www.informatik.tuwien.ac.at/studium/angebot/master> Computer Engineering (Technische Informatik) Master in <http://www.informatik.tuwien.ac.at/studium/angebot/master/DataScience> Data Science Master in <http://www.informatik.tuwien.ac.at/studium/angebot/master/medieninformatik> Media and Human-Centered Computing APPLICATION Applications for Helmut Veith Stipend can be filed after, before or in parallel with the admissions process (if the start of the master´s program is in the Summer of 2019). The applications must be submitted electronically to master(a)logic-cs.at as a single PDF document, by November 30, 2018. DEADLINE November 30, 2018. INQUIRES Electronically to master(a)logic-cs.at WEBSITE http://www.vcla.at/2018/05/call-for-applications-helmut-veith-stipend-for-fe male-masters-students-in-computer-science DOWNLOAD THE FLYER http://forsyte.at/helmut-veith-stipend/

1 0

LATA 2019: 3rd call for papers
by IRDTA 21 Oct '18

21 Oct '18

LATA 2019: 3rd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2019 Saint Petersburg, Russia March 25-29, 2019 Organized by: Saint Petersburg State University and Institute for Research Development, Training and Advice, Brussels/London http://lata2019.irdta.eu/ ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2019 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. VENUE: LATA 2019 will take place in Saint Petersburg, whose historic centre is a UNESCO World Heritage Site. The conference site shall be the historical Twelve Collegia building (https://en.wikipedia.org/wiki/Twelve_Collegia), built in ca. 1740, which was used for the Russian government in the 18th century, and which has been the main building of Saint Petersburg State University since 1835. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2019 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: Henning Fernau (University of Trier), Modern Aspects of Complexity within Formal Languages Paweł Gawrychowski (University of Wrocław), tba Edward A. Lee (University of California, Berkeley), Observation, Interaction, Determinism, and Free Will Vadim Lozin (University of Warwick), From Words to Graphs, and Back Esko Ukkonen (University of Helsinki), Pattern Discovery in Biological Sequences PROGRAMME COMMITTEE: Krishnendu Chatterjee (Institute of Science and Technology Austria, AT) Bruno Courcelle (University of Bordeaux, FR) Manfred Droste (University of Leipzig, DE) Travis Gagie (Diego Portales University, CL) Peter Habermehl (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Markus Holzer (University of Giessen, DE) Radu Iosif (Verimag, FR) Kazuo Iwama (Kyoto University, JP) Juhani Karhumäki (University of Turku, FI) Lila Kari (University of Waterloo, CA) Juha Kärkkäinen (University of Helsinki, FI) Bakhadyr Khoussainov (University of Auckland, NZ) Sergey Kitaev (University of Strathclyde, UK) Shmuel Tomi Klein (Bar-Ilan University, IL) Olga Kouchnarenko (University of Franche-Comté, FR) Thierry Lecroq (University of Rouen, FR) Markus Lohrey (University of Siegen, DE) Sebastian Maneth (University of Bremen, DE) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Filippo Mignosi (University of L'Aquila, IT) Victor Mitrana (Polytechnic University of Madrid, ES) Joachim Niehren (INRIA Lille, FR) Alexander Okhotin (Saint Petersburg State University, RU) Dominique Perrin (University of Paris-Est, FR) Matteo Pradella (Polytechnic University of Milan, IT) Jean-François Raskin (Université Libre de Bruxelles, BE) Marco Roveri (Bruno Kessler Foundation, IT) Karen Rudie (Queen's University, CA) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen's University, CA) Sven Schewe (University of Liverpool, UK) Helmut Seidl (Technical University of Munich, DE) Ayumi Shinohara (Tohoku University, JP) Hans Ulrich Simon (Ruhr-University of Bochum, DE) William F. Smyth (McMaster University, CA) Frank Stephan (National University of Singapore, SG) Martin Sulzmann (Karlsruhe University of Applied Sciences, DE) Jorma Tarhio (Aalto University, FI) Stefano Tonetta (Bruno Kessler Foundation, IT) Rob van Glabbeek (Data61, CSIRO, AU) Margus Veanes (Microsoft Research, US) Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US) Mikhail Volkov (Ural Federal University, RU) Fang Yu (National Chengchi University, TW) Hans Zantema (Eindhoven University of Technology, NL) ORGANIZING COMMITTEE: Alexander Okhotin (Saint Petersburg, co-chair) Manuel Parra-Royón (Granada) Dana Shapira (Ariel) David Silva (London, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2019 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: http://lata2019.irdta.eu/Registration.php DEADLINES (all at 23:59 CET): Paper submission: November 11, 2018 Notification of paper acceptance or rejection: December 16, 2018 Final version of the paper for the LNCS proceedings: December 23, 2018 Early registration: December 23, 2018 Late registration: March 11, 2019 Submission to the journal special issue: June 29, 2019 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Санкт-Петербургский государственный университет IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

CADE-27: Call for Papers, Workshops, Tutorials and System Competitions
by Carlos Areces 19 Oct '18

19 Oct '18

Excuses for multiple posting. ---- CADE-27: Call for Papers, Workshops, Tutorials and System Competitions ---- The 27th International Conference on Automated Deduction (CADE-27) Natal, Brazil 25-30 August 2019 http://www.cade-27.info CALL FOR PAPERS CADE is the major international forum for presenting research on all aspects of automated deduction. High-quality submissions on the general topic of automated deduction, including foundations, applications, implementations, theoretical results, practical experiences and user studies are solicited. Key dates: Abstract deadline: 15 February 2019 Submission deadline: 22 February 2019 * Logics of interest include propositional, first-order, equational, higher-order, classical, description, modal, temporal, many-valued, constructive, other non-classical, meta-logics, logical frameworks, type theory, set theory, as well as any combination thereof. * Paradigms of interest include theorem proving, model building, constraint solving, computer algebra, model checking, proof checking, and their integration. * Methods of interest include resolution, superposition, completion, saturation, term rewriting, decision procedures, model elimination, connection methods, tableaux, sequent calculi, natural deduction, as well as their supporting algorithms and data structures, including matching, unification, orderings, induction, indexing techniques, proof presentation and explanation, proof planning. * Applications of interest include program analysis, verification and synthesis of software and hardware, formal methods, computational logic, computer mathematics, natural language processing, computational linguistics, knowledge representation, ontology reasoning, deductive databases, declarative programming, robotics, planning, and other areas of artificial intelligence. Submissions can be made in two categories: regular papers and system descriptions. The page limit in Springer LNCS style is 15 pages excluding references for regular papers and 10 pages excluding references for system descriptions. Submissions must be unpublished and not submitted for publication elsewhere. They will be judged on relevance, originality, significance, correctness, and readability. System descriptions must contain a link to a working system and will also be judged on usefulness and design. Proofs of theoretical results that do not fit in the page limit, executables of systems, and input data of experiments should be made available, via a reference to a website or in an appendix of the paper. For papers containing experimental evaluations, all data needed to rerun the experiments must be available. Reviewers will be encouraged to consider this additional material, but submissions must be self-contained within the respective page limit; considering the additional material should not be necessary to assess the merits of a submission. The review process will include a feedback/rebuttal period where authors will have the option to respond to reviewer comments. The PC chair may solicit further reviews after the rebuttal period. The proceedings of the conference will be published in the Springer LNCS/LNAI series. Formatting instructions and the LNCS style files can be obtained at http://www.springer.de/comp/lncs/authors.html At every CADE conference the Program Committee selects one of the accepted papers to receive the CADE Best Paper Award. The award recognizes a paper that the Program Committee collegially evaluates as the best in terms of originality and significance, having substantial confidence in its correctness. Overall technical quality, completeness, scholarly accuracy, and readability are also considered. Characteristics associated with a best paper include, for instance, introduction of a strong new technique or approach, solution of a long-standing open problem, introduction and solution of an interesting and important new problem, highly innovative application of known ideas or existing techniques, and presentation of a new system of outstanding power. Under exceptional circumstances, the Program Committee may give two awards (ex aequo) or give no award. IMPORTANT DATES Abstract deadline: 15 February 2019 Submission deadline: 22 February 2019 Rebuttal phase: 2 April 2019 Notification: 15 April 2019 Final version: 27 May 2019 SUBMISSION INSTRUCTIONS Papers should be submitted via https://easychair.org/conferences/?conf=cade27 CADE-27 ORGANIZERS Conference Chair: Elaine Pimentel Federal University of Rio Grande do Norte, Brazil Organizers: Carlos Olarte Federal University of Rio Grande do Norte, Brazil Joao Marcos Federal University of Rio Grande do Norte, Brazil Claudia Nalon University of Brasilia, Brazil Giselle Reis CMU, Qatar Program Committee Chair: Pascal Fontaine Universite de Lorraine, CNRS, Inria, LORIA, France Workshop, Tutorial, and Competition Chair: Giles Reger University of Manchester, UK Publicity Chair: Geoff Sutcliffe University of Miami, USA Program Committee: Carlos Areces, FaMAF - Universidad Nacional de Cordoba, Argentina Franz Baader, TU Dresden, Germany Clark Barrett, Stanford University, USA Jasmin Christian Blanchette, Vrije Universiteit Amsterdam, The Netherlands Maria Paola Bonacina, Universita degli Studi di Verona, Italy Leonardo Mendonca de Moura, Microsoft Research, USA Hans de Nivelle, Nazarbayev University, Astana, Kazakhstan Clare Dixon, University of Liverpool, UK Mnacho Echenim, Universite de Grenoble, France Marcelo Finger, University of Sao Paulo, Brazil Pascal Fontaine, Universite de Lorraine, CNRS, Inria, LORIA, France Silvio Ghilardi, Universita degli Studi di Milano, Italy Juergen Giesl, RWTH Aachen University, Germany Rajeev Gore, The Australian National University, Australia Stefan Hetzl, Technische Universitaet Wien, Austria Marijn J. H. Heule, The University of Texas at Austin, USA Nao Hirokawa, JAIST, Japan Moa Johansson, Chalmers University of Technology, Sweden Cezary Kaliszyk, University of Innsbruck, Austria Deepak Kapur, University of New Mexico, USA Benjamin Kiesl, Technische Universitaet Wien, Austria Konstantin Korovin, The University of Manchester, UK Laura Kovacs, Technische Universitaet Wien, Austria Ramana Kumar, DeepMind, UK Claudia Nalon, University of Brasilia, Brazil Vivek Nigam, Federal University of Paraiba & Fortiss, Brazil & Germany Carlos Olarte, Federal University of Rio Grande do Norte, Brazil Jens Otten, University of Oslo, Norway Andre Platzer, Carnegie Mellon University, USA Andrew Reynolds, The University of Iowa, USA Philipp Ruemmer, Uppsala University, Sweden Renate A. Schmidt, The University of Manchester, UK Stephan Schulz, DHBW Stuttgart, Germany Roberto Sebastiani, University of Trento, Italy Natarajan Shankar, SRI International, USA Viorica Sofronie-Stokkermans, Universitaet Koblenz-Landau, Germany Martin Suda, Czech Technical University, Czech Republic Geoff Sutcliffe, University of Miami, USA Rene Thiemann, University of Innsbruck, Austria Uwe Waldmann, Max Planck Institute for Informatics, Germany Christoph Weidenbach, Max Planck Institute for Informatics, Germany Sarah Winkler, University of Innsbruck, Austria CALL FOR WORKSHOPS, TUTORIALS, SYSTEM COMPETITIONS The 27th International Conference on Automated Deduction (CADE-27) Natal, Brazil 25-30 August 2019 http://www.cade-27.info CALL FOR WORKSHOPS Workshop proposals for CADE-27 are solicited. The workshops will take place on August 25-26 2019, before the main conference. Both well-established workshops and newer ones are encouraged. Similarly, proposals for workshops with a tight focus on a core automated reasoning specialization, as well as those with a broader, more applied focus, are very welcome. Please provide the following information in your application document: + Workshop title. + Names and affiliations of organizers. + Proposed workshop duration (from half a day to two days) and preferred day(s). + Brief description of the goals and the scope of the workshop. Why is the workshop relevant for CADE? + Is the workshop new or has it met previously? In the latter case information on previous meetings should be given (e.g., links to the program, number of submissions, number of participants). + What are the plans for publication? CALL FOR TUTORIALS Tutorial proposals for CADE-27 are solicited. Tutorials are expected to be either half-day or full-day events, with a theoretical or applied focus, on a topic of interest for CADE-27. Proposals should provide the following information: + Tutorial title. + Names and affiliations of organizers. + Proposed tutorial duration (from half a day to one day) and the preferred day. + Brief description of the tutorial's goals and topics to be covered. + Whether or not a version of the tutorial has been given previously. CADE will take care of printing and distributing notes for tutorials that would like this service. CALL FOR SYSTEM COMPETITIONS The CADE ATP System Competition (CASC), which evaluates automated theorem proving systems for classical logics, has become an integral part of the CADE conferences. Further system competition proposals are solicited. The goal is to foster the development of automated reasoning systems in all areas relevant for automated deduction in a broader sense. Proposals should include the following information: + Competition title. + Names and affiliations of organizers. + Duration and schedule of the competition. + Room/space requirements. + Description of the competition task and the evaluation procedure. + Is the competition new or has it been organized before? In the latter case information on previous competitions should be given. + What computing resources are required and how will they be provided? IMPORTANT DATES Workshop/Tutorials/System Competitions: Submission deadline: 15 November 2018 Notification: 15 December 2018 SUBMISSION INSTRUCTIONS Proposals for workshops, tutorials, and system competitions should be uploaded via https://easychair.org/conferences/?conf=cade27wtc

1 0

FSCD 2019 - First Call for Papers
by Sandra Alves 19 Oct '18

19 Oct '18

(Apologies for multiple copies of this announcement. Please circulate.) CALL FOR PAPERS Fourth International Conference on Formal Structures for Computation and Deduction (FSCD 2019) 24 -- 30 June 2019, Dortmund, Germany http://fscd-conference.org/ IMPORTANT DATES --------------- All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered. Titles and Short Abstracts: 8 February 2019 Full Papers: 11 February 2019 Rebuttal period: 28 March -- 1 April 2019 Authors Notification: 8 April 2019 Final version for proceedings: 22 April 2019 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). Suggested, but not exclusive, list of topics for submission are: 1. Calculi: Rewriting systems, Lambda calculus, Concurrent calculi, Logics, Type theory, Homotopy type theory, Logical frameworks, Quantum calculi 2. Methods in Computation and Deduction: Type systems; Induction and coinduction; Matching, unification, completion and orderings; Strategies; Tree automata; Model checking; Proof search and theorem proving; Constraint solving and decision procedures 3. Semantics: Operational semantics; Abstract machines; Game Semantics; Domain theory; Categorical models; Quantitative models 4. Algorithmic Analysis and Transformations of Formal Systems: Type inference and type checking; Abstract interpretation; Complexity analysis and implicit computational complexity; Checking termination, confluence, derivational complexity and related properties; Symbolic computation 5. Tools and Applications: Programming and proof environments; Verification tools; Proof assistants and interactive theorem provers; Applications in industry (e.g. design and verification of critical systems); Applications in other sciences (e.g. biology) 6. Semantics and verification in new challenging areas: Certification; Security; Blockchain protocols; Data bases; Deep learning and machine learning algorithms; Planning PUBLICATION ----------- The proceedings will be published as an electronic volume in the Leibniz International Proceedings in Informatics (LIPIcs) of Schloss Dagstuhl. All LIPIcs proceedings are open access. SUBMISSION GUIDELINES --------------------- Submissions can be made in two categories. Regular research papers are limited to 15 pages (including references, with the possibility to add an annex for technical details, e.g.\ proofs) and must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages (including references) and must present new software tools in which FSCD topics play an important role, or significantly new versions of such tools. Submissions must be formatted using the LIPIcs style files and submitted via EasyChair. Complete instructions on submitting a paper can be found on the conference web site: http://fscdconference.org/editions/fscd-2019/ BEST PAPER AWARD BY JUNIOR RESEARCHERS -------------------------------------- The program committee will consider declaring this award to a paper in which at least one author is a junior researcher, i.e. either a student or whose PhD award date is less than three years from the first day of the meeting. Other authors should declare to the PC Chair that at least 50% of contribution is made by the junior researcher(s). SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version for a special issue of Logical Methods in Computer Science. PROGRAM COMMITTEE ----------------- H. Geuvers, Radboud U. Nijmegen (Chair) 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, 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 CONFERENCE CHAIR ---------------- Jakob Rehof, TU Dortmund LOCAL WORKSHOP CHAIR -------------------- Boris Düdder, U. of Copenhagen STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- J. 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.)

1 0

LICS 2019 Call for Workshop Proposals
by Sam Staton 11 Oct '18

11 Oct '18

34TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS 2019) Call for Workshop Proposals https://lics.siglog.org/lics19/ * The Thirty-Fourth Annual ACM/IEEE Symposium on Logic In Computer Science (LICS'19) will be held in Vancouver, Canada on June 24-27, 2019. The workshops will take place on June 22-23, 2019. * Researchers and practitioners are invited to submit proposals for workshops on topics relating logic - broadly construed - to computer science or related fields. Typically, LICS workshops feature a number of invited speakers and a number of contributed presentations. LICS workshops do not usually produce formal proceedings. However, in the past there have been special issues of journals based in part on certain LICS workshops. * Proposals should include: - A short scientific summary and justification of the proposed topic. This should include a discussion of the particular benefits of the topic to the LICS community. - A discussion of the proposed format and agenda. - The proposed duration, which is typically one day (two-day workshops can be accommodated too). - Procedures for selecting participants and papers. - Expected number of participants. This is important for the room! - Potential invited speakers. - Plans for dissemination (for example, special issues of journals). Proposals should be sent to Frédéric Blanqui: frederic.blanqui(a)inria.fr * IMPORTANT DATES - Workshop Proposal Submission deadline: November 15, 2018 - Notification: December 1, 2018 - Program of the workshops ready: May 19, 2019 - Workshops: June 22-23, 2019 - LICS conference: June 24-27, 2019 * The workshops selection committee consists of the LICS General Chair, LICS Workshops Chair, LICS 2019 PC Chair and LICS 2019 Conference Chairs.

1 0

LATA 2019: 2nd call for papers
by IRDTA 07 Oct '18

07 Oct '18

LATA 2019: 2nd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2019 Saint Petersburg, Russia March 25-29, 2019 Organized by: Saint Petersburg State University and Institute for Research Development, Training and Advice, Brussels/London http://lata2019.irdta.eu/ ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2019 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas. VENUE: LATA 2019 will take place in Saint Petersburg, whose historic centre is a UNESCO World Heritage Site. The conference site shall be the historical Twelve Collegia building (https://en.wikipedia.org/wiki/Twelve_Collegia), built in ca. 1740, which was used for the Russian government in the 18th century, and which has been the main building of Saint Petersburg State University since 1835. SCOPE: Topics of either theoretical or applied interest include, but are not limited to: algebraic language theory algorithms for semi-structured data mining algorithms on automata and words automata and logic automata for system analysis and programme verification automata networks automatic structures codes combinatorics on words computational complexity concurrency and Petri nets data and image compression descriptional complexity foundations of finite state technology foundations of XML grammars (Chomsky hierarchy, contextual, unification, categorial, etc.) grammatical inference and algorithmic learning graphs and graph transformation language varieties and semigroups language-based cryptography mathematical and logical foundations of programming methodologies parallel and regulated rewriting parsing patterns power series string processing algorithms symbolic dynamics term rewriting transducers trees, tree languages and tree automata weighted automata STRUCTURE: LATA 2019 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: (to be completed) Henning Fernau (University of Trier), Modern Aspects of Complexity within Formal Languages Edward A. Lee (University of California, Berkeley), Observation, Interaction, Determinism, and Free Will Vadim Lozin (University of Warwick), From Words to Graphs, and Back Esko Ukkonen (University of Helsinki), Pattern Discovery in Biological Sequences PROGRAMME COMMITTEE: Krishnendu Chatterjee (Institute of Science and Technology Austria, AT) Bruno Courcelle (University of Bordeaux, FR) Manfred Droste (University of Leipzig, DE) Travis Gagie (Diego Portales University, CL) Peter Habermehl (Paris Diderot University, FR) Tero Harju (University of Turku, FI) Markus Holzer (University of Giessen, DE) Radu Iosif (Verimag, FR) Kazuo Iwama (Kyoto University, JP) Juhani Karhumäki (University of Turku, FI) Lila Kari (University of Waterloo, CA) Juha Kärkkäinen (University of Helsinki, FI) Bakhadyr Khoussainov (University of Auckland, NZ) Sergey Kitaev (University of Strathclyde, UK) Shmuel Tomi Klein (Bar-Ilan University, IL) Olga Kouchnarenko (University of Franche-Comté, FR) Thierry Lecroq (University of Rouen, FR) Markus Lohrey (University of Siegen, DE) Sebastian Maneth (University of Bremen, DE) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Filippo Mignosi (University of L'Aquila, IT) Victor Mitrana (Polytechnic University of Madrid, ES) Joachim Niehren (INRIA Lille, FR) Alexander Okhotin (Saint Petersburg State University, RU) Dominique Perrin (University of Paris-Est, FR) Matteo Pradella (Polytechnic University of Milan, IT) Jean-François Raskin (Université Libre de Bruxelles, BE) Marco Roveri (Bruno Kessler Foundation, IT) Karen Rudie (Queen's University, CA) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen's University, CA) Sven Schewe (University of Liverpool, UK) Helmut Seidl (Technical University of Munich, DE) Ayumi Shinohara (Tohoku University, JP) Hans Ulrich Simon (Ruhr-University of Bochum, DE) William F. Smyth (McMaster University, CA) Frank Stephan (National University of Singapore, SG) Martin Sulzmann (Karlsruhe University of Applied Sciences, DE) Jorma Tarhio (Aalto University, FI) Stefano Tonetta (Bruno Kessler Foundation, IT) Rob van Glabbeek (Data61, CSIRO, AU) Margus Veanes (Microsoft Research, US) Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US) Mikhail Volkov (Ural Federal University, RU) Fang Yu (National Chengchi University, TW) Hans Zantema (Eindhoven University of Technology, NL) ORGANIZING COMMITTEE: Alexander Okhotin (Saint Petersburg, co-chair) Manuel Parra-Royón (Granada) Dana Shapira (Ariel) David Silva (London, co-chair) SUBMISSIONS: Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix. Submissions have to be uploaded to: https://easychair.org/conferences/?conf=lata2019 PUBLICATIONS: A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference. A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation. REGISTRATION: The registration form can be found at: http://lata2019.irdta.eu/Registration.php DEADLINES (all at 23:59 CET): Paper submission: November 11, 2018 Notification of paper acceptance or rejection: December 16, 2018 Final version of the paper for the LNCS proceedings: December 23, 2018 Early registration: December 23, 2018 Late registration: March 11, 2019 Submission to the journal special issue: June 29, 2019 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Санкт-Петербургский государственный университет IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

EPIT 2019 - Spring school on databases, logic and automata
by Cristina Sirangelo 02 Oct '18

02 Oct '18

===================================================================== EPIT 2019 - Spring school on databases, logic and automata CIRM - Centre International de Rencontres Mathématiques - Marseille Luminy - France April 8-12, 2019 https://conferences.cirm-math.fr/1934.html ===================================================================== EPIT (École de Printemps d'Informatique Théorique, https://epit.irif.fr/) is a French recurrent spring school in theoretical computer science, initiated by Maurice Nivat in 1973. It has since then spanned many exciting topics in foundational computer science, and has become a major event for the research community in France and beyond. The 2019 edition of the EPIT will cover the foundations of data management. It will in particular focus on the fruitful interaction between database theory and two other main areas of theoretical computer science : logic and automata - as well as other closely related fields, such as finite model theory, descriptive complexity, game theory, and inference. Programme --------- Monday * Morning: Introduction to database theory (Pierre Senellart, ENS Paris) * Afternoon : Optimal joins (Szymon Toruńczyk, Warsaw) Tuesday * Morning: Logic and automata for semi-structured data (Diego Figueira, Bordeaux) * Afternoon: - Logic-based distributed query processing (Frank Neven, Hasselt) - Incremental query evaluation (Thomas Schwentick, Dortmund) Wednesday * Morning: Graph data management (Wim Martens, Beyreuth) Thursday * Morning: Databases and descriptive complexity (Nicole Schweikardt, Humboldt) * Afternoon: - View-based query processing (Nadime Francis, Marne la Vallée) - Incomplete data management (Leonid Libkin, Edinburgh) Friday * Morning : Ontologies and rules (Meghyn Bienvenu, Montpellier) In addition, poster sessions will be organised, so that participants who are willing to, will be able to present their work. All courses will be given in English. Audience ------------ Lectures are intended to be accessible to a wide audience. No prior knowledge of database theory will be assumed, but some familiarity with basic automata theory and logic is recommended. The EPIT 2019 Spring School is primarily addressed to PhD students and young researchers, but more senior participants are also encouraged to join. Date and Venue -------------- The EPIT 2019 Spring School will take place from Monday, April 8th to Friday, April 12th, 2019 in France, at CIRM, the International Center for Mathematical Meetings (https://www.cirm-math.fr/) in Luminy, Marseille. Registration ----------- Pre-registration will soon open on the Webpage of the event https://conferences.cirm-math.fr/1934.html. Registration fees, including accommodation and meals at CIRM, will be as moderate as possible (details will be announced soon). sOrganisation ------------ The school is organised by : Amélie Gheerbrant <amelie(a)irif.fr> Leonid Libkin <libkin(a)inf.ed.ac.uk> Luc Segoufin <luc.segoufin(a)inria.fr> Pierre Senellart <pierre(a)senellart.com> Cristina Sirangelo <cristina(a)irif.fr> For any further information please contact the organisers.

1 0

LICS 2019 Call for Papers
by Sam Staton 19 Sep '18

19 Sep '18

CALL FOR PAPERS Thirty-Fourth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) 24-27 July 2019, Vancouver https://lics.siglog.org/lics19/ SCOPE The LICS Symposium is an annual international forum on theoretical and practical topics in computer science that relate to logic, broadly construed. We invite submissions on topics that fit under that rubric. Suggested, but not exclusive, topics of interest include: 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. IMPORTANT DATES Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE). Titles and Short Abstracts Due: 4 January 2019 Full Papers Due: 11 January 2019 Author Feedback/Rebuttal Period: 4-8 March 2019 Author Notification: 29 March 2019 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2019. SUBMISSION INSTRUCTIONS Every extended abstract must be submitted in the IEEE Proceedings 2-column 10pt format and may be at most 12 pages, excluding references. LaTeX style files are available on the conference website; please use IEEEtran.cls version V1.8b, released on 26/08/2015. The extended abstract must be in English and provide sufficient detail to allow the program committee to assess the merits of the paper. It should begin with a succinct statement of the issues, a summary of the main results, and a brief explanation of their significance and relevance to the conference and to computer science, all phrased for the non-specialist. Technical development directed to the specialist should follow. References and comparisons with related work must be included. (If necessary, detailed proofs of technical results may be included in a clearly-labeled appendix, to be consulted at the discretion of program committee members.) Submissions not conforming to the above requirements will be rejected without further consideration. Paper selection will be merit-based, with no a priori limit on the number of accepted papers. Papers authored or co-authored by members of the program committee are not allowed. Results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia or workshops. The program chair must be informed, in advance of submission, of any closely related work submitted or about to be submitted to a conference or journal. Authors of accepted papers are expected to sign copyright release forms. One author of each accepted paper is expected to present it at the conference. KLEENE AWARD FOR BEST STUDENT PAPER An award in honour of the late Stephen C. Kleene will be given for the best student paper(s), as judged by the program committee. SPECIAL ISSUES Full versions of up to three accepted papers, to be selected by the program committee, will be invited for submission to the Journal of the ACM. Additional selected papers will be invited to a special issue of Logical Methods in Computer Science.

1 1

PhD student position in TCS
by Diego Figueira 18 Sep '18

18 Sep '18

The IRIF lab in Paris and the LABRI lab in Bordeaux, France have funding for a co-supervised PhD studentship in database theory starting in 2019. IRIF and LABRI are both very strong internationally renown research environments, hosting leading groups in several areas of theoretical computer science. For more information about the two labs please visit IRIF and LABRI. The PhD topic is in the area of foundations of data management, focusing on querying inconsistent data. Data management systems nowadays need to handle large data sets often containing inconsistent or incomplete information, and yet guarantee the relevance of query answers. New techniques are needed for making data access more reliable, and new tools are required for making data querying more efficient in this context. The main focus of the PhD will be the study of consistent query answering. In this scenario the data set may have inconsistencies relative to integrity constraints (e.g., key and foreign key constraints, functional dependencies, inclusion constraints, etc.). Queries issued on the database need to be answered despite the inconsistencies. The goal is to provide only consistent answers, i.e. answers that can be be found after virtually repairing the database to remove inconsistencies. As many repairs may exist for a given database, the widely accepted notion is the one of certain answers, i.e. answers that can be found in all possible database repairs. The challenge is then to provide efficient algorithms for computing certain answers directly from the inconsistent database, as going through all possible repairs is clearly unfeasible. Particularly attractive is the possibility of obtaining certain answers by query rewriting, i.e. by issuing on the inconsistent database a new query with good computational properties. Despite a rich literature on the topic (see [1,2,3] for instance) many questions remain open even for simple classes of queries and constraints, such as conjunctive queries and primary key constraints. This PhD topic is part of a larger projet QUID (Efficient Querying for Incomplete and Inconsistent Data), funded by the French research agency ANR, starting in 2019. The project involves researchers from two other research labs in France: École Normale Supérieure (Paris) and the Institut Gaspard Monge (Marne-la-Vallée), and it studies certain answers in relation to three scenarios: ensuring data privacy, querying inconsistent data, and querying incomplete data. All these settings share the notion of certains answers used to answer queries over all possible plausible interpretations of an inconsistent, incomplete or partially specified data. The PhD student will also be welcome to contribute to the other topics of the project. Requirements Candidates should have a strong background in theoretical computer science, preferably in automata, logic, verification, or finite model theory. Some prior knowledge of database theory and systems is also a plus. Position The funding is for a 3-year full time position. The PhD must start during 2019; the precise starting date is to some extent negotiable. The PhD student will be co-supervised by Paris and Bordeaux, and is expected to spend time in both sites. Teaching is not mandatory but can be arranged upon request. Contacts Informal enquiries about this position are welcome and should be sent to both Diego Figueira (diego.figueira(a)labri.fr) and Cristina Sirangelo ( cristina(a)irif.fr). [1] L.Bertossi. Database Repairing and Consistent Query Answering Synthesis Lectures on Data Management. Morgan & Claypool Publishers [2] P. Koutris, J.Wijsen. (2017) Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. ACM Transactions on Database Systems 42:2, 1-45. [3] C.Lutz, F.Wolter. On the Relationship between Consistent Query Answering and Constraint Satisfaction Problems. ICDT 2015: 363-379

1 0

STACS 2019 in Berlin --- Second and Last Call for Papers
by Rolf Niedermeier 17 Sep '18

17 Sep '18

STACS 2019 - Call for papers 36th International Symposium on Theoretical Aspects of Computer Science March 13—16, 2019, TU Berlin, Berlin, Germany Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science. Typical areas include (but are not limited to): * algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory; * automata and formal languages, including: algebraic and categorical methods, coding theory; * complexity and computability, including: computational and structural complexity theory, parameterized complexity, randomness in computation; * logic in computer science, including: finite model theory, database theory, semantics, specification verification, rewriting and deduction; * current challenges, for example: natural computing, quantum computing, mobile and net computing, computational social choice. INVITED SPEAKERS Leslie Ann Goldberg (Oxford), "Computational Complexity and the Independence Polynomial" Anca Muscholl (Bordeaux), "The Many Facets of String Transducers" Petra Mutzel (Dortmund), "Algorithmic Data Analysis" PROGRAM COMMITTEE Christoph Berkholz (Berlin) Benedikt Bollig (Cachan) Karl Bringmann (Saarbrücken) Gerth Stølting Brodal (Aarhus) Maike Buchin (Bochum) David Eppstein (Irvine) Serge Gaspers (Sydney) Edward Hirsch (St. Petersburg) Telikepalli Kavitha (Mumbai) Hartmut Klauck (Singapore) Antonín Kučera (Brno) K Narayan Kumar (Chennai) Dietrich Kuske (Ilmenau) Jérôme Lang (Paris) Sophie Laplante (Paris) Kazuhisa Makino (Kyoto) Barnaby Martin (Durham) Cyril Nicaud (Marne-la-Vallée) Rolf Niedermeier (Berlin, co-chair) Jakob Nordström (Stockholm) Christophe Paul (Montpellier, co-chair) Pascal Schweitzer (Kaiserslautern) Shinnosuke Seki (Tokyo) Michał Skrzypczak (Warsaw) Srikanth Srinivasan (Mumbai) Jan Arne Telle (Bergen) Denis Trystram (Grenoble) Takeaki Uno (Tokyo) Mikhail Volkov (Ekaterinburg) Stefan Woltran (Wien) TUTORIALS There will be the following two tutorials taking place on March 13, 2019: Tobias Friedrich (HPI Potsdam): "Network Science" Karl Bringmann (MPI Saarbrücken): "Fine-Grained Complexity Theory" SUBMISSIONS Submissions can be uploaded to EasyChair: https://easychair.org/conferences/?conf=stacs2019. Authors are invited to submit a draft of a full paper with at most 12 pages (excluding the title page and the references section). The title page consists exclusively of the title of the paper, author information, and abstract. The usage of pdflatex and the LIPIcs style file (see http://www.dagstuhl.de/en/publications/lipics) are mandatory; no changes to font size, page geometry, etc. are permitted. Submissions not in the correct format or submitted after the deadline will not be considered. The paper should contain a succinct statement of the issues and of their motivation, a summary of the main results, and a brief explanation of their significance, accessible to non-specialist readers. Proofs omitted due to space constraints must be put into an appendix, to be read by the program committee members at their discretion. Simultaneous submission to other conferences with published proceedings or to journals is not allowed. PC members are excluded from submitting. There will be a rebuttal period for authors between November 26—29, 2018. Authors will receive the reviews of their submissions (via EasyChair) and have three days to submit rebuttals (via EasyChair). These rebuttals become part of the PC meeting, but entail no specific responses. PROCEEDINGS Accepted papers will be published in the proceedings of the symposium. As usual, these proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees perennial, free and easy electronic access, while the authors retain the rights over their work. With their submission, authors consent to sign a license authorizing the program committee chairs to organize the electronic publication of their paper, provided the paper is accepted. IMPORTANT DATES * Deadline for submissions: October 1, 2018 (AoE) * Rebuttal: November 26–29, 2018 * Author notification: December 20, 2018 * Final version: January 16, 2019 * STACS 2019: March 13–16, 2019 CONTACT INFORMATION Web: https://stacs2019.akt.tu-berlin.de/ Email: stacs2019(a)akt.tu-berlin.de

1 0