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

Third CFP - RAMiCS 2020
by Michael Winter 13 Sep '19

13 Sep '19

THIRD CALL FOR PAPERS 18th International Conference on Relational and Algebraic Methods in Computer Science RAMiCS 2020 08. April to 11. April 2020, Palaiseau, France URL: http://ramics18.gforge.inria.fr/ IMPORTANT DATES: Abstract Submission: 06. October 2019 Paper Submission: 13. October 2019 Author Notification: 15. December 2019 Final Version: 16. January 2020 RAMiCS 2020: 08. April to 11. April 2020 INVITED TALKS: Christel Baier, Technische Universitaet Dresden, Germany Manfred Droste, Universitaet Leipzig, Germany Daniela Petrisan, Universite Paris Diderot, France GENERAL INFORMATION: Since 1994, the RAMiCS conference series has been the main venue for research on relation algebras, Kleene algebras and similar algebraic formalisms, and their applications as conceptual and methodological tools in computer science and beyond. TOPICS: We invite submissions in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories - their formalisation with theorem provers * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications WATA 2020 WATA 2020, the 10th International Workshop on Weighted Automata: Theory and Applications, will take place just after RAMICS, from 14 to 17 April, in Marseille. We encourage participants to combine the two events. SUBMISSION INSTRUCTIONS: Submission is via EasyChair at https://www.easychair.org/conferences/?conf=ramics2020 All papers will be peer-reviewed by at least three referees. The proceedings will be published in an LNCS volume by Springer, ready at the conference. Submissions must not be published or under review for publication elsewhere. Submissions must be in English using a PDF not exceeding 16 pages in LNCS style. Submissions must provide sufficient information to judge their merits. Additional material may be provided in a clearly marked appendix or by a reference to a manuscript on a web site. Experimental data, software or mathematical components for theorem provers must be available in sufficient detail for referees. Deviation from these requirements may lead to rejection. One author of each accepted paper is expected to present the paper at the conference. Accepted papers must be produced with LaTeX. Formatting instructions and LNCS style files are available at http://www.springer.de/comp/lncs/authors.html As for earlier RAMiCS conferences, we intend to publish a journal special issue with revised and extended versions of a selection of the best papers. COMMITTEES: Organising Committee -------------------- Conf. & PC Co-Chair: Peter Jipsen, Chapman University, USA Conf. & PC Co-Chair: Uli Fahrenberg, École polytechnique, France Conf. & PC Co-Chair: Michael Winter, Brock University, Canada Programme Committee ------------------- Roland Backhouse University of Nottingham, UK Rudolf Berghammer Kiel University, Germany Manuel Bodirsky TU Dresden, Germany Jules Desharnais Laval University, Canada Amina Doumane PPS, France Uli Fahrenberg École polytechnique, France Hitoshi Furusawa Kagoshima University, Japan Mai Gehrke LIAFA, France Walter Guttmann University of Canterbury, New Zealand Robin Hirsch University College London, UK Peter Höfner CSIRO, Australia Marcel Jackson La Trobe University, Australia Jean-Baptiste Jeannin University of Michigan, USA Peter Jipsen Chapman University, USA Stef Joosten Open Universiteit, Netherlands Wolfram Kahl McMaster University, Canada Dexter Kozen Cornell University, USA Tadeusz Litak FAU Erlangen-Nürnberg, Germany Wendy MacCaull St. Francis Xavier University, Canada Roger Maddux Iowa State University, USA Annabelle McIver Macquarie University, Australia Szabolcs Mikulas University of London, UK Ali Mili NJIT, USA Jose Oliveira University of Minho, Portugal Alessandra Palmigiano Technical University of Delft, Netherlands Damien Pous CNRS - ENS Lyon, France Mehrnoosh Sadrzadeh University College London, UK Luigi Santocanale LIS, Aix-Marseille Université, France John Stell University of Leeds, UK Georg Struth University of Sheffield, UK Michael Winter Brock University, Canada

1 0

LATA 2020: 2nd call for papers
by IRDTA 10 Sep '19

10 Sep '19

LATA 2020: 2nd call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 Milan, Italy March 2-6, 2020 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London https://lata2020.irdta.eu ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 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 2020 will take place in Milan, the third largest economy among European cities and one of the Four Motors for Europe. 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, inductive 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 2020 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: Eric Allender (Rutgers University), The New Complexity Landscape around Circuit Minimization Christoph Haase (University College London), Approaching Arithmetic Theories with Finite-state Automata Artur Jeż (University of Wrocław), Recompression: Technique for Word Equations and Compressed Data Jean-Éric Pin (CNRS), How to Prove that a Language Is Regular or Star-free? Thomas Place (University of Bordeaux), Deciding Classes of Regular Languages: A Language Theoretic Point of View PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Flavio Corradini (University of Camerino, IT) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Tero Harju (University of Turku, FI) Jeffrey Heinz (Stony Brook University, US) Lane A. Hemaspaandra (University of Rochester, US) Marcin Jurdziński (University of Warwick, UK) Juhani Karhumäki (University of Turku, FI) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) François Le Gall (Kyoto University, JP) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Antonio Restivo (University of Palermo, IT) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Tomáš Vojnar (Brno University of Technology, CZ) Mikhail Volkov (Ural Federal University, RU) James Worrell (University of Oxford, UK) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Rafael Peñaloza Nyssen (Milan) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, 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=lata2020 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: https://lata2020.irdta.eu/registration DEADLINES (all at 23:59 CET): Paper submission: October 18, 2019 Notification of paper acceptance or rejection: November 25, 2019 Final version of the paper for the LNCS proceedings: December 2, 2019 Early registration: December 2, 2019 Late registration: February 17, 2020 Submission to the journal special issue: June 6, 2020 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

Post Doctoral position in Parameterized Complexity at TU Wien, Vienna, Austria
by Mihaela Rozman 10 Sep '19

10 Sep '19

There is an opening for a postdoc position at the Algorithms and Complexity group at TU Wien (Vienna University of Technology), Vienna, Austria. - The position is for two years with the possibility of an extension. - The position is research-only, but interested candidates have the opportunity get involved in teaching. - The employment is full-time (40 hrs/week) and the salary is internationally competitive (the yearly entry-level gross salary is approx. 53K for postdocs). - The working language at the university is English, knowledge of German is not required. REQUIREMENTS Required are a PhD degree in Computer Science or related area and excellent knowledge of algorithms and complexity, preferably in the setting of parameterized complexity and fixed-parameter tractability. Some background in graph theory, combinatorics, satisfiability, computational logic, or constraint satisfaction is of advantage. APPLICATION -Applications must be made by September 27, 2019. -The application should include the candidate's CV, an abstract of their PhD thesis, a motivation letter, and a list of three references. INFORMAL INQUIRES - Informal inquires by email (Stefan Szeider, <sz[AT]ac.tuwien.ac.at>) are welcome.

1 0

Highlights of Logic, Games, and Automata: Last Call
by Nathanaël Fijalkow 26 Aug '19

26 Aug '19

Last call for registration for HIGHLIGHTS 2019. REGISTRATION DEADLINE: 31 AUGUST 2019 *************** HIGHLIGHTS 2019: 7th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 17-20 September 2019, Warsaw http://highlights-conference.org COLOCATED EVENT: + School on Nominal Techniques - 3rd School on Foundations of Programming and Software Systems (FOPSS), 10-15 September ================================================ HIGHLIGHTS 2019 is the 7th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic and Finite Model Theory, Automata Theory, and Games for Logic and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. A visit to the annual Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. The speakers are encouraged to present their best recent work at Highlights, whether already published elsewhere or not. The conference is short (from 18 September to the mid-day on 20 September) and it is preceded by the Highlights Tutorial Day (17 September). The participation costs are modest and Warsaw is easy to reach. Invited Tutorials + Sebastian Siebertz, Nowhere dense graph classes and algorithmic applications + Guy Avni, Formal Methods Meets Algorithmic Game Theory Invited Talks + Dmitry Chistikov, On the complexity of logics over the integers + Marie Fortin, Expressivity of first-order logic and star-free propositional dynamic logic over ordered structures Invited Spotlight Talks Upper and Lower bounds for Reachability in Petri Nets and Vector Addition Systems + Jérôme Leroux + Sylvain Schmitz

1 0

LATA 2020: 1st call for papers
by IRDTA 22 Aug '19

22 Aug '19

LATA 2020: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line* ************************************************************************* 14th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS LATA 2020 Milan, Italy March 2-6, 2020 Co-organized by: Department of Informatics, Systems and Communication University of Milano-Bicocca and Institute for Research Development, Training and Advice Brussels/London lata2020.irdta.eu ************************************************************************* AIMS: LATA is a conference series on theoretical computer science and its applications. LATA 2020 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 2020 will take place in Milan, the third largest economy among European cities and one of the Four Motors for Europe. 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 2020 will consist of: invited talks peer-reviewed contributions INVITED SPEAKERS: tba PROGRAMME COMMITTEE: Jorge Almeida (University of Porto, PT) Franz Baader (Technical University of Dresden, DE) Alessandro Barenghi (Polytechnic University of Milan, IT) Djamal Belazzougui (CERIST, DZ) Marcello Bonsangue (Leiden University, NL) Bruno Courcelle (University of Bordeaux, FR) Laurent Doyen (ENS Paris-Saclay, FR) Manfred Droste (Leipzig University, DE) Rudolf Freund (Technical University of Vienna, AT) Paweł Gawrychowski (University of Wrocław, PL) Tero Harju (University of Turku, FI) Jeffrey Heinz (Stony Brook University, US) Lane A. Hemaspaandra (University of Rochester, US) Marcin Jurdziński (University of Warwick, UK) Juhani Karhumäki (University of Turku, FI) Jarkko Kari (University of Turku, FI) Dexter Kozen (Cornell University, US) François Le Gall (Kyoto University, JP) Markus Lohrey (University of Siegen, DE) Parthasarathy Madhusudan (University of Illinois, Urbana-Champaign, US) Sebastian Maneth (University of Bremen, DE) Nicolas Markey (IRISA, Rennes, FR) Carlos Martín-Vide (Rovira i Virgili University, ES, chair) Giancarlo Mauri (University of Milano-Bicocca, IT) Victor Mitrana (University of Bucharest, RO) Paliath Narendran (University at Albany, US) Gennaro Parlato (University of Molise, IT) Dominique Perrin (University of Paris-Est, FR) Nir Piterman (Chalmers University of Technology, SE) Sanguthevar Rajasekaran (University of Connecticut, US) Wojciech Rytter (University of Warsaw, PL) Kai Salomaa (Queen’s University, CA) Helmut Seidl (Technical University of Munich, DE) William F. Smyth (McMaster University, CA) Jiří Srba (Aalborg University, DK) Edward Stabler (University of California, Los Angeles, US) Benjamin Steinberg (City University of New York, US) Frank Stephan (National University of Singapore, SG) Jan van Leeuwen (Utrecht University, NL) Margus Veanes (Microsoft Research, US) Tomáš Vojnar (Brno University of Technology, CZ) Mikhail Volkov (Ural Federal University, RU) James Worrell (University of Oxford, UK) ORGANIZING COMMITTEE: Alberto Leporati (Milan, co-chair) Sara Morales (Brussels) Manuel Parra-Royón (Granada) Dana Shapira (Ariel) David Silva (London, co-chair) Bianca Truthe (Giessen) Claudio Zandron (Milan, 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=lata2020 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: lata2020.irdta.eu/registration DEADLINES (all at 23:59 CET): Paper submission: October 18, 2019 Notification of paper acceptance or rejection: November 25, 2019 Final version of the paper for the LNCS proceedings: December 2, 2019 Early registration: December 2, 2019 Late registration: February 17, 2020 Submission to the journal special issue: June 6, 2020 QUESTIONS AND FURTHER INFORMATION: david (at) irdta.eu ACKNOWLEDGMENTS: Università degli Studi di Milano-Bicocca IRDTA – Institute for Research Development, Training and Advice, Brussels/London

1 0

ICDT2020 CfP - Second Submission Cycle (2nd call)
by Carsten Lutz 21 Aug '19

21 Aug '19

CALL FOR PAPERS 23rd INTERNATIONAL CONFERENCE ON DATABASE THEORY (ICDT 2020) Second Cycle Copenhagen, Denmark, March 30 - April 2, 2020 https://diku-dk.github.io/edbticdt2020/ * About ICDT ICDT is an international conferences series that addresses the principles and theory of data management. Since 2009, it is annually and jointly held with EDBT, the international conference on extending database technology. See also https://databasetheory.org/icdt-pages. * Invited Speakers Include Benny Kimelfeld, Jerzy Marcinkowski, and Juan Reutter. * Broadening Scope As ICDT strives to broaden its scope, ICDT 2020 will have a Reach Out Track that calls for - novel formal frameworks or directions for database theory and/or - connections between principles of data management and other communities. The aim of the Reach Out track is to present novel and important directions for database theory and to expand the scope and impact of ICDT towards neighboring communities such as Database Systems, Artificial Intelligence, Knowledge Representation, Machine Learning, Programming Languages, Distributed Computing, and Operating Systems. It is reasonable for articles submitted to this track to be be shorter than regular ICDT submissions. Submissions will be judged mainly in terms of their potential to lead to valuable and impactful theoretical developments. We encourage authors to illustrate the potential impact via convincing examples, preliminary results, and clearly specified open problems. * Topics of Interest Every topic related to the principles of data management is relevant to ICDT. Particularly welcome are contributions that connect data management to theoretical computer science, and those that connect database theory and database practice. Examples of relevant topics include: - Data mining, information extraction, information retrieval, and database aspects of machine learning - Data models, design, structures, semantics, query languages, and algorithms for data management - Distributed and parallel databases, cloud computing - Databases and knowledge representation - Graph databases, (semantic) Web data, and Web services - Data streams and sketching - Data-centric (business) process management and workflows - Data and knowledge integration and exchange, data provenance, views, and data warehouses - Domain-specific databases (multimedia, scientific, spatial, etc) - Data privacy and security, concurrency, and recovery * Deadlines The deadlines for the second submission cycle are as follows, all dates anywhere on earth (AoE). Abstract: September 15, 2019 Full paper: September 23, 2019 Notification: December 5, 2019 * Program Committee Program Committee Chair: Carsten Lutz (University of Bremen) Program Committee Members: Marcelo Arenas (PUC, Santiago de Chile) Michael Benedikt (University of Oxford) Christoph Berkholz (HU Berlin) Angela Bonifati (University Lyon 1) Pierre Bourhis (University of Lille) James Cheney (University of Edinburgh) Graham Cormode (University of Warwick) Victor Dalmau (UPF, Barcelona) Claire David (University Paris-Est) Floris Geerts (University of Antwerp) Bas Ketsman (EPFL, Lausanne) Daniel Kifer (Penn State University) Leonid Libkin (University of Edinburgh) Sebatian Maneth (University of Bremen) Filip Murlak (University of Warsaw) Reinhard Pichler (TU Vienna) Andreas Pieris (University of Edinburgh) Sebastian Rudolph (TU Dresden) Thomas Schwentick (University of Dortmund) Uri Stemmer (Ben-Gurion University, Negev) Domagoj Vrgoc (PUC, Santiago de Chile) Frank Wolter (University of Liverpool) * Submission Instructions Submissions will be electronic via EasyChair at https://easychair.org/conferences/?conf=icdt2020. Papers must be written in English and provide sufficient detail to allow the program committee to assess their merits. The results must be unpublished and not submitted for publication elsewhere, including the proceedings of other symposia, workshops, and journals. Papers must be submitted as a PDF document and use the LIPIcs style (http://www.dagstuhl.de/en/publications/lipics/instructions-for-authors). Paper length is limited to 15 pages excluding references, both for regular submissions and for the Reach Out Track. Additional details may be included in a clearly marked appendix which will be read at the discretion of the program committee. Online appendices are not allowed. Papers that do not conform to these requirements may be rejected without further consideration. The proceedings will appear in the Leibniz International Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl. This guarantees that the proceedings will be available under the gold open access model, that is, online and free of charge while the authors retain the rights over their work. At least one author of each accepted paper is expected to register at the conference and to present the paper. * Awards An award will be given to the Best Paper and to the Best Newcomer Paper where `newcomer' refers to the field of database theory. The latter award will preferentially be given to a paper authored only by students and in that case be called Best Student-Paper Award. The program committee reserves the right to not give any award and to split an award among several papers. Papers co-authored by program committee members are not eligible for an award.

1 0

Highlights of Logic, Games, and Automata: Call for Registration and Participation
by Nathanaël Fijalkow 21 Aug '19

21 Aug '19

Please register and attend HIGHLIGHTS 2019! The programme is here: http://highlights-conference.org/#program REGISTRATION DEADLINE: 31 AUGUST 2019 *************** HIGHLIGHTS 2019: 7th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 17-20 September 2019, Warsaw http://highlights-conference.org COLOCATED EVENT: + School on Nominal Techniques - 3rd School on Foundations of Programming and Software Systems (FOPSS), 10-15 September ================================================ HIGHLIGHTS 2019 is the 7th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic and Finite Model Theory, Automata Theory, and Games for Logic and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. A visit to the annual Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. The speakers are encouraged to present their best recent work at Highlights, whether already published elsewhere or not. The conference is short (from 18 September to the mid-day on 20 September) and it is preceded by the Highlights Tutorial Day (17 September). The participation costs are modest and Warsaw is easy to reach. Invited Tutorials + Sebastian Siebertz, Nowhere dense graph classes and algorithmic applications + Guy Avni, Formal Methods Meets Algorithmic Game Theory Invited Talks + Dmitry Chistikov, On the complexity of logics over the integers + Marie Fortin, Expressivity of first-order logic and star-free propositional dynamic logic over ordered structures Invited Spotlight Talks Upper and Lower bounds for Reachability in Petri Nets and Vector Addition Systems + Jérôme Leroux + Sylvain Schmitz

1 0

CFP: FoIKS 2020
by Kontinen, Juha A 21 Aug '19

21 Aug '19

FoIKS 2020: Eleventh International Symposium on Foundations of Information and Knowledge Systems University of Dortmund, Germany, Feb. 17-21, 2020 Conference website: https://foiks2020.cs.tu-dortmund.de/ Submission link: https://easychair.org/conferences/?conf=foiks2020 Submission deadlines: September 11, 2019 (abstract), September 18, 2019 (paper) The FoIKS symposia provide a biennial forum for presenting and discussing theoretical and applied research on information and knowledge systems. The goal is to bring together researchers with an interest in this subject, share research experiences, promote collaboration and identify new issues and directions for future research. FoIKS 2020 solicits original contributions dealing with any foundational aspect of information and knowledge systems. This includes submissions that apply ideas, theories or methods from specific disciplines to information and knowledge systems. Examples of such disciplines are discrete mathematics, logic and algebra, model theory, information theory, complexity theory, algorithmics and computation, statistics and optimization. The FoIKS symposia are a forum for intense discussions. Speakers will be given sufficient time to present their ideas and results within the larger context of their research; furthermore, participants will be asked to prepare a first response to another contribution in order to initiate discussion. *** Suggested topics The suggested topics include, but are not limited to: * Database Design: Formal models, dependencies and independencies * Big Data: Models for data in the Cloud, programming languages for big data, query processing * Dynamics of Information: Models of transactions, concurrency control, updates, consistency preservation, belief revision * Information Fusion: Heterogeneity, views, schema dominance, multiple source information merging, reasoning under inconsistency * Integrity and Constraint Management: Verification, validation, consistent query answering, information cleaning * Intelligent Agents: Multi-agent systems, autonomous agents, foundations of software agents, cooperative agents, formal models of interactions, negotiations and dialogue, logical models of emotions * Knowledge Discovery and Information Retrieval: Machine learning, data mining, formal concept analysis and association rules, text mining, information extraction * Knowledge Representation, Reasoning and Planning: Non-monotonic formalisms, probabilistic and non-probabilistic models of uncertainty, graphical models and independence, similarity-based reasoning, preference modeling and handling, computational models of argument, argumentation systems * Logics in Databases and AI: Classical and non-classical logics, logic programming, description logics, spatial and temporal logics, probability logic, fuzzy logic * Mathematical Foundations: Discrete structures and algorithms, graphs, grammars, automata, abstract machines, finite model theory, information theory, coding theory, complexity theory, randomness * Security in Information and Knowledge Systems: Identity theft, privacy, trust, intrusion detection, access control, inference control, secure Web services, secure Semantic Web, risk management * Semi-Structured Data and XML: Data modelling, data processing, data compression, data exchange * Social Computing: Collective intelligence and self-organizing knowledge, collaborative filtering, computational social choice, Boolean games, coalition formation, reputation systems *The Semantic Web and Knowledge Management: Languages, ontologies, agents, adaption, intelligent algorithms, ontology-based data access * The WWW: Models of Web databases, Web dynamics, Web services, Web transactions and negotiations, Social Networks, Web Mining *** Submission Guidelines All papers must be original and not simultaneously submitted to another journal or conference. Papers must be typeset using the Springer LaTeX2e style llncs for Lecture Notes in Computer Science. The suggested number of pages is 16, and the maximum number of pages is 18. Submissions which deviate substantially from these guidelines may be rejected without review. Initial submissions must be in PDF format, but authors should keep in mind that the LaTeX2e source must be submitted for the final versions of accepted papers. Submissions in alternate formats, such as Microsoft Word, cannot be accepted for either initial or final versions. The submissions will be judged for scientific quality and for suitability as a basis for broader discussion. Submission is via EasyChair. *** Important Dates Abstract submission deadline: September 11, 2019 Paper submission deadline: September 18, 2019 Author notification: November 19, 2019 Camera-ready paper due: December 05, 2019 FoIKS 2020 Symposium: February 14-18, 2020 *** Program Committee Ait Ameur, Yamine Artale, Alessandro Bauters, Kim Beierle, Christoph Bertossi, Leopoldo Besnard, Philippe Bidoit, Nicole Bienvenu, Meghyn Biskup, Joachim Botoeva, Elena Britz, Arina Doder, Dragan Eiter, Thomas Fermüller, Christian Ferrarotti, Flavio Gierasimczuk, Nina Gyssens, Marc Janhunen, Tomi Järvisalo, Matti Kern-Isberner, Gabriele Kiss, Attila Krötzsch, Markus Kuusisto, Antti Link, Sebastian Lukasiewicz, Thomas Palmigiano, Alessandra Rudolph, Sebastian Sali, Attila Schewe, Klaus-Dieter Schockaert, Steven Shchekotykhin, Kostyantyn Simari, Guillermo R. Thalheim, Bernhard Thomo, Alex Truszczynski, Mirek Turull-Torres, Jose Van Gucht, Dirk Varzinczak, Ivan Virtema, Jonni Wang, Qing Woltran, Stefan *** Program Chairs * Andreas Herzig, CNRS, IRIT, Toulouse, France * Juha Kontinen, University of Helsinki, Finland *** Local Organization Chair Gabriele Kern-Isberner, TU Dortmund Christoph Beierle, University of Hagen *** Invited Speakers tba *** Publication The proceedings will be published by Springer-Verlag in the Lecture Notes in Computer Science. After the symposium, authors of selected papers will be invited to submit extended journal versions of their papers for a FoIKS 2020 special issue of the Annals of Mathematics and Artificial Intelligence. *** Venue The conference will be held at the TU Dortmund; further information on the venue will be provided in time. *** Contact All questions about submissions should be emailed to foiks2020(a)easychair.org<mailto:foiks2020@easychair.org>.

1 0

FroCoS-12 and TABLEAUX-28, London, September 2-6: second call for participation (early registration closes on August 21)
by Andrei Popescu 19 Aug '19

19 Aug '19

The 2019 editions of FroCoS (the 12th International Symposium on Frontiers of Combining Systems) and TABLEAUX (the 28th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), as well as their affiliated workshops and tutorials will take place in London, at Middlesex University, on the week of September 2-6. This year we have an exciting program of contributed and invited talks, and affiliated events. Please see https://tableaux2019.org/Program_FroCoS_TABLEAUX_2019.pdf for detailed program information. Moreover, information on traveling and accommodation (including affordable accommodation for budget-constrained participants), and on the sites and activities that can be enjoyed in the Middlesex University's beautiful campus, is available from the conferences' websites: https://frocos2019.org and https://tableaux2019.org Information on registration and fees is also available from these websites. The deadline for early registration is August 21st, 2019. INVITED TALKS * Jeremy Avigad. Automated Reasoning for the Working Mathematician * Maria Paola Bonacina. Conflict-Driven Reasoning in Unions of Theories * Stephane Graham-Lengrand. Recent and Ongoing Developments of Model-Constructing Satisfiability * Stephane Graham-Lengrand and Sara Negri. Remembering Roy Dyckhoff * Uli Sattler. Modularity and Automated Reasoning in Description Logics AFFILIATED WORKSHOPS * The 25th Workshop on Automated Reasoning (ARW 2019), organized by Alexander Bolotov and Florian Kammueller * Journeys in Computational Logic: Tributes to Roy Dyckhoff, organized by Stephane Graham-Lengrand, Ekaterina Komendantskaya and Mehrnoosh Sadrzadeh AFFILIATED TUTORIALS * Formalising Concurrent Computation: CLF, Celf, and Applications by Sonia Marin * How to Build an Automated Theorem Prover -- An Introductory Tutorial (invited TABLEAUX tutorial) by Jens Otten For any questions, please contact the organizers at chair(a)tableaux2019.org or chair(a)frocos2019.org. We hope to see many of you this September in London. Best wishes, Serenella Cerrito, Andreas Herzig, Andrei Popescu and Franco Raimondi (program chairs and local organizers)

1 0

FoPSS'19: Summer School on Foundations of Programming and Software Systems
by Bartek Klin 12 Aug '19

12 Aug '19

FINAL CALL FOR PARTICIPATION: FoPPS 2019: Nominal Techniques 3rd Summer School on Foundations of Programming and Software Systems 10-15 September, Warsaw, Poland https://www.mimuw.edu.pl/~fopss19/ ================================================================== The 2019 Alonzo Church Award was given to M. J. Gabbay and A. M. Pitts for their ground-breaking work on nominal sets. (https://siglog.org/winners-of-the-2019-alonzo-church-award/) Do you want to learn what that was about? Come to FoPSS 2019! ================================================================== The Summer School on Foundations of Programming and Software Systems (FoPSS) was jointly created by EATCS, ETAPS, ACM SIGLOG and ACM SIGPLAN. It was first organised in 2017. The goal is to introduce the participants to various aspects of computation theory and programming languages. The school, spread over a single week, is aimed at students and researchers in Theoretical Computer Science, broadly construed. Each year the school is focused on a particular, actively researched topic. Our focus in 2019 are Nominal Techniques in Computer Science. For the introduction and cornerstone contributions to this area Murdoch J. Gabbay and Andrew M. Pitts received the 2019 Alonzo Church Award. Both of them are among the lecturers of FoPSS 2019. The scientific programme of the school is available from our website: https://www.mimuw.edu.pl/~fopss19/programme.html Registration fee includes lunches, coffee breaks and accommodation in a hotel within a walking distance from the school venue. We have a few scholarships available to participants who have difficult access to funding. Registration is open! ================================================================== COLOCATED EVENT: Highlights 2019: 7th annual conference on Highlights of Logic, Games and Automata 17-20 September (http://highlights-conference.org)

1 0