ASPOCP 2023 @ ICLP- EXTENDED DEADLINE

cfp <[email protected]> Fri, 12 May 2023 10:50:05 +0200
Newsgroups gmane.comp.gnu.prolog.general
Message-ID <[email protected]>
This is a multi-part message in MIME format.
--------------aind0SY8kQgCD5QqHZqqduPS
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit

Please note the extended deadline for ASPOCP 2023 – in response to 
several requests.

Apologies for multiple postings.

==================================================================================== 

*EXTENDED SUBMISSION DEADLINE*

*IMPORTANT DATES*

*Abstract submission deadline: 22 May 2023**
**  Paper submission deadline:                                 29 May 2023**
**Notification:                                              12 June 2023**
**  Camera-ready articles due:                                 22 June 2023*
====================================================================================


====================================================================================

                                    CALL FOR PAPERS
                                      ASPOCP 2023
         16th Workshop on Answer Set Programming and Other Computing 
Paradigms
https://sites.google.com/unical.it/aspocp2023/
                                   July 9 or July 10


       Affiliated with ICLP 2023, 39th International Conference on Logic 
Programming
https://iclp2023.imperial.ac.uk/home
                                   July 9 - 15, 2023


====================================================================================

AIMS AND SCOPE

  Since its introduction in the late 1980s, Answer Set Programming (ASP) 
has been widely applied to various knowledge-intensive tasks and 
combinatorial search problems. ASP was found to be closely related to 
SAT, which led to a new method of computing answer sets using SAT 
solvers and techniques adapted from SAT. This has been a much studied 
relationship, and is currently extended towards satisfiability modulo 
theories (SMT). The relationship of ASP to other computing paradigms, 
such as constraint satisfaction, quantified Boolean formulas (QBF), 
Constraint Logic Programming (CLP), first-order logic (FOL), and FO(ID) 
is also the subject of active research. Consequently, new methods of 
computing answer sets are being developed based on relationships to 
these formalisms.

  Furthermore, the practical applications of ASP also foster work on 
multi-paradigm problem-solving, and in particular language and solver 
integration. The most prominent examples in this area currently are the 
integration of ASP with description logics (in the realm of the Semantic 
Web) and constraint satisfaction (which recently led to the Constraint 
Answer Set Programming (CASP) research direction).

  A large body of general results regarding ASP is available and several 
efficient ASP solvers have been implemented. However, there are still 
significant challenges in applying ASP to real life applications, and 
more interest in relating ASP to other computing paradigms is emerging. 
This  workshop will provide opportunities for researchers to identify 
these challenges and to exchange ideas for overcoming them.

TOPICS

  Topics of interests include (but are not limited to):
  - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).
  - ASP and constraint programming.
  - ASP and other logic programming paradigms, e.g., FO(ID).
  - ASP and other nonmonotonic languages, e.g., action languages.
  - ASP and external means of computation.
  - ASP and probabilistic reasoning.
  - ASP and knowledge compilation.
  - ASP and machine learning.
  - New methods of computing answer sets using algorithms or systems of 
other paradigms.
  - Language extensions to ASP.
  - ASP and multi-agent systems.
  - ASP and multi-context systems.
  - Modularity and ASP.
  - ASP and argumentation.
  - Multi-paradigm problem solving involving ASP.
  - Evaluation and comparison of ASP to other paradigms.
  - ASP and related paradigms in applications.
  - Hybridizing ASP with procedural approaches.
  - Enhanced grounding or beyond grounding.


*SUBMISSIONS*

  The workshop invites two types of submissions:
   - original papers describing original research.
   - non-original paper already published on formal proceedings or journals.
  Original papers must not exceed 13 pages (excluding references) and 
must be formatted using the 1-column CEURART style available here 
<http://ceur-ws.org/Vol-XXX/CEURART.zip>.
  A ready-to-clone overleaf project containing a 1-column CEURART style 
is available here <https://www.overleaf.com/read/ngqdtdgcscjq>.

  Authors are requested to clearly specify whether their submission is 
original or not with a footnote on the first page.
  Authors are invited to submit their manuscripts in PDF via the 
EasyChair system at the link: 
https://easychair.org/my/conference?conf=aspocp2023.

*IMPORTANT DATES*

*Abstract submission deadline: 22 May 2023**
**  Paper submission deadline:                                 29 May 2023**
**Notification:                                              12 June 2023**
**  Camera-ready articles due:                                 22 June 2023*


PROCEEDINGS

  Authors of all accepted original contributions can opt for to publish 
their work on formal proceedings.
  Accepted non-original contributions will be given visibility on the 
conference web site including a link to the original publication, if 
already published.

  A selection of extended and revised versions of accepted papers could 
appear in a special issue.
  Extended versions of accepted non-original contributions, if not 
published in a journal yet, might be included in the issue.


WORKSHOP CO-CHAIRS

  Francesco Pacenza, Department of Mathematics and Computer Science, 
University of Calabria, Italy
  Zeynep G. Saribatur, Institute of Logic and Computation, TU Wien, Austria

CONTACTS

  For any questions, please contact the workshop co-chairs at 
aspocp2023_AT_easychair.org


PROGRAM COMMITTEE

  Mario Alviano, University of Calabria
  Marcello Balduccini, Saint Joseph's University
  Pedro Cabalar, University of Corunna
  Francesco Cauteruccio, Polytechnic University of Marche
  Stefania Costantini, University of L'Aquila
  Carmine Dodaro, University of Calabria
  Stefan Ellmauthaler, TU Dresden
  Esra Erdem, Sabanci University
  Cristina Feier
  Johannes K. Fichte, Linköping University
  Martin Gebser
  Antti Hyvärinen, Certora
  Giovambattista Ianni, University of Calabria
  Daniela Inclezan, Miami University
  Tomi Janhunen, Tampere University
  Joao Leite, Universidade NOVA de Lisboa
  Vladimir Lifschitz, The University of Texas at Austin
  Marco Maratea, University of Calabria
  Michael Morak, University of Klagenfurt
  Javier Romero, University of Potsdam
  Orkunt Sabuncu, TED University
  Konstantin Schekotihin, Alpen-Adria Universität Klagenfurt
  Tran Cao Son, New Mexico State University
  Mirek Truszczynski, University of Kentucky
  Johannes P. Wallner, TU Graz
  Stefan Woltran, TU Wien
  Jia-Huai You, University of Alberta
  Jessica Zangari, University of Calabria

--------------aind0SY8kQgCD5QqHZqqduPS
Content-Type: text/html; charset=UTF-8
Content-Transfer-Encoding: 8bit

<html>
  <head>

    <meta http-equiv="content-type" content="text/html; charset=UTF-8">
  </head>
  <body>
    <p><font face="monospace">Please note the extended deadline for
        ASPOCP 2023 – in response to several requests.<br>
         <br>
        Apologies for multiple postings.</font></p>
    <p><font face="monospace"><font face="monospace">====================================================================================</font>
        <br>
        <b>EXTENDED SUBMISSION DEADLINE</b></font></p>
    <p><font face="monospace"> <b>IMPORTANT DATES</b><br>
        <br>
          <b>Abstract submission deadline:                             
          22 May 2023</b><b><br>
        </b><b>  Paper submission
          deadline:                                 29 May 2023</b><b><br>
        </b><b> 
          Notification:                                              12
          June 2023</b><b><br>
        </b><b>  Camera-ready articles
          due:                                 22 June 2023</b></font><br>
      <font face="monospace"><font face="monospace">====================================================================================</font></font></p>
    <p><font face="monospace"> <br>
====================================================================================<br>
        <br>
                                           CALL FOR
        PAPERS                                  <br>
                                             ASPOCP
        2023                                    <br>
                16th Workshop on Answer Set Programming and Other
        Computing Paradigms       <br>
                           <a
          href="https://sites.google.com/unical.it/aspocp2023/"
          class="moz-txt-link-freetext">https://sites.google.com/unical.it/aspocp2023/</a>                 
         <br>
                                          July 9 or July
        10                                 <br>
        <br>
        <br>
              Affiliated with ICLP 2023, 39th International Conference
        on Logic Programming <br>
                                 <a
          href="https://iclp2023.imperial.ac.uk/home"
          class="moz-txt-link-freetext">https://iclp2023.imperial.ac.uk/home</a>                     
         <br>
                                          July 9 - 15,
        2023                                 <br>
        <br>
        <br>
====================================================================================<br>
        <br>
        AIMS AND SCOPE<br>
        <br>
         Since its introduction in the late 1980s, Answer Set
        Programming (ASP) has been widely applied to various
        knowledge-intensive tasks and combinatorial search problems. ASP
        was found to be closely related to SAT, which led to a new
        method of computing answer sets using SAT solvers and techniques
        adapted from SAT. This has been a much studied relationship, and
        is currently extended towards satisfiability modulo theories
        (SMT). The relationship of ASP to other computing paradigms,
        such as constraint satisfaction, quantified Boolean formulas
        (QBF), Constraint Logic Programming (CLP), first-order logic
        (FOL), and FO(ID) is also the subject of active research.
        Consequently, new methods of computing answer sets are being
        developed based on relationships to these formalisms.<br>
         <br>
         Furthermore, the practical applications of ASP also foster work
        on multi-paradigm problem-solving, and in particular language
        and solver integration. The most prominent examples in this area
        currently are the integration of ASP with description logics (in
        the realm of the Semantic Web) and constraint satisfaction
        (which recently led to the Constraint Answer Set Programming
        (CASP) research direction).<br>
        <br>
         A large body of general results regarding ASP is available and
        several efficient ASP solvers have been implemented. However,
        there are still significant challenges in applying ASP to real
        life applications, and more interest in relating ASP to other
        computing paradigms is emerging. This  workshop will provide
        opportunities for researchers to identify these challenges and
        to exchange ideas for overcoming them.<br>
        <br>
        TOPICS<br>
        <br>
         Topics of interests include (but are not limited to):<br>
         - ASP and classical logic formalisms (SAT/FOL/QBF/SMT/DL).<br>
         - ASP and constraint programming.<br>
         - ASP and other logic programming paradigms, e.g., FO(ID).<br>
         - ASP and other nonmonotonic languages, e.g., action languages.<br>
         - ASP and external means of computation.<br>
         - ASP and probabilistic reasoning.<br>
         - ASP and knowledge compilation.<br>
         - ASP and machine learning.<br>
         - New methods of computing answer sets using algorithms or
        systems of other paradigms.<br>
         - Language extensions to ASP.<br>
         - ASP and multi-agent systems.<br>
         - ASP and multi-context systems.<br>
         - Modularity and ASP.<br>
         - ASP and argumentation.<br>
         - Multi-paradigm problem solving involving ASP.<br>
         - Evaluation and comparison of ASP to other paradigms.<br>
         - ASP and related paradigms in applications.<br>
         - Hybridizing ASP with procedural approaches.<br>
         - Enhanced grounding or beyond grounding.<br>
        <br>
        <br>
        <b>SUBMISSIONS</b><br>
        <br>
         The workshop invites two types of submissions:<br>
          - original papers describing original research.<br>
          - non-original paper already published on formal proceedings
        or journals.<br>
         Original papers must not exceed 13 pages (excluding references)
        and must be formatted using the 1-column CEURART style available
        <a href="http://ceur-ws.org/Vol-XXX/CEURART.zip">here</a>.<br>
         A ready-to-clone overleaf project containing a 1-column CEURART
        style is available <a
          href="https://www.overleaf.com/read/ngqdtdgcscjq">here</a>.<br>
        <br>
         Authors are requested to clearly specify whether their
        submission is original or not with a footnote on the first page.<br>
         Authors are invited to submit their manuscripts in PDF via the
        EasyChair system at the link: <a
          href="https://easychair.org/my/conference?conf=aspocp2023"
          class="moz-txt-link-freetext">https://easychair.org/my/conference?conf=aspocp2023</a>.<br>
        <br>
         <b>IMPORTANT DATES</b><br>
        <br>
          <b>Abstract submission deadline:                             
          22 May 2023</b><b><br>
        </b><b>  Paper submission
          deadline:                                 29 May 2023</b><b><br>
        </b><b> 
          Notification:                                              12
          June 2023</b><b><br>
        </b><b>  Camera-ready articles
          due:                                 22 June 2023</b><br>
        <br>
        <br>
        PROCEEDINGS<br>
        <br>
         Authors of all accepted original contributions can opt for to
        publish their work on formal proceedings. <br>
         Accepted non-original contributions will be given visibility on
        the conference web site including a link to the original
        publication, if already published.<br>
        <br>
         A selection of extended and revised versions of accepted papers
        could appear in a special issue. <br>
         Extended versions of accepted non-original contributions, if
        not published in a journal yet, might be included in the issue.<br>
        <br>
        <br>
        WORKSHOP CO-CHAIRS<br>
        <br>
         Francesco Pacenza, Department of Mathematics and Computer
        Science, University of Calabria, Italy<br>
         Zeynep G. Saribatur, Institute of Logic and Computation, TU
        Wien, Austria<br>
        <br>
        CONTACTS<br>
        <br>
         For any questions, please contact the workshop co-chairs at
        aspocp2023_AT_easychair.org<br>
        <br>
        <br>
        PROGRAM COMMITTEE<br>
        <br>
         Mario Alviano, University of Calabria<br>
         Marcello Balduccini, Saint Joseph's University<br>
         Pedro Cabalar, University of Corunna<br>
         Francesco Cauteruccio, Polytechnic University of Marche<br>
         Stefania Costantini, University of L'Aquila<br>
         Carmine Dodaro, University of Calabria<br>
         Stefan Ellmauthaler, TU Dresden<br>
         Esra Erdem, Sabanci University<br>
         Cristina Feier<br>
         Johannes K. Fichte, Linköping University<br>
         Martin Gebser<br>
         Antti Hyvärinen, Certora<br>
         Giovambattista Ianni, University of Calabria<br>
         Daniela Inclezan, Miami University<br>
         Tomi Janhunen, Tampere University<br>
         Joao Leite, Universidade NOVA de Lisboa<br>
         Vladimir Lifschitz, The University of Texas at Austin<br>
         Marco Maratea, University of Calabria<br>
         Michael Morak, University of Klagenfurt<br>
         Javier Romero, University of Potsdam<br>
         Orkunt Sabuncu, TED University<br>
         Konstantin Schekotihin, Alpen-Adria Universität Klagenfurt<br>
         Tran Cao Son, New Mexico State University<br>
         Mirek Truszczynski, University of Kentucky<br>
         Johannes P. Wallner, TU Graz<br>
         Stefan Woltran, TU Wien<br>
         Jia-Huai You, University of Alberta<br>
         Jessica Zangari, University of Calabria<br>
      </font></p>
    <p></p>
  </body>
</html>

--------------aind0SY8kQgCD5QqHZqqduPS--