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

CfP: DL 2019 (32nd International Workshop on Description Logics)
by Mantas Simkus 22 Feb '19

22 Feb '19

------------------------------------------------------------------------------- CALL FOR PAPERS 32nd International Workshop on Description Logics, DL 2019 June 18th to June 21st, 2019 - Oslo, Norway http://dl2019.ifi.uio.no/home.html ------------------------------------------------------------------------------- The DL workshop is the major annual event of the description logic research community. It is the forum at which those interested in description logics, both from academia and industry, meet to discuss ideas, share information and compare experiences. The 32nd edition will be held in Oslo, Norway from June 18th to June 21st, 2019. Important Dates =============== Paper registration deadline: March 22, 2019 Paper submission deadline: March 29, 2019 Notification of acceptance: May 3, 2019 Camera-ready copies: May 24, 2019 Workshop: June 18-21, 2019 Workshop Scope ============== We invite contributions on all aspects of description logics, including but not limited to: * Foundations of description logics: decidability and complexity of reasoning, expressive power, novel inference problems, inconsistency management, reasoning techniques, and modularity aspects * Extensions of description logics: closed-world and nonmonotonic reasoning, epistemic reasoning, temporal and spatial reasoning, procedural knowledge, query answering, reasoning over dynamic information * Integration of description logics with other formalisms: object-oriented representation languages, database query languages, constraint-based programming, logic programming, and rule-based systems * Applications and use areas of description logics: ontology engineering, ontology languages, databases, ontology-based data access, semi-structured data, graph-structured data, linked data, document management, natural language, learning, planning, Semantic Web, cloud computing, conceptual modeling, web services, business processes * Systems and tools around description logics: reasoners, software tools for and using description logic reasoning (e.g. ontology editors, database schema design, query optimization, and data integration tools), implementation and optimization techniques, benchmarking, evaluation, modeling Invited Speakers ================ * Pablo Barceló, Universidad de Chile, Chile * Meghyn Bienvenu, Université de Bordeaux, France * Gerhard Lakemeyer, RWTH Aachen, Germany Submissions =========== Submissions may be of two types: (1) We invite regular papers of up to 11 pages. If the authors prefer the paper to not appear in the proceedings, an additional 2-page abstract of the paper has to be submitted (the 2-page abstract would appear in the proceedings, in case of acceptance). (2) Papers accepted or under review at some other conference can be submitted to the DL workshop. They should be submitted together with a 2-page abstract that also specifies where the paper has been accepted or is under review. Only the 2-page abstract would appear in the proceedings, in case of acceptance. * The regular papers and the 2-page abstracts must be formatted using the Springer LNCS style. The list of references in these submissions does not count towards the page limit. * DL 2019 allows (but does not require) submissions to be anonymous, i.e. the PC members and the reviewers will not see the identity of authors in the submission system (EasyChair). If you wish to conceal your identity, please don’t forget to omit it from the PDF file you are submitting. * The option to publish a 2-page abstract is designed for authors who wish to announce results that have been published elsewhere, or which the authors intend to submit or have already submitted to a venue with an incompatible prior/concurrent publication policy. * All submissions may optionally include a clearly marked appendix (e.g., with additional proofs or evaluation data). The appendix will be read at the discretion of the reviewers and not included in the proceedings. The appendix does not need to be in LNCS format. * Accepted regular papers and 2-page abstracts will be made available electronically in the CEUR Workshop Proceedings series (http://www.CEUR-ws.org/). * Accepted submissions, be they regular papers or 2-page abstracts, will be selected for either oral or poster presentation at the workshop. Submissions will be judged solely based on their content, and the type of submission will have no bearing on the decision between oral and poster presentation. Submission page: https://easychair.org/conferences/?conf=dl2019 Student Support =============== A limited number of student grants for participating in DL 2019 are available. The grants consist of a fixed amount that can be used to cover travel costs and registration fees. Organization ============ * Martin Giese, University of Oslo, Norway (general co-chair) * Mantas Simkus, TU Wien, Austria (program co-chair) * Arild Waaler, University of Oslo, Norway (general co-chair) * Grant Weddell, University of Waterloo, Canada (program co-chair) Resources ========= * Information about submission, registration, travel information, etc., is available on the DL 2019 homepage: http://dl2019.ifi.uio.no/home.html * The official description logic homepage is at http://dl.kr.org/

1 0

26th WoLLIC 2019 (Utrecht, The Netherlands) - Call for Papers - DEADLINE EXTENDED
by Ruy de Queiroz 20 Feb '19

20 Feb '19

DEADLINE EXTENDED: *Feb 29, 2019*: Paper title and abstract deadline *Mar 7, 2019*: Full paper deadline [Please circulate. Apologies for multiple copies.] CALL FOR PAPERS WoLLIC 2019 26th Workshop on Logic, Language, Information and Computation July 2nd to 5th, 2019 Utrecht, The Netherlands ORGANISATION Utrecht University, Faculty of Humanities, The Netherlands (host university) Centro de Informática, Universidade Federal de Pernambuco, Brazil CALL FOR PAPERS WoLLIC is an annual international forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning. Each meeting includes invited talks and tutorials as well as contributed papers. The twenty-fifth WoLLIC will be held at Utrecht University, The Netherlands, from July 2nd to 5th, 2019. It is sponsored by the Association for Symbolic Logic (ASL), the Interest Group in Pure and Applied Logics (IGPL), the The Association for Logic, Language and Information (FoLLI), the European Association for Theoretical Computer Science (EATCS), ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the Sociedade Brasileira de Lógica (SBL). Just before and after the main WoLLIC 2019 event, Utrecht University will host two satellite workshops: -Proof Theory in Logic on July 1-2, 2019. This workshop on the role of structural proof theory in the study of logics will consist of invited talks by researchers in that area. -Compositionality in formal and distributional models of natural language semantics, on July 6, 2019. The workshop programs will be announced end of December 2018 via the WoLLIC 2019 website (https://wollic2019.sites.uu.nl). Attendance of these satellite workshops is free, but registration is required. PAPER SUBMISSION Contributions are invited on all pertinent subjects, with particular interest in cross-disciplinary topics. Typical but not exclusive areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; proof mining, type theory, effective learnability; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection; foundations of mathematics; philosophy of mathematics; philosophical logic; philosophy of language. Proposed contributions should be in English, and consist of a scholarly exposition accessible to the non-specialist, including motivation, background, and comparison with related works. Articles should be written in the LaTeX format of LNCS by Springer (see authors instructions at http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). They must not exceed 12 pages, with up to 5 additional pages for references and technical appendices. The paper's main results must not be published or submitted for publication in refereed venues, including journals and other scientific meetings. It is expected that each accepted paper be presented at the meeting by one of its authors. (At least one author is required to pay the registration fee before granting that the paper will be published in the proceedings.) Papers must be submitted electronically at the WoLLIC 2019 EasyChair website. (Please go to http://wollic.org/wollic2019/instructions.html for instructions.) A title and single-paragraph abstract should be submitted by Feb 22, 2019, and the full paper by Feb 26, 2019 (firm date). Notifications are expected by April 5, 2019, and final papers for the proceedings will be due by April 15, 2019 (firm date). PROCEEDINGS The proceedings of WoLLIC 2019, including both invited and contributed papers, will be published in advance of the meeting as a volume in Springer's LNCS series. In addition, abstracts will be published in the Conference Report section of the Logic Journal of the IGPL, and selected contributions will be published (after a new round of reviewing) as a special post-conference WoLLIC 2019 issue of a scientific journal (to be confirmed). INVITED SPEAKERS Lev Beklemishev – Steklov Institute Raffaella Bernardi – University of Trento Marta Bilkova – Czech Academy of Sciences Johan Bos – University of Groningen George Metcalfe – University of Bern Reinhard Muskens – University of Tilburg STUDENT GRANTS ASL sponsorship of WoLLIC 2019 will permit ASL student members to apply for a modest travel grant (deadline: May 1st, 2019). See http://www.aslonline.org/studenttravelawards.html for details. IMPORTANT DATES Feb 29, 2019: Paper title and abstract deadline Mar 7, 2019: Full paper deadline April 5, 2019: Author notification Apr 15, 2019: Final version deadline (firm) PROGRAMME COMMITTEE Raffaella Bernardi (University of Trento) Nick Bezhanishvili (University of Amsterdam) Ivano Ciardelli (Ludwig-Maximilians-Universität, Munich) Giuseppe Greco (Utrecht University) Philippe de Groote (INRIA Nancy) Rosalie Iemhoff (Utrecht University) (Co-CHAIR) Roberto Maieli (Department of Mathematics and Physics, University "Roma Tre”) Michael Moortgat (Utrecht University) (Co-CHAIR) Richard Moot (CNRS (LIRMM) & University of Montpellier) Larry Moss (Indiana University Bloomington) Sara Negri (University of Helsinki) Carlo Nicolai (King's College London) Valeria de Paiva (Nuance Comms and University of Birmingham) Alessandra Palmigiano (Delft University of Technology) Ruy de Queiroz (Centro de Informatica, Univ Federal de Pernambuco) Yde Venema (University of Amsterdam) Fan Yang (University of Helsinki) STEERING COMMITTEE Samson Abramsky, Johan van Benthem, Anuj Dawar, Joe Halpern, Wilfrid Hodges, Juliette Kennedy, Ulrich Kohlenbach, Daniel Leivant, Leonid Libkin, Angus Macintyre, Lawrence Moss, Luke Ong, Hiroakira Ono, Valeria de Paiva, Ruy de Queiroz, Jouko Väänänen. (Former Member: Grigori Mints (deceased).) ORGANISING COMMITTEE Giuseppe Greco (Utrecht University, The Netherlands) (Local co-chair) Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brasil) Ruy de Queiroz (Univ Federal de Pernambuco, Brasil) (co-chair) SCIENTIFIC SPONSORSHIP Interest Group in Pure and Applied Logics (IGPL) The Association for Logic, Language and Information (FoLLI) Association for Symbolic Logic (ASL) European Association for Theoretical Computer Science (EATCS) ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC) Sociedade Brasileira de Computação (SBC) Sociedade Brasileira de Lógica (SBL) SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS In remembrance of the 85th anniversary of the award of a doctorate in Mathematics to Paul Erdős (26 March 1913 - 20 September 1996), a renowned Hungarian mathematician considered to be one of the most prolific mathematicians and producers of mathematical conjectures of the 20th century, the program of the meeting will include a screening of George Csicsery's collection of interviews "Erdős 100", a 30-minute video prepared for the centennial celebration in 2013 of Paul Erdős's birth (2018) (tbc). FURTHER INFORMATION Contact one of the Co-Chairs of the Organising Committee. WEB PAGE http://wollic.org/wollic2019/

1 0

WORDS 2019, 2nd call for papers
by Words 2019 20 Feb '19

20 Feb '19

*We apologize if you received this email several times. To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line.* WORDS 2019 12th International Conference Loughborough, September 9–13, 2019 http://words2019.lboro.ac.uk *Announcement* WORDS is a biannual international conference covering the mathematical theory of words (sequences of symbols) from all points of view: combinatorial, algebraic, algorithmic, as well as its applications to biology, linguistics, physics, and others. The previous WORDS conferences have taken place in Rouen (1997, 1999), Palermo (2001), Turku (2003, 2013), Montreal (2005, 2017), Marseille (2007), Salerno (2009), Prague (2011), and Kiel (2015). The 12th International Conference on Words, WORDS 2019 will take place on September 9-13 2019 at Loughborough University, UK (http://www.lboro.ac.uk/departments/compsci/). Co-chairs of this edition are Robert Mercaș and Daniel Reidenbach. *Invited Speakers* Florin Manea (Kiel) Svetlana Puzynina (St. Petersburg) Antonio Restivo (Palermo) Gwenaël Richomme (Montpellier) Aleksi Saarela (Turku) Kristina Vuskovic (Leeds) *Program Committee* Marie-Pierre Béal (Paris) Srecko Brlek (Montreal) Émilie Charlier (Liège) Volker Diekert (Stuttgart) Gabriele Fici (Palermo) Anna Frid (Marseille) Amy Glen (Murdoch) Štěpán Holub (Prague) Shunsuke Inenaga (Kyushu) Robert Mercas (Loughborough) co-chair Dirk Nowotka (Kiel) Jarkko Peltomäki (Turku) Edita Pelantová (Prague) Narad Rampersad (Winnipeg) Daniel Reidenbach (Loughborough) co-chair Jeffrey Shallit (Waterloo) Arseny Shur (Yekaterinburg) *Important dates* Submission deadline: April 12, 2019 Notification to authors: May 20, 2019 Deadline for final versions: June 3, 2019 Conference: September 9–13, 2019 *Submission guidelines* Submitted papers should not exceed 12 pages and be prepared according to the following guidelines and LNCS-style LaTeX2e. All proofs omitted due to space constraints should be given in an appendix or made accessible through a reliable link to a freely available electronic preprint (updated before submission). These will be read at the discretion of the program committee. Only original submission which have not been submitted for publication elsewhere will be considered. Papers should be submitted electronically in PDF through the EasyChair system: https://easychair.org/conferences/?conf=words2019 *More information* are available on the conference website http://words2019.lboro.ac.uk/, where different PDF versions of the conference poster can also be downloaded. *Contact* Words2019(a)lboro.ac.uk The conference is organized by the Department of Computer Science, School of Science, Loughborough University, UK.

1 0

FSCD 2021 - CALL FOR LOCATION (Deadline *** 31st March 2019 ***)
by Sandra Alves 15 Feb '19

15 Feb '19

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2021 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 6th FSCD International Conference to be held during the summer of 2021. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020. Therefore, for 2021, we particularly encourage proposals outside Europe. The deadline for proposals is *** 31st March 2019 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information above). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2019 taking place at Dortmund in June 2019. The final decision about hosting and organising of FSCD 2021 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. National, regional, and local government and industry support, both organizational and financial. Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. Estimated costs on registration for the conference and workshops, both for regular and student participants. Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff. Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Delia Kesner kesner(a)irif.fr <mailto:kesner@irif.fr> FSCD SC Chair

1 0

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