[loginf] SOQE 2021: The 2nd Workshop on Second-Order Quantifier Elimination and Related Topics - Extended Deadline

Christoph Wernhard info at christophwernhard.com
Wed Jul 7 12:56:26 CEST 2021


                CALL FOR PAPERS: EXTENDED DEADLINE

                            SOQE 2021
                       KR 2021 WORKSHOP ON
      SECOND-ORDER QUANTIFIER ELIMINATION AND RELATED TOPICS

                             Virtual
                        3-5 November 2021

                      http://2021.soqe.org/

GENERAL INFORMATION

    The Second Workshop on Second-Order Quantifier Elimination
    and Related Topics will be held online on 3-5 November 2021.
    SOQE will be associated with the 18th International
    Conference on Principles of Knowledge Representation and
    Reasoning (KR 2021).

AIMS AND TOPICS

    Second-order quantifier elimination (SOQE) is the problem of
    equivalently reducing a formula with quantifiers upon
    second-order objects such as predicates to a formula in which
    these quantified second-order objects no longer occur. In
    slight variations, SOQE is known as forgetting, projection,
    predicate elimination, and uniform interpolation. It can be
    combined with various underlying logics, including
    propositional, model, description and first-order logics.

    SOQE and its variations bear strong relationships to Craig
    interpolation, definability and computation of definientia,
    the notion of conservative theory extension, abduction and
    notions of weakest sufficient and strongest necessary
    condition, and generalizations of Boolean unification to
    predicate logic. It is attractive as a logic-based approach
    to various computational tasks, for example, the computation
    of circumscription, the computation of modal correspondence
    properties, forgetting in knowledge bases, knowledge-base
    modularization, abductive reasoning and generating
    explanations, the specification of non-monotonic logic
    programming semantics, view-based query processing, and the
    characterization of formula simplifications in reasoner
    preprocessing.

    Topics of interest include, but are not limited to:

    * Abduction
    * Access interpolation
    * Algorithms for SOQE and related tasks
    * Applications of SOQE and related techniques
    * Automation and tools
    * Boolean equation solving / Boolean unification and SOQE
    * Characterizations of formula classes on which SOQE succeeds
    * Circumscription
    * Conservative theory extensions
    * Craig interpolation
    * Definability and computation of definienda
    * Elimination in formula simplifications
    * Elimination methods and calculi for theorem proving
    * Forgetting and projection in answer set programming
    * Forgetting and uniform interpolation
    * Historical aspects of SOQE
    * Ontology modularization and content extraction
    * Query processing and rewriting on the basis of definability
    * Relationships between elimination and decidability
    * Separability and inseparability

    The workshop aims to bring together researchers working on
    SOQE and all these related topics to present, discuss and
    compare issues shared by problems emerging from different
    special contexts, interesting open research problems (perhaps
    with partial solutions), new applications and implementation
    techniques.

SUBMISSION

    We invite submissions of high-quality research on variants of
    SOQE and related topics, including work that describes
    applications, new systems or relevant data releases.
    Submissions will be reviewed by the program committee, which
    will select a balanced program of high-quality contributions.

    Submissions can be one of the following type:

    * Regular paper: up to 11 pages + bibliography
    * Short paper: 5-6 pages + bibliography
    * Abstract of pre-published paper: 1-6 pages + bibliography

    Submissions should be written in English, formatted in the
    style of the Springer Publications format for Lecture Notes
    in Computer Science (LNCS). For details on the LNCS style,
    see Springer's Author Instructions. Papers should be
    submitted electronically via
    https://easychair.org/conferences/?conf=soqe2021

    Regular papers must contain enough substance that they can be
    cited in other publications and may not have appeared before.
    Short papers may not have appeared before.

PROCEEDINGS

    The workshop proceedings will be submitted to CEUR-WS.org for
    online publication in advance of the event.

REGISTRATION

    Details will be announced on the workshop webpage. It is
    expected that submissions are presented at the workshop by
    at least one of the authors.

IMPORTANT DATES

    There will be two submission rounds. The first one is in sync
    with all the KR 2021 Workshops.

    *23 July 2021*     Paper Submission (1st round)
    27 August 2021     Author Notification (1st round)
    9 September 2021   Paper Submission (2nd round)
    7 October 2021     Author Notification (2nd round)
    25 October 2021    Camera-Ready Version due
    3-5 November 2021  SOQE Workshop (1 day)

PROGRAM COMMITTEE

    Philippe Balbiani, Institut de Recherche en Informatique de Toulouse
    Jieying Chen, University of Oslo
    James Delgrande, Simon Fraser University
    Silvio Ghilardi, Università degli Studi di Milano
    Stefan Hetzl, Vienna University of Technology
    Patrick Koopmann, TU Dresden
    Andreas Nonnengart, DFKI
    Vladislav Ryzhikov, Birkbeck, University of London
    Stefan Schlobach, Vrije Universiteit Amsterdam
    Renate Schmidt, The University of Manchester
    Viorica Sofronie-Stokkermans, University Koblenz-Landau
    Andrzej Szałas, University of Warsaw
    Sophie Tourret, Max Planck Institute for Informatics
    Kewen Wang, Griffith University
    Christoph Wernhard, Berlin
    Yizheng Zhao, Nanjing University

PROGRAM COMMITTEE CHAIRS

    Renate A. Schmidt     The University of Manchester, UK
    Christoph Wernhard    Berlin, Germany
    Yizheng Zhao          Nanjing University, China


More information about the loginf mailing list