finite-model-theory September 2018

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

6 participants
6 discussions

LICS 2019 Call for Papers

by Sam Staton

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.

5 years, 12 months

PhD student position in TCS

by Diego Figueira

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

5 years, 12 months

STACS 2019 in Berlin --- Second and Last Call for Papers

by Rolf Niedermeier

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

5 years, 12 months

LATA 2019: 1st call for papers

by IRDTA

LATA 2019: 1st 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 venue will be Saint Petersburg State University. 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: tba 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) 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) 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 (University of New South Wales, 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

5 years, 12 months

Call for Applications: Helmut Veith Stipend for Female Master´s Students in Computer Science

by Mihaela Rozman

[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 computer science department at Vienna University of Technology TU Wien, has been ranked among the 70 world´s best (THE Times Higher Education Ranking). 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 was 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 -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. In 2018/2019 and 2019/2020 those are: Master in Logic and Computation Master in Business Informatics; Master in Computational Logic Master in Computer Engineering ( <http://www.informatik.tuwien.ac.at/studium/angebot/master/technische-inform atik> Technische Informatik) APPLICATION Applications for funding can be filed before or in parallel with the admissions process. Your application 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/

6 years

Call for Papers: Postproceedings for ThEdu'18 by EPTCS

by Achim D. Brucker

(Apologies for duplicates) Open Call for Papers ************************************************************************** Postproceedings for ThEdu'18 by EPTCS Theorem proving components for Educational software http://www.uc.pt/en/congressos/thedu/thedu18 ************************************************************************** Workshop ThEdu at FLoC Federated Logic Conference 2018 http://www.floc2018.org/ ************************************************************************** THedu'18 Postproceedings: ThEdu's programme comprised seven contributions, presented also in the webpages. Now postproceedings are planned to collect the contributions upgraded to full papers. The contributions' topics are diverse according to ThEdu's scope, and this is a call open for everyone, also those who did not participate in the workshop. All papers will undergo review according to EPTCS standards. THedu'18 Scope: Computer Theorem Proving is becoming a paradigm as well as a technological base for a new generation of educational software in science, technology, engineering and mathematics. The workshop brings together experts in automated deduction with experts in education in order to further clarify the shape of the new software generation and to discuss existing systems. Topics of interest include: * methods of automated deduction applied to checking students' input; * methods of automated deduction applied to prove post-conditions for particular problem solutions; * combinations of deduction and computation enabling systems to propose next steps; * automated provers specific for dynamic geometry systems; * proof and proving in mathematics education. Important Dates * 2nd call for papers: 10 Sep 2018 * Submission (full papers): 18 Nov 2018 * Notification of acceptance: 17 Dec 2018 * Revised papers due: 21 Jan 2019 Submission We welcome submission of papers presenting original unpublished work which is not been submitted for publication elsewhere. The authors should comply with the "instructions for authors", LaTeX style files and accept the "Non-exclusive license to distribute" of EPTCS: Instructions for authors (http://info.eptcs.org/) LaTeX style file and formatting instructions (http://style.eptcs.org/) Copyright (http://copyright.eptcs.org/) Papers should be submitted via easychair, https://easychair.org/conferences/?conf=thedu18. In case the contributions finally do not reach the standards of EPTCS in number, there will be an alternative to publish as a techreport at CISUC https://www.cisuc.uc.pt/publications. Program Committee Francisco Botana, University of Vigo at Pontevedra, Spain Roman Hašek, University of South Bohemia, Czech Republic Filip Maric, University of Belgrade, Serbia Walther Neuper, Graz University of Technology, Austria (co-chair) Pavel Pech, University of South Bohemia, Czech Republic Pedro Quaresma, University of Coimbra, Portugal (co-chair) Vanda Santos, CISUC, Portugal Wolfgang Schreiner, Johannes Kepler University, Austria -- Dr. Achim D. Brucker | Software Assurance & Security | University of Sheffield https://www.brucker.ch | https://logicalhacking.com/blog @adbrucker | @logicalhacking

6 years

2024

2023

2022

2021

2020

2019

2018

finite-model-theory September 2018