CALL FOR PAPERS
Symposium
Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)
10 - 17 December 2021, online
https://staff.math.su.se/rloukanova/LACompLing2021-web/
LACompLing2021 is part of the week
Mathematical Linguistics (MALIN) 2021,
Université de Montpellier (UM),
Montpellier, France,
13 - 17 December 2021, Online
DESCRIPTION of LACompLing
Computational linguistics studies natural language in its various
manifestations from a computational point of view, both on the theoretical
level (modeling grammar modules dealing with natural language form and
meaning, and the relation between these two) and on the practical level
(developing applications for language and speech technology). Right from
the start in the 1950s, there have been strong links with computer science,
logic, and many areas of mathematics - one can think of Chomsky's
contributions to the theory of formal languages and automata, or Lambek's
logical modeling of natural language syntax. The symposium assesses the
place of logic, mathematics, and computer science in present day
computational linguistics. It intends to be a forum for presenting new
results as well as work in progress.
SCOPE of LACompLing
The symposium focuses mainly on logical approaches to computational
processing of natural language, and on the applicability of methods and
techniques from the study of artificial languages (programming/logic) in
computational linguistics. We invite participation and submissions from
other relevant approaches too, especially if they can inspire new work and
approaches.
The topics of LACompLing2021 include, but are not limited to:
- Computational theories of human language
- Computational syntax
- Computational semantics
- Computational syntax-semantics interface
- Interfaces between morphology, lexicon, syntax, semantics, speech, text,
pragmatics
- Computational grammar
- Logic and reasoning systems for linguistics
- Type theories for linguistics
- Models of computation and algorithms for linguistics
- Computational approaches of computational linguistics for domain specific
areas
- Language processing
- Parsing algorithms
- Generation of language from semantic representations
- Large-scale grammars of natural languages
- Multilingual processing
- Computational theories and systems of reasoning in natural language
- Data science in language processing
- Machine learning of language
- Interdisciplinary methods
- Integration of formal, computational, model theoretic, graphical,
diagrammatic, statistical, and other related methods
- Logic for information extraction or expression in written and / or spoken
language
- Language theories based on biological fundamentals of information and
languages
- Computational neuroscience of language
LACompLing2021 is especially interested in topics on the interconnections
between Logic, Language, and Argumentation, e.g.:
- Formal languages of reasoning and argumentation
- Algorithms related to natural language of argumentation - theories,
implementations, applications
- Formal models of argumentations
- Logic of preferences
- Beliefs, attitudes, persuasions - theories and applications
IMPORTANT DATES
Submission: 30 October 2021
Notifications: 6 November 2021
Final submissions: TBA ??
LACompLing2021: 13 - 17 December 2021
SUBMISSION INSTRUCTIONS
We welcome submissions of abstracts of presentations of original work. The
intended papers should not be submitted concurrently to another conference
or conference event and should not have been published or submitted for
publication consideration elsewhere.
NOTE: We will not accept submissions that are on work submitted to another
event at MALIN 2021, concurrently during the submission to LACompLing2021.
- Submission of abstracts of presentations:
limited to 1 page, including the title, other heading material, about half
of a page text, and references
- Authors can submit more than one abstract. Invited speakers can submit
invited and contributed abstracts.
- The camera-ready submissions may require all the necessary typesetting
sources, which are not in the standard LaTeX distribution
Typesetting Instructions
For LaTeX, authors are required to use Springer LNCS package. Styles and
templates can be downloaded from Springer, for LaTeX (recommended!) and
Microsoft Word:
https://www.springer.com/gp/computer-science/lncs/conference-proceedings-gu…
For bibliography citations, please use BibTeX with:
\bibliographystyle{spmpsci}
SUBMISSIONS
The submission Web page for LACompLing2021 is:
https://easychair.org/conferences/?conf=lacompling2021
PUBLICATIONS
We will organize a post-conference, special volume after the symposium
LACompLing2021, for publication of extended papers based on accepted
abstracts with presentations at LACompLing2021. The submissions to the
special volume have to be original, unpublished, and not concurrently
submitted elsewhere. They will go through thorough peer reviews.
ORGANIZATION of LACompLing2021
CHAIRS of LACompLing2021
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden
Reinhard Muskens, ILLC, Universiteit van Amsterdam, Amsterdam, The
Netherlands
PROGRAM CHAIRS of LACompLing2021
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden
Richard Moot, LIRMM-CNRS, Montpellier, France
Christian Retoré, Université de Montpellier and LIRMM-CNRS, Montpellier,
France
ORGANISATION of LACompLing2021 at Stockholm University
Peter LeFanu Lumsdaine, Stockholm University, Stockholm, Sweden (local
organiser, publication chair)
Axel Ljungsröm, Stockholm University, Stockholm, Sweden (local organiser,
publication associate)
Roussanka Loukanova, IMI, BAS, Sofia, Bulgaria and Stockholm University,
Stockholm, Sweden (chair)
Contact
LACompLing 2021 <lacompling2021(a)easychair.org>
--------------------------------
CALL FOR PAPERS
Seventh International Conference on
Formal Structures for Computation and Deduction (FSCD 2022)
August 2 - 5, 2022, Haifa, Israel
https://fscd2022.github.io/
In-cooperation with ACM SIGLOG and SIGPLAN
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered.
Abstract: February 8, 2022
Submission: February 11, 2022
Rebuttal: March 29-April 1, 2022
Notification: April 15, 2022
Final version: April 30, 2022
FSCD (http://fscd-conference.org/) 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, semantics and verification in new challenging areas.
The suggested, but not exclusive, list of topics for submission is:
1. Calculi:
- Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.);
- Lambda calculus;
- Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.);
- Proof theory (natural deduction, sequent calculus, proof nets, etc.);
- Type theory and logical frameworks;
- Homotopy type theory;
- Quantum calculi.
2. Methods in Computation and Deduction:
- Type systems (polymorphism, dependent, recursive, intersection, session, etc.);
- Induction, coinduction;
- Matching, unification, completion, orderings;
- Strategies (normalization, completeness, etc.);
- Tree automata;
- Model building and model checking;
- Proof search and theorem proving;
- Constraint solving and decision procedures.
3. Semantics:
- Operational semantics and abstract machines;
- Game Semantics and applications;
- Domain theory and categorical models;
- Quantitative models (timing, probabilities, etc.);
- Quantum computation and emerging models in computation.
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;
- Applications of formal systems in other sciences.
6. Semantics and Verification in new challenging areas:
- Certification;
- Security;
- Blockchain protocols;
- Data Bases;
- Deep learning and machine learning algorithms;
- Planning.
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.
SPECIAL ISSUE
-------------
Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science.
SUBMISSION GUIDELINES
---------------------
The submission site is:
https://easychair.org/conferences/?conf=fscd2022
Submissions must be formatted using the LIPIcs style files (https://submission.dagstuhl.de/series/details/5#author).
Submissions can be made in two categories. Regular research papers are limited to 15 pages, excluding references and appendices. They must present original research which is unpublished and not submitted elsewhere. System descriptions are limited to 15 pages, excluding references. They must present new software tools, or significantly new versions of such tools, in which FSCD topics play an important role. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided.
One author of an accepted paper is expected to present it at the (physical) conference, unless Covid restrictions prevent travel.
BEST PAPER AWARD BY JUNIOR RESEARCHERS
--------------------------------------
The program committee will select 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).
PROGRAM COMMITTEE CHAIR
-----------------------
Amy Felty, University of Ottawa
fscd2022 at easychair.org
PROGRAM COMMITTEE
-----------------
Amal Ahmed, Northeastern University
Thorsten Altenkirch, Nottingham University
Takahito Aoto, Niigata University
Kazuyuki Asada, Tohoku University
Franz Baader, TU Dresden
James Cheney, University of Edinburgh
Agata Ciabattoni, Vienna University of Technology
Horatiu Cirstea, Loria
Nachum Dershowitz, Tel Aviv University
Gilles Dowek, Inria & ENS Paris-Saclay
Carsten Fuhs, Birkbeck, University of London
Hugo Herbelin, Inria & Université de Paris
Patricia Johann, Appalachian State University
Daniel Licata, Wesleyan University
Salvador Lucas, Universitat Politècnica de València
Christopher Lynch, Clarkson University
Ralph Matthes, IRIT, CNRS, TU Toulouse
Paul-André Melliès, CNRS, Université de Paris
Alexandre Miquel, Universidad de la República
Georg Moser, Universität Innsbruck
Daniele Nantes, Universidade de Brasília
Vivek Nigam, Huawei ERC & UFPB
Carlos Olarte, UFRN
Valeria de Paiva, Topos Institute
Giselle Reis, CMU Qatar
Masahiko Sakai, Nagoya University
Renate Schmidt, University of Manchester
Martina Seidl, Johannes Kepler University
Sam Staton, University of Oxford
Christine Tasson, Sorbonne Université
Benoît Valiron, LRI & Université de Paris
Stephanie Weirich, University of Pennsylvania
CONFERENCE CHAIR
----------------
Nachum Dershowitz, Tel Aviv University
WORKSHOP CHAIRS
--------------
Shaull Almagor, Technion
Guillermo A. Pérez, University of Antwerp
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
Jamie Vicary, Oxford University
PUBLICITY CHAIR
---------------
Carsten Fuhs, Birkbeck, University of London
FSCD STEERING COMMITTEE
-----------------------
Zena Ariola, University of Oregon
Alejandro Díaz-Caro, Quilmes University & ICC/CONICET
Carsten Fuhs, Birkbeck, University of London
Herman Geuvers (Chair), Radboud University
Silvia Ghilezan, University of Novi Sad
Stefano Guerrini, Université de Paris 13
Delia Kesner, Université de Paris Diderot Naoki Kobayashi, The University of Tokyo
Luigi Liquori, Inria
Damiano Mazza, Université de Paris 13
Jakob Rehof, TU Dortmund
Jamie Vicary, Oxford University