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

Deadline Extension: Learning and Automata (LearnAut) 2019 -- LICS 2019 Workshop

by Matteo Sammartino

SUBMISSION DEADLINE EXTENDED to April 6th Learning and Automata (LearnAut) -- LICS 2019 workshop June 23rd - Vancouver, Canada Website: https://learnaut19.github.io 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. Note that participation to the poster session is on a voluntary basis for papers selected for oral presentation. High-quality submissions will be strongly encouraged to submit an extended version to an upcoming special issue of the Machine Learning Journal (https://grammarlearning.org/mlj-gi-special-issue). 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) Dana Fisman (Ben-Gurion University) ** 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: April 6th - Notification of acceptance: April 25th - Early registration: April 22nd ** Program Committee ** Dana Angluin (Yale University) Borja Balle (Amazon Research Cambridge) Leonor Becerra-Bonache (Université de Saint-Etienne) Alexander Clark (King’s College London) François Denis (Aix-Marseille Université) Kousha Etessami (University of Edinburgh) Matthias Gallé (Naver Labs Europe) Colin de la Higuera (Nantes University) Falk Howar (TU Clausthal) Makoto Kanazawa (Hosei University) Ariadna Quattoni (Naver Labs Europe) Alexandra Silva (University College London) Frits Vaandrager (Radboud University) ** Organizers ** Remi Eyraud (Aix-Marseille Université) Tobias Kappé (University College London) Guillaume Rabusseau (Université de Montréal / Mila) Matteo Sammartino (University College London)

5 years, 6 months

1
0
0 0

TbiLLC2019: Final call for papers (extended deadline)

by Alex Simpson

This conference, which includes talks on logic and computation, will be of interest to some finite model theorists. Further attractions are the location and the famed Georgian hospitality. The deadline for the submission of three-page abstracts has been extended by two weeks to 15th April. --- 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 - EXTENDED DEADLINE (new deadline 15 April 2019) The Thirteenth International Tbilisi Symposium on Logic, Language, and Computation will be held 16-20 September 2019 in Castello Mare Hotel in Tsikhisdziri near Batumi, Georgia. The Programme Committee invites submissions for contributions on all aspects of logic, language, 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 Submissions must be original, unpublished work 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) WORKSHOPS There will be two workshops: "Syntax, Semantics, and Pragmatics of Aspect Across Modalities (SSPAM)" Organizers: Berit Gehrke (HU Berlin) and Fabian Bross (University Stuttgart) For more details see the workshop webpage https://sites.google.com/view/sspam2019/call-for-papers and "Topology and Modal Logic" Organizer: Adam Bjorndahl (Carnegie Mellon University) Speakers: Tamar Lando (Columbia University), Aybüke Özgün (ILLC, University of Amsterdam), Others to be confirmed. 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: 15 April 2019 (Extended!) Notification: 3 June 2019 Final abstracts due: 1 July 2019 Early registration deadline: 31 July 2019 Late registration deadline: 31 August 2019 Symposium: 16-20 September 2019 Programme and submission details can be found at: http://events.illc.uva.nl/Tbilisi/Tbilisi2019/ LOCATION Castello Mare Hotel & Wellness Resort - Tsikhisdziri, Batumi, Georgia http://castellomare.com Information about getting to the conference site will be made available on the TbiLLC website.

5 years, 6 months

1
0
0 0

CiE 2019 CALL FOR INFORMAL PRESENTATIONS

by Gianluca Della Vedova

======================================== CiE 2019 CALL FOR INFORMAL PRESENTATIONS: ========================================= CiE 2019: Computing with Foresight and Industry Durham, United Kingdom July 15 - July 19, 2019 https://community.dur.ac.uk/cie.2019/ https://www.acie.eu <http://www.computability.org.uk/> IMPORTANT DATES: ============================ Deadline for informal presentations submission: 1 May 2019 (The notifications of acceptance for informal presentations will be sent a few days after submission.) Early registration before: 17 May 2019 CiE 2019 is the 15th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world. Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017) and Kiel (2018). TUTORIAL SPEAKERS: ================== - Markus Holzer (JLU Giessen) - Assia Mahboubi (University of Nantes) INVITED SPEAKERS: ================= - Felipe Cucker (City University of Hong Kong) - Ursula Martin (University of Oxford) - Alexander Schönhuth (CWI, Amsterdam) - Sonja Smets (University of Amsterdam) - Linda Brown Westrick (Penn State) HOSTED BY: ============= Algorithms and Complexity in Durham (ACiD), a research group in the Department of Computer Science, Durham University For questions please contact the organisers at the e-mail address cie.2019(a)durham.ac.uk. SPECIAL SESSIONS: ================= Computational Neuroscience, organised by Noura Al Moubayed (Durham University) and Jason Connolly (Durham University) - Ulrik Beierholm (Durham University) - Netta Cohen (Leeds University) - Evelyne Sernagor (Newcastle University) - V Anne Smith (University of St Andrews) History and Philosophy of Computing, organised by the Council of the HaPoC Commission - Tony Hoare (University of Oxford, via Skype) - Michael Jackson (Open University) - Ray Turner (University of Essex) Lowness Notions in Computability, organised by Johanna Franklin (Hofstra University) and Joseph S. Miller (University of Wisconsin-Madison) - Kenshi Miyabe (Meiji University) - Benoit Monin (LACL, Créteil University) - Keng Meng Ng (Nanyang Technological University) - Don Stull (LORIA) Probabilistic Programming and Higher-Order Computation, organised by Christine Tasson (Paris Diderot University) - Thomas Ehrhard (IRIF, Paris Diderot University) - Cameron Freer (MIT) - Joost-Pieter Katoen (RWTH Aachen) - Sam Staton (University of Oxford) Smoothed and Probabilistic Analysis of Algorithms, organised by Bodo Manthey (University of Twente) - Sophie Huiberts (CWI, Amsterdam) - Stefan Klootwijk (University of Twente) - Clemens Rösner (University of Bonn) - Sebastian Wild (University of Waterloo) Transfinite Computations, organised by Sabrina Ouazzani (LIX, École Polytechnique) - Merlin Carl (University of Konstanz) - Lorenzo Galeotti (University of Hamburg) - Benjamin Rin (Utrecht University) - Philip Welch (University of Bristol) CONTRIBUTED PAPERS: =================== The list of accepted papers can be found at https://community.dur.ac.uk/cie.2019/. INFORMAL PRESENTATIONS: ======================= Continuing the tradition of past CiE conferences, we invite researchers to present informal presentations of their recent work. A proposal for an informal presentation must be submitted via EasyChair (https://easychair.org/conferences/?conf=cie2019), using the LNCS style file (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…) and be 1 page; a brief description of the results suffices and an abstract is not required. Informal presentations will not be published in the LNCS conference proceedings. Results presented as informal presentations at CiE 2019 may appear or may have appeared in other conferences with formal proceedings and/or in journals. WOMEN IN COMPUTABILITY: ======================= We are very happy to announce that within the framework of the Women in Computability programme, sponsored by ACM-Women, we are able to offer four grants of up to 250 EUR for junior female researchers who want to participate in CiE 2019. Applications for this grant should be sent to Liesbeth De Mol, liesbeth.demol(a)univ-lille3.fr, before 15 May 2019 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior female researchers who are presenting a paper (including informal presentations) at CiE 2019. HaPoc Travel Grants ====================== The HaPoc Council offers two HaPoC travel grants of 250USD each to support participation in the conference. To be eligible for a grant, an accepted paper or informal presentation in the area of history and/or philosophy of computing is required. Applications for these grants must be made to HaPoC directly, see hapoc.org/node/284 for further details. ASL Travel Grants ====================== Students, who are members of the Association for Symbolic Logic, may apply for (limited) ASL travel funds that the ASL is making available for sponsored meetings. See aslonline.org/meetings/student-travel-awards/. Association CiE: https://www.acie.eu <http://www.computability.org.uk/> CiE Conference Series: http://www.computability.org.uk/index.php/cie-conference-series/

5 years, 6 months

1
0
0 0

Caleidoscope Complexity School: 2nd Call for Participation and Application to Financial Support

by Damiano Mazza

*** Call for participation*** Caleidoscope: Research School in Computational Complexity Institut Henri Poincaré, Paris, 17-21 June 2019 http://caleidoscope.sciencesconf.org/ Dear all, This is the second announcement for the Caleidoscope Research School in Computational Complexity, to take place at the Institut Henri Poincaré, Paris 17-21 June 2019. The school is aimed at graduate students and researchers who already work in some aspects of computational complexity and/or who would like to learn about the various approaches. *Important news:* - the registration deadline is set to *19 May 2019*; - we are now accepting applications for *financial support* for participants (see below for the details). DESCRIPTION Computational complexity theory was born more than 50 years ago when researchers started asking themselves what could be computed efficiently. Classifying problems/functions with respect to the amount of resources (e.g. time and/or space) needed to solve/compute them turned out to be an extremely difficult question. This has led researchers to develop a remarkable variety of approaches, employing different mathematical methods and theories. The future development of complexity theory will require a subtle understanding of the similarities, differences and limitations of the many current approaches. In fact, even though these study the same phenomenon, they are developed today within disjoint communities, with little or no communication between them (algorithms, logic, programming theory, algebra...). This dispersion is unfortunate since it hinders the development of hybrid methods and more generally the advancement of computational complexity as a whole. The goal (and peculiarity) of the Caleidoscope school is to reunite in a single event as many different takes on computational complexity as can reasonably be fit in one week. It is intended for graduate students as well as established researchers who wish to learn more about neighbouring areas. LECTURES 1. Boolean circuits and lower bounds. (Rahul Santhanam, University of Oxford) 2. Algebraic circuits and geometric complexity. (Peter Bürgisser, Technical University Berlin) 3. Proof complexity and bounded arithmetic. (Sam Buss, University of California San Diego) 4. Machine-free complexity (descriptive and implicit complexity). (Anuj Dawar, University of Cambridge and Ugo Dal Lago, University of Bologna) In addition to these broad-ranging themes, there will also be three more focussed topics, providing examples of (already established or potential) interactions between logic, algebra and complexity: 5. Constraint satisfaction problems. (Libor Barto, Charles University in Prague) 6. Communication complexity. (Sophie Laplante, Paris 7 University) 7. Duality in formal languages and logic. (Daniela Petrisan, Paris 7 University) REGISTRATION Registration to the school is free but mandatory. This is to help us plan tea/coffee breaks and social activities. https://caleidoscope.sciencesconf.org/registration/index The deadline for registration is *19 May 2019*. FINANCIAL SUPPORT Financial support is available for participants. You may apply by filling in the following online form: http://tiny.cc/0oi33y Please send your application no later than *14 April 2019* to maximize your chances of being considered. (Our funds being limited, we apologize in advance if your support request will only be met partially or declined). Also note that *student* members of the ASL (Association for Symbolic Logic) may apply for travel support (not lodging!) by contacting directly ASL and mentioning attendance to Caleidoscope (which is sponsored by ASL). SPONSORS Funding sponsors: DIM RFSI - Région Île-de-France (https://dim-rfsi.fr/) Agence Nationale de la Recherche (http://www.agence-nationale-recherche.fr/) CNRS (http://www.cnrs.fr/en) SIGLOG (https://siglog.hosting.acm.org/) The European Commission (https://ec.europa.eu/commission/index_en) Université Paris 13 (https://www.univ-paris13.fr/) Laboratoire d'Informatique de Paris Nord (https://lipn.univ-paris13.fr/) Association for Symbolic Logic (http://aslonline.org/) Other sponsors: European Association for Computer Science Logic (http://www.eacsl.org/) Société Mathématique de France (https://smf.emath.fr/)

5 years, 6 months

1
0
0 0

ESSLLI 2020: Call for Course and Workshop Proposals

by Kontinen, Juha A

Call for Course and Workshop Proposals 32nd European Summer School in Logic, Language and Information - ESSLLI 2020 3-14 August, 2020, Utrecht, The Netherlands https://www.esslli.eu<https://www.esslli.eu/> IMPORTANT DATES 1 June 2019: Proposal submission deadline 14 September 2019: Notification SUBMISSION PORTAL Please submit your proposals here: https://easychair.org/conferences/?conf=esslli20 Under the auspices of FoLLI the European Summer School in Logic, Language, and Information (ESSLLI) is organized every year in a different European country. It takes place over two weeks in the European Summer, hosts approximately 50 different courses at both the introductory and advanced levels, attracting around 400 participants each year from all the world. The main focus of the program of the summer schools is the interface between linguistics, logic and computation, with special emphasis in human linguistic and cognitive ability. Courses, both introductory and advanced, cover a wide variety of topics within the combined areas of interest: Logic and Computation, Computation and Language, and Language and Logic. Workshops are also organized, providing opportunities for in-depth discussion of issues at the forefront of research, as well as a series of invited lectures. TOPICS AND FORMAT Proposals for courses and workshops at ESSLLI 2020 are invited in all areas of Logic, Linguistics and Computer Sciences. Cross-disciplinary and innovative topics are particularly encouraged. Each course and workshop will consist of five 90 minute sessions, offered daily (Monday-Friday) in a single week. Proposals for two-week courses should be structured and submitted as two independent one-week courses, e.g. as an introductory course followed by an advanced one. In such cases, the ESSLLI programme committee reserves the right to accept just one of the two proposals. All instructional and organizational work at ESSLLI is performed completely on a voluntary basis, so as to keep participation fees to a minimum. However, organizers and instructors have their registration fees waived, and are reimbursed for travel and accommodation expenses up to a level to be determined and communicated with the proposal notification. ESSLLI can only guarantee reimbursement for at most one course/workshop organizer, and can not guarantee full reimbursement of travel costs for lecturers or organizers from outside of Europe. The ESSLLI organizers would appreciate any help in controlling the School's expenses by seeking complete coverage of travel and accommodation expenses from other sources. The organizers want to point at the possibility of an EACSL sponsorship, mentioned at the end of this call. CATEGORIES Each proposal should fall under one of the following categories. * FOUNDATIONAL COURSES * Such courses are designed to present the basics of a research area, to people with no prior knowledge in that area. They should be of elementary level, without prerequisites in the course's topic, though possibly assuming a level of general scientific maturity in the relevant discipline. They should enable researchers from related disciplines to develop a level of comfort with the fundamental concepts and techniques of the course's topic, thereby contributing to the interdisciplinary nature of our research community. * INTRODUCTORY COURSES * Introductory courses are central to ESSLLI's mission. They are intended to introduce a research field to students, young researchers, and other non-specialists, and to foster a sound understanding of its basic methods and techniques. Such courses should enable researchers from related disciplines to develop some comfort and competence in the topic considered. Introductory courses in a cross-disciplinary area may presuppose general knowledge of the related disciplines. * ADVANCED COURSES * Advanced courses are targeted primarily to graduate students who wish to acquire a level of comfort and understanding in the current research of a field. * WORKSHOPS * Workshops focus on specialized topics, usually of current interest. Workshop organizers are responsible for soliciting papers and selecting the workshop programme. They are also responsible for publishing proceedings if they decide to have proceedings. PROPOSAL GUIDELINES Course and workshop proposals should closely follow these guidelines to ensure full consideration. Course and Workshop proposals can be submitted by no more than two lecturers/organizers and they are presented by no more than these two lecturers/organizers. All instructors and organizers must possess a PhD or equivalent degree by the submission deadline. Course proposals should mention explicitly the intended course category. Proposals for introductory courses should indicate the intended level, for example as it relates to standard textbooks and monographs in the area. Proposals for advanced courses should specify the prerequisites in detail. Proposals must be submitted in PDF format via: https://easychair.org/conferences/?conf=esslli2020 and include all of the following: a. Personal information for each proposer: Name, affiliation, contact address, email, homepage (optional) b. General proposal information: Title, category c. Contents information: Abstract of up to 150 words Motivation and description (up to two pages) Tentative outline Expected level and prerequisites Appropriate references (e.g. textbooks, monographs, proceedings, surveys) d. Practical information: Relevant preceding meetings and events, if applicable Potential external funding for participants EACSL SPONSORSHIP The EACSL offers to act as a sponsor for one course or workshop in the areas of Logic and Computation covered by the Computer Science Logic (CSL) conferences. This course or workshop will be designated an EACSL course/workshop. If you wish to be considered for this, please indicate so on your proposal. PROGRAMME COMMITTEE Chair: Raffaella Bernardi (University of Trento) Local Co-chair: Michael Moortgat (University of Utrecht) Area Chairs: Language and Computation (LaCo): Stella Frank (Center for Language Evolution, University of Edinburgh) Laura Rimell (DeepMind) Bonnie Webber (School of Informatics, University of Edinburgh) Language and Logic (LaLo): Salvador Mascarenhas (Ecole Normale Supérieure) Anna Szabolcsi (New York University) Igor Yanovich (Tübingen University) Logic and Computation (LoCo): Rajeev Goré, The Australian National University Juha Kontinen, University of Helsinki Magdalena Ortiz, TU Wien Please send any queries to esslli20pc(a)gmail.com<mailto:esslli20pc@gmail.com>

5 years, 6 months

1
0
0 0

PhD student position in theory and applications of dependence logic, Helsinki (Finland)

by Yang, Fan

The Department of Mathematics and Statistics at the University of Helsinki invites applications for a doctoral student position in Theory and Applications of Dependence Logic for a fixed-term of three years (with a possibility of extension if further funding can be obtained later). The starting date of the full-time position is September 1, 2019, or earlier by agreement. The salary of the position is determined according to the salary system of Finnish universities. The starting salary will be 2200–2700 euros/month, depending on the appointee’s qualifications and experience. ***Application deadline*** 27 April 2019 ***Project description*** The doctoral student will work within the three-year research project on “Logical analysis of no-go theorems in social choice and quantum foundations” funded by the University of Helsinki. The principal investigator of the project is Dr. Fan Yang. This multidisciplinary project aims to apply the methodology of dependence logic to develop formal connections between no-go theorems in social choice theory (such as Arrow’s Theorem) and in quantum foundations (such as Bell’s Theorem). The project will also address relevant open problems in the theory of dependence logic, especially the axiomatization problem. Read more about the project on the homepage of Dr. Fan Yang: https://sites.google.com/site/fanyanghp/ and about dependence logic on Stanford Encyclopedia of Philosophy: https://plato.stanford.edu/entries/logic-dependence/. This research is embedded in the Helsinki Logic Group. For more information about the Group, please visit: https://wiki.helsinki.fi/display/Logic/Home. ***Qualifications*** Applicants are expected to hold a Master’s degree in mathematics, computer science, philosophy or some other relevant subject by the time of the start date. An ideal candidate should have a strong background in mathematical logic, and a keen interest in interdisciplinary research. For more information and details on how to apply, see https://www.helsinki.fi/en/open-positions/doctoral-student-theory-and-appli… or contact Dr. Fan Yang at fan.yang(a)helsinki.fi.

5 years, 6 months

1
0
0 0

Multiple postdoc openings in Algorithmic Verification at MPI-SWS

by Joël Ouaknine

The Foundations of Algorithmic Verification group at the Max Planck Institute for Software Systems in Saarbruecken, Germany, headed by Joel Ouaknine, has several open postdoc positions in the area of algorithmic verification and analysis of dynamical systems. The overall goal of the project is to develop techniques to solve fundamental computational problems arising in the verification of discrete and continuous linear dynamical systems, including Markov chains, linear recurrence sequences, linear while loops, linear differential equations, hybrid systems, and infinite-state systems. You will develop algorithms to solve reachability, termination, and synthesis problems for these models by combining a range of computational techniques, including results from number theory (particularly lower bounds in Diophantine approximation). In cases where algorithms cannot be obtained, you will seek reductions from known "hard" problems. The project aims to build on, and significantly develop, recent progress at MPI-SWS and Oxford in solving long-standing open problems in this area. You should have a PhD (or be close to completion) in a relevant area of computer science, mathematics, or a related discipline, together with a documented track record of the ability to conduct and complete research projects in automated verification, automata theory, dynamical systems, or algorithmic algebra and number theory. To apply, please send CV and short statement of purpose to Joel Ouaknine <joel(a)mpi-sws.org>, with Annika Meiser <ameiser(a)mpi-sws.org> in cc, before the closing date of ***22 April 2019***. Informal inquiries of course very welcome. -- *Joël Ouaknine* Max Planck Institute for Software Systems, Saarland Informatics Campus, Germany Department of Computer Science, Oxford University, UK http://mpi-sws.org/~joel/ <http://people.mpi-sws.org/~joel/>

5 years, 6 months

1
0
0 0

Call for Nominations: VCLA INTERNATIONAL STUDENT AWARDS 2019 w/ Extended submission deadline: 25.3.2019

by Mihaela Rozman

(Extended Deadline) 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 annually awarded VCLA International Student Awards for Outstanding Master and Undergraduate Research Theses, which recognize authors of scientific works covering a very wide range of topics on the spectrum of Logic, and Computer Science. Extended submission deadline: 25.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 endorsement letter may be submitted to the award committee after the deadline for the submission of nominations has passed. *The full thesis IMPORTANT DATES *Extended submission deadline: March 25, 2019 (AoE) *Notification of decision: end of June 2019 *Award ceremony: September 2019, Vienna (Austria) AWARD COMMITTEE 2019 Ezio Bartocci Wolfgang Dvořák Ekaterina Fokina <https://www.ac.tuwien.ac.at/people/rganian/> Robert Ganian (committee co-chair) Maximilian Jaroschek Roman Kuznets Martin Lackner Bjoern Lellmann <http://www.kr.tuwien.ac.at/staff/ortiz/> Magdalena Ortiz (general chair) Matteo Pascucci <https://www.logic.at/staffpages/revantha> Revantha Ramanayake (committee co-chair) Christoph Redl Peter Schüller Sebastian Skritek Friedrich Slivovsky Bhore Sujoy Johannes Wallner Antonius Weinzierl 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/ award(a)logic-cs.at

5 years, 6 months

1
0
0 0

CfP: DL 2019 (32nd International Workshop on Description Logics)

by Mantas Simkus

------------------------------------------------------------------------------- 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/

5 years, 7 months

1
0
0 0

Learning and Automata (LearnAut) 2019 Second Call for Papers -- LICS 2019 Workshop

by Matteo Sammartino

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. Note that participation to the poster session is on a voluntary basis for papers selected for oral presentation. High-quality submissions will be strongly encouraged to submit an extended version to an upcoming special issue of the Machine Learning Journal. 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) Dana Fisman (Ben-Gurion University) ** 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) Alexander Clark (King’s College London) François Denis (Aix-Marseille Université) Kousha Etessami (University of Edinburgh) Dana Fisman (Ben-Gurion University) Matthias Gallé (Naver Labs Europe) Colin de la Higuera (Nantes University) Falk Howar (TU Clausthal) Makoto Kanazawa (Hosei University) Ariadna Quattoni (Naver Labs Europe) Alexandra Silva (University College London) Frits Vaandrager (Radboud University) ** Organizers ** Remi Eyraud (Aix-Marseille Université) Tobias Kappé (University College London) Guillaume Rabusseau (Université de Montréal / Mila) Matteo Sammartino (University College London)

5 years, 7 months

1
0
0 0

2024

2023

2022

2021

2020

2019

2018

finite-model-theory March 2019