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

1st World Logic Day, 14 January 2019 - Report on the Celebrations
by jean-yves beziau 14 Feb '19

14 Feb '19

One month ago was organized the 1st World Logic Day. It was celebrated in about 60 locations all over the world including Warsaw, Kolkata, Mecca, St Petersburg, Athens, Berlin, Vatican, Montréal, Rio de Janeiro, as reported in the following paper in open access: 1st World Logic Day: 14 January 2019 https://link.springer.com/article/10.1007/s11787-019-00221-5 As explained, January 14 is the day of death of Gödel and birth of Tarski. The collected papers of Tarski (4 volumes) have just been re-edited by Birkhäuser: https://www.springer.com/us/book/9783319953656 We will release soon a 5th volume with unpublished documents and letters. In the recent published Birkhäuser book The Lvov-Warsaw School - Past and Present https://link.springer.com/book/10.1007/978-3-319-65430-0 there are three papers about Tarski: Alfred Tarski: Auxiliary Notes on His Legacy, by Jan Zygmunt https://link.springer.com/chapter/10.1007/978-3-319-65430-0_31 Alfred Tarski (1901–1983), by Jan Wolenski https://link.springer.com/chapter/10.1007/978-3-319-65430-0_27 Tarski’s Influence on Computer Science, by Solomon Feferman https://link.springer.com/chapter/10.1007/978-3-319-65430-0_29 Jean-Yves Beziau - Editor-in-Chief Logica Universalis (Journal) Studies in Universal Logic (Book Series) Birkhäuser / Springer Nature, Basel, Switzerland

1 0

WiL 2019: Women in Logic Workshop Call for Papers
by Amy Felty 05 Feb '19

05 Feb '19

Call for Talks and Papers WiL 2019: 3rd Women in Logic Workshop Vancouver, Canada 23 June 2019 https://sites.google.com/site/womeninlogic2019/home Affiliated with the Thirty-Fourth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 24-27 June 2019 (https://lics.siglog.org/lics19/). We are holding the third Women in Logic Workshop (WiL 2019) as a LICS associated workshop on 23 June 2019. The workshop follows the pattern of meetings such as Women in Machine Learning (WiML, wimlworkshop.org/) or Women in Engineering (WIE, www.ieee-ras.org/membership/women-in-engineering) that have been taking place for quite a few years. Women are chronically underrepresented in the LiCS community. The workshop will provide an opportunity for women in the field to increase awareness of one another and one another’s work, to combat the feeling of isolation. It will also provide an environment where women can present to an audience comprising mostly women, replicating the experience that most men have at most LiCS meetings, and lowering the stress of the occasion; we hope that this will be particularly attractive to early-career women. Previous versions of Women in Logic (Reykjavik, Iceland 2017 and Oxford, UK 2018) were very successful in showcasing women's work and as catalysts for recognition of the need for change in the community. Our extended program committee tries to cover most areas of Logic in Computer Science. These include but are not limited to the usual Logic in Computer Science (LICS) topics. These are: automata theory, automated deduction, categorical models and logics, concurrency and distributed computation, constraint programming, constructive mathematics, database theory, decision procedures, description logics, domain theory, finite model theory, formal aspects of program analysis, formal methods, foundations of computability, games and logic, higher-order logic, lambda and combinatory calculi, linear logic, logic in artificial intelligence, logic programming, logical aspects of bioinformatics, logical aspects of computational complexity, logical aspects of quantum computation, logical frameworks, logics of programs, modal and temporal logics, model checking, probabilistic systems, process calculi, programming language semantics, proof theory, real-time systems, reasoning about security and privacy, rewriting, type systems and type theory, and verification. INVITED SPEAKERS * Anne Condon (University of British Columbia, Canada) * Zena Ariola (University of Oregon, USA) IMPORTANT DATES Paper submission deadline: 7 April 2019 Author notification: 23 April 2019 Contribution for Informal Proceedings: 9 May 2019 SUBMISSIONS Contributions should be written in English and can be submitted in the form of full papers (with a maximum of 10 pages), short papers (with a maximum of 5 pages), or talk abstracts (1 page). Formatting instructions: Papers and abstracts should be prepared using the Easychair style (https://easychair.org/publications/for_authors). The submission should be in the form of a PDF file uploaded to the WiL 2019 Easychair page (https://easychair.org/conferences/?conf=wil2019) before the submission deadline of 7 April 2019, anywhere on Earth. PROCEEDINGS We plan to publish an informal post conference volume at ENTCS or other equally visible outlet. ORGANIZING AND PROGRAM COMMITTEE Since our workshop is especially keen on making sure that women get to know the work of other women, we have a large program committee. * Sandra Alves (Universidade do Porto, Portugal) * Agata Ciabattoni (TU-Wien, Austria) * Amy Felty (Co-Chair, University of Ottawa, Canada) * Maribel Fernandez (King's College London, UK) * Sara Kalvala (University of Warwick, UK) * Delia Kesner (Université Paris Diderot, France) * Ursula Martin (University of Oxford, UK) * Valeria de Paiva (Co-Chair, Nuance, USA) * Catuscia Palamidessi (École Polytechnique, France) * Brigitte Pientka (Co-Chair, McGill University, Canada) * Elaine Pimentel (Universidade Federal do Rio Grande do Norte, Brazil) * Giselle Reis (Carnegie Mellon University, Qatar) * Simona Ronchi Della Rocca (Università degli Studi di Torino, Italy) * Alexandra Silva (University College London, UK) * Perdita Stevens (University of Edinburgh, UK) * Valeria Vignudelli (Ecole Normale Supérieure de Lyon, France)

1 0

Nominate outstanding Masters or Undergraduate Thesis for the VCLA International Student Awards 2019 - Deadline: March 15, 2019
by Mihaela Rozman 05 Feb '19

05 Feb '19

[Please feel free to distribute as appropriate.] [Apologies if you got multiple copies of this email.] Call for Nominations: VCLA INTERNATIONAL STUDENT AWARDS 2019 OVERVIEW The Vienna Center for Logic and Algorithms (VCLA) at TU Wien (Vienna University of Technology) seeks nominations for the VCLA International Student Awards 2019. The annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research (Bachelor) Theses (or equivalent) recognize authors of scientific works across the wide spectrum of Logic and Computer Science. Final submission deadline: 15.3.2019 AWARD *Outstanding Master Thesis Award: 1200 EUR *Outstanding Undergraduate Research (Bachelor) Award: 800 EUR *The winners will be invited to present their work at an award ceremony in Vienna, Austria in the autumn 2019 ELIGIBILITY *The degree must have been awarded between November 15th, 2017, and December 31st, 2018, (inclusive). *Students who obtained their degree at TU Wien are excluded from the nomination. MAIN AREAS OF INTEREST *Computational Logic, covering theoretical and mathematical foundations such as proof theory, model theory, computability theory, Boolean satisfiability (SAT), QBF, constraint satisfaction, satisfiability modulo theories, automated deduction (resolution, refutation, theorem proving), non-classical logics (substructural logics, multi-valued logics, deontic logics, modal and temporal logics). *Algorithms and Computational Complexity, including design and analysis of discrete algorithms, complexity analysis, algorithmic lower bounds, parameterized and exact algorithms, decomposition methods, approximation algorithms, randomized algorithms, algorithm engineering, as well as algorithmic game theory, computational social choice, parallel algorithms, and distributed algorithms. *Databases and Artificial Intelligence, concerned with logical methods for modeling, storing, and drawing inferences from data and knowledge. This includes subjects like query languages based on logical concepts (Datalog, variants of SQL, XML, and SPARQL), novel database-theoretical methods (schema mappings, information extraction and integration), logic programming, knowledge representation and reasoning (ontologies, answer-set programming, belief change, inconsistency handling, argumentation, planning). *Verification, concerned with logical methods and automated tools for reasoning about the behavior and correctness of complex state-based systems such as software and hardware designs as well as hybrid systems. This ranges from model checking, program analysis and abstraction to new interdisciplinary areas such as fault localization, program repair, program synthesis, and the analysis of biological systems. NOMINATION REQUIREMENTS *A cover page that contains the name and contact details of the nominated person, the title of the work for which the person is being nominated, award category, the date on which the degree was awarded, and the name of the university *An English summary of the thesis of maximum 3 pages, excluding references (A4 or letter page size, 11pt font min). The summary must clearly state the main contribution of the work, its novelty, and its relevance to some of the aforementioned areas of interest *The CV of the nominated person, including publication list (if applicable) *An endorsement letter from a supervisor or another proposing person. The letter must clearly state the independent and novel contribution of the student, and why the proposer believes the student deserves the award *The full thesis IMPORTANT DATES *Final submission deadline: March 15, 2019 (AoE) *Notification of decision: end of June 2019 *Award ceremony: September 2019, Vienna (Austria) AWARD COMMITTEE 2019 To be announced in February 2019. For the VCLA Award Committee 2018 see: https://logic-cs.at/award-call-2019/ *Robert Ganian (committee co-chair) *Magdalena Ortiz (general chair) *Revantha Ramanayake (committee co-chair) IN MEMORIAM The award is dedicated to the memory of Helmut Veith, the brilliant computer scientist who tragically passed away in March 2016, and aims to carry on his commitment to promoting young talent and promising researchers in these areas. WEBSITE AND CONTACT <https://logic-cs.at/award-call-2019/> https://logic-cs.at/award-call-2019/ award(a)logic-cs.at

1 0

DICE-FOPARA 2019: Call for Papers
by Thomas Seiller 01 Feb '19

01 Feb '19

CALL FOR PAPERS DICE-FOPARA 2019 Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis 6-7 April 2019, Prague; Satellite event of ETAPS 2019 https://conf.researchr.org/track/etaps-2019/dice-fopara-2019-papers ** OBJECTIVES ** The joint DICE-FOPARA workshop provides synergies by combining two complementary communities: The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. Several approaches have been explored for that purpose, such as restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs. The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. The joint DICE-FOPATA workshop at ETAPS 2019 follows the successful experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and ETAPS 2017 in Uppsala. ** TOPICS ** The joint workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice. Areas of interest to the workshop include, but are not limited to, the following: - type systems for controlling/inferring/checking complexity; - logical and machine-independent characterisations of complexity classes; - programming languages for complexity-bounded computation; - logics closely related to complexity classes; - theoretical foundations of program complexity analysis; - static resource analysis and practical applications; - resource analysis by term and graph rewriting. - semantics of complexity-bounded computation; - applications of implicit complexity to security; - termination and resource analysis for probabilistic programs; - semantic methods to analyse resources, including quasi-interpretations; - practical applications of resource analysis; ** SUBMISSIONS ** We ask for submission of regular papers describing original work (up to 15 pages) or extended abstracts (up to 5 pages) presenting already published work or work in progress. With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been already published, nor is presently submitted, elsewhere. With respect to submissions of extended abstracts, the goal is to provide a forum for discussing work in progress, but presentations of already published results are also welcome, provided those are within the scope of the workshop and potentially give rise to lively discussions during the meeting. A special issue of an international journal devoted to the joint workshop may be proposed. In this case, the CFP will be posted after the workshop and will be open to long versions of papers presented at this venue, as well as other submissions relevant to the scientific scope. Papers must be prepared using the LaTeX EPTCS style (http://style.eptcs.org/). Papers should be submitted electronically via the easychair submission page: https://easychair.org/conferences/?conf=dicefopara2019 ** IMPORTANT DATES ** Paper Submission -- January 31st, 2019 Author Notification -- February 21st, 2019 Final Version -- February 28th, 2019 Workshop -- April 6th and 7th, 2019 ** PROGRAM COMMITTEE ** Chairs: Steffen Jost, LMU, Munich, DE Thomas Seiller, CNRS, LIPN, Villetaneuse, FR Progam Committee: Robert Atkey, University of Strathclyde, Glasgow, UK Martin Avanzini, INRIA, Sophia Antipolis, FR Lennart Beringer, Princeton University, US Ezgi Cicek, Facebook, London, UK Lukasz Czajka, TU Dortmund, DE Ankush Das, Carnegie Mellon University, Pittsburgh, US Hugo Feree, University of Kent, UK Samir Genaim, Universidad Complutense de Madrid, ES Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh, UK Joanna Ochremiak, University of Cambridge, UK Romain Pechoux, Université de Lorraine, FR Paolo Pistone, Universität Tübingen, DE Pedro Vasconcelos, University of Porto, PT Margherita Zorzi, Università degli Studi di Verona, IT

1 1

FSCD 2019 - Deadline reminder (Abstracts: 8 February, Full Papers: 11 February)
by Sandra Alves 01 Feb '19

01 Feb '19

(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://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> 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 INVITED SPEAKERS ----------- Titles and abstracts available at http://easyconferences.eu/fscd2019/invited-speakers/ <http://easyconferences.eu/fscd2019/invited-speakers/> * Beniamino Accattoli (INRIA, Paris, France) https://sites.google.com/site/beniaminoaccattoli/ <https://sites.google.com/site/beniaminoaccattoli/> * Amy Felty (University of Ottawa, Canada) http://www.site.uottawa.ca/~afelty/ <http://www.site.uottawa.ca/~afelty/> * Sarah Winkler (University of Innsbruck, Austria) http://cl-informatik.uibk.ac.at/users/swinkler/ <http://cl-informatik.uibk.ac.at/users/swinkler/> * Hongseok Yang (KAIST, Korea) https://sites.google.com/view/hongseokyang/ <https://sites.google.com/view/hongseokyang/> 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://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> 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, Aarhus U. & U. of Twente F. van Raamsdonk, VU Amsterdam C. Schürmann, ITU Copenhagen P. Severi, U. of Leicester A. Silva, U. College London S. Staton, Oxford U. T. Streicher, TU Darmstadt A. Stump, U. of Iowa N. Tabareau, Inria S. Tison, U. of Lille A. Tiu, Australian National U. T. Tsukada, U. of Tokyo J. Urban, CTU Prague P. Urzyczyn, U. of Warsaw J. Waldmann, Leipzig U. of Applied Sciences 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

LearnAut 2019 first Call for Papers -- LICS 2019 Workshop
by Matteo Sammartino 30 Jan '19

30 Jan '19

Learning and Automata (LearnAut) -- LICS 2019 workshop June 23rd, Vancouver, Canada Website: https://learnaut19.github.io SUBMISSION DEADLINE March 30th Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science, spanning the communities that the Logic in Computer Science (LICS) conference brings together. Historically, there has been little interaction between the GI and LICS communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms. The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods. We invite submissions of recent work, including preliminary research, related to the theme of the workshop. Similarly to how main machine learning conferences and workshops are organized, all accepted abstracts will be part of a poster session held during the workshop. Additionally, the Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop. Topics of interest include (but are not limited to): - Computational complexity of learning problems involving automata and formal languages. - Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars. - Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models. - Logical and relational aspects of learning and grammatical inference. - Theoretical studies of learnable classes of languages/representations. - Relations between automata and recurrent neural networks. - Active learning of finite state machines and formal languages. - Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models. - Applications of learning to formal verification and (statistical) model checking. - Metrics and other error measures between automata or formal languages. ** Invited speakers ** Lise Getoor (UC Santa Cruz) Prakash Panangaden (McGill University) Nils Jansen (Radboud University) (to be confirmed) ** Submission instructions ** Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://ctan.org/tex-archive/macros/latex/contrib/jmlr We do accept submissions of work recently published or currently under review. - Submission url: https://easychair.org/conferences/?conf=learnaut2019 - Submission deadline: March 30th - Notification of acceptance: April 25th - Registration: TBD ** Program Committee ** Dana Angluin (Yale University) Borja Balle (Amazon Research Cambridge) Leonor Becerra-Bonache (Université de Saint-Etienne) François Denis (Aix-Marseille Université) Colin de la Higuera (Nantes University) Falk Howar (TU Clausthal) Ariadna Quattoni (Naver Labs Europe) Alexandra Silva (University College of London) Makoto Kanazawa (Hosei University) Matthias Gallé (Naver Labs Europe) Frits Vaandrager (Radboud University) Alexander Clark (King’s College London) Kousha Etessami (University of Edinburgh) ** Organizers ** Remi Eyraud (Aix-Marseille Université) Tobias Kappé (University College London) Guillaume Rabusseau (Université de Montréal / Mila) Matteo Sammartino (University College London)

1 0

ICALP 2021 - Call for Location
by Anca Muscholl 24 Jan '19

24 Jan '19

CALL FOR LOCATION ICALP 2021 The International Colloquium on Automata, Languages and Programming (ICALP) is the main conference and annual meeting of the EATCS (European Association for Theoretical Computer Science). This international conference was launched in 1972 and covers all aspects of theoretical computer science. ICALP comprises the main, multi-track conference over four days, plus a pre- and a post-workshop day. We invite proposals for locations to host the 48th ICALP, to be held mid July 2021. Previous (and upcoming) ICALP editions include: ICALP 2020 in Beijing (China) ICALP 2019 in Patras (Greece) ICALP 2018 in Prague (Czech Rep.) ICALP 2017 in Warsaw (Poland) ICALP 2016 in Rome (Italy) ICALP 2015 in Kyoto (Japan) For 2021 we particularly encourage proposals in Europe. The deadline for proposals is *** May 1st, 2019 ***. Proposals should be sent to the President of the EATCS and the SC chair (see contact information below). Selected proposals are to be presented at the General Assembly of the EATCS at ICALP 2019. Proposals should address the following points: - name(s) of the Conference Chair(s) and their host institution - proposed location (and possibly venue) - appropriateness of the proposed dates (including possible holidays or other events) - travel information and estimated transportation costs - estimated accommodation and registration costs - conference facilities (session and plenary rooms, workshop rooms) EATCS president: Paul Spirakis (P.Spirakis at liverpool dot ac dot uk) ICALP SC chair: Anca Muscholl (anca at labri dot fr)

1 0

Announcement: 2019 Summer School in Logic and Formal Epistemology (June 3-21)
by Mary Grace Joseph 23 Jan '19

23 Jan '19

1 0

TbiLLC 2019/1st CfP
by Alex Simpson 18 Jan '19

18 Jan '19

The THIRTEENTH INTERNATIONAL TBILISI SYMPOSIUM ON LOGIC, LANGUAGE AND COMPUTATION may be of interest to finite-model theorists. ************************************************************** First Call for Papers THE THIRTEENTH INTERNATIONAL TBILISI SYMPOSIUM ON LOGIC, LANGUAGE AND COMPUTATION 16-20 September, 2019 Batumi, Georgia http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ *********************************************************************** CALL FOR PAPERS The Thirteenth International Tbilisi Symposium on Logic, Language, and Computation will be held 16-20 September 2019 in Batumi, Georgia. The Programme Committee invites submissions for contributions on all aspects of language, logic and computation. Work of an interdisciplinary nature is particularly welcome. Areas of interest include, but are not limited to: * Natural language syntax, semantics, and pragmatics * Linguistic typology and semantic universals * Language evolution and learnability * Historical linguistics, history of logic * Natural logic, inference and entailment in natural language * Logic, games, and formal pragmatics * Logics for artificial intelligence and computer science * Constructive, modal and algebraic logic * Categorical logic * Algorithmic game theory * Computational social choice * Formal models of multiagent systems * Information retrieval, query answer systems * Distributional and probabilistic models of information, meaning and computation * Models of computation Authors can submit an abstract of three pages (including references) at the EasyChair conference system here: https://easychair.org/conferences/?conf=tbillc2019 PROGRAMME The programme will include the following tutorials and a series of invited lecturers. Tutorials: Logic: Graham Leigh (University of Gothenburg) Language: Fabian Bross (University of Stuttgart) Computation: Daniela Petrisan (CNRS, Universit?? Paris Diderot) Invited speakers: Logic Philippe Balbiani (CNRS, Universit?? Toulouse III), Adam Bjorndahl (Carnegie Mellon University) Language Berit Gehrke (HU Berlin), Thomas Ede Zimmermann (University of Frankfurt) Computation Libor Barto (Charles University Prague), Elham Kashefi (CNRS, University of Edinburgh) There will be two workshops (on Language and on Logic and Computation) embedded in the conference programme. More information will be available on the TbiLLC website: http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ Programme Committee Bahareh Afshari (University of Gothenburg) Rusiko Asatiani (Tbilisi State University) Guram Bezhanishvili (New Mexico State University) Nick Bezhanishvili (University of Amsterdam) Valeria de Paiva (Nuance Communications) David Gabelaia (TSU Rasmadze Mathematical Institute) Katharina Hartmann (University of Frankfurt/Main) Jules Hedges (University of Oxford) Daniel Hole (co-chair, University of Stuttgart) Sebastian L??bner (University of D??sseldorf) Matteo Mio (CNRS/ENS-Lyon) Sara Negri (University of Helsinki) Sebastian Pad?? (University of Stuttgart) Alessandra Palmigiano (Technical University of Delft) Roland Pfau (University of Amsterdam) Martin Sch??fer (University of Anglia Ruskin) Lutz Schr??der (University of Erlangen-N??rnberg) Kerstin Schwabe (Leibniz-ZAS Berlin) Alexandra Silva (UC London) Alex Simpson (co-chair, University of Ljubljana) Luca Spada (University of Salerno) Ronnie B. Wilbur (Purdue University) Fan Yang (University of Helsinki) PUBLICATION INFORMATION Post-proceedings of the symposium will be published in the LNCS series of Springer. IMPORTANT DATES Submission deadline: 1 April 2019 Notification: 3 June 2019 Final abstracts due: 1 July 2019 Registration deadline: 1 August 2019 Symposium: 16-20 September 2019 Programme and submission details can be found at: http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ [For admin and other information see: http://www.mta.ca/~cat-dist/ ]

1 0

VerifyThis at ETAPS 2019: 2nd Call for Problems
by VerifyThis 17 Jan '19

17 Jan '19

******************************************************************************* VerifyThis Verification Competition 2019 ACCOUNCEMENT AND CALL FOR PROBLEMS Competition to be held at ETAPS 2019 http://verifythis.ethz.ch ******************************************************************************** Get involved, even if you cannot participate in the competition: provide a challenge! IMPORTANT DATES Problems submission deadline: 28 January 2019 Competition: 6 and 7 April 2019 ABOUT THE COMPETITION VerifyThis 2019 will take place as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019) on 6 and 7 April 2019. It is the 8th event in the VerifyThis competition series. Information on previous events and participants can be found at http://verifythis.ethz.ch The aims of the competition are: - to bring together those interested in formal verification, and to provide an engaging, hands-on, and fun opportunity for discussion - to evaluate the usability of logic-based program verification tools in a controlled experiment that could be easily repeated by others. The competition will offer a number of challenges presented in natural language. Participants have to formalize the requirements, implement a solution, and formally verify the implementation for adherence to the specification. There are no restrictions on the programming language and verification technology used. The correctness properties posed in problems will have the input-output behaviour of programs in focus. Solutions will be judged for correctness, completeness and elegance. CALL FOR PROBLEMS To be able to offer a broad and diverse set of verification challenges, we are collecting submissions of ideas for verification challenges and problems. We welcome both problems of academic interest as well as challenges based on themes that are relevant in industry. We encourage suggestions at any level of detail, including submissions without a fully worked out verification task. - a problem may contain an informal statement of the algorithm to be implemented (optionally with complete or partial pseudocode) and the requirement(s) to be verified - a problem should be solvable, at least in part, within a 60-90 minute time slot - submission of reference solutions is welcome but not mandatory - problems mainly suitable for specific languages or tools should be clearly identified as such - problems that contain several subproblems or other means of difficulty scaling are especially welcome - the organizers reserve the right (but no obligation) to use the problems in the competition, either as submitted or with modifications - submissions from (potential) competition participants are allowed Problems from previous competitions can be seen at http://verifythis.ethz.ch Submissions are to be sent by email to verifythis(a)cs.nuim.ie by the date indicated above. PRIZES The submission most interesting and suitable for the competition will receive a prize. ORGANIZERS * Claire Dross, AdaCore, France * Carlo A. Furia, Universit�� della Svizzera Italiana (USI), Switzerland * Marieke Huisman, University of Twente, the Netherlands * Rosemary Monahan, Maynooth University, Ireland * Peter M��ller, ETH Z��rich, Switzerland CONTACT Email: verifythis(a)cs.nuim.ie Web: http://verifythis.ethz.ch

1 0