ASPOCP 2023 @ ICLP- First Call for Paper

--00000000000012a56205fa3a7fb5
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D

                                   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



=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D

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 in 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.

 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=3Daspocp2023.

 IMPORTANT DATES

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


PROCEEDINGS

 Authors of all accepted original contributions can opt to publish their
work in 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 (To date)

 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=C3=B6ping University
 Martin Gebser
 Antti Hyv=C3=A4rinen, 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
 Michael Morak, University of Klagenfurt
 Javier Romero, University of Potsdam
 Orkunt Sabuncu, TED University
 Konstantin Schekotihin, Alpen-Adria Universit=C3=A4t 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

--00000000000012a56205fa3a7fb5
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable

<div dir=3D"ltr"><font face=3D"monospace">=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<br><b=
r>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0CALL FOR PAPERS =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0<br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0ASPOCP 2023 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0<br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 16th Workshop on Answer Se=
t Programming and Other Computing Paradigms =C2=A0 =C2=A0 =C2=A0 <br>=C2=A0=
 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0<a href=3D"h=
ttps://sites.google.com/unical.it/aspocp2023/">https://sites.google.com/uni=
cal.it/aspocp2023/</a> =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 <br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 July 9 or July =
10 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 <br><br><br>=C2=A0 =C2=A0 =C2=A0 =
Affiliated with ICLP 2023, 39th International Conference on Logic Programmi=
ng <br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0<a href=3D"https://iclp2023.imperial.ac.uk/home">ht=
tps://iclp2023.imperial.ac.uk/home</a> =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 <br>=C2=A0 =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 July 9 - 15, 2023 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 <=
br><br><br>=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=
=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D=3D<br><br>AIMS AND SCOPE<br><br>=C2=A0=
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 adapt=
ed from SAT. This has been a much studied relationship, and is currently ex=
tended towards satisfiability modulo theories (SMT). The relationship of AS=
P to other computing paradigms, such as constraint satisfaction, quantified=
 Boolean formulas (QBF), Constraint Logic Programming (CLP), first-order lo=
gic (FOL), and FO(ID) is also the subject of active research. Consequently,=
 new methods of computing answer sets are being developed based on relation=
ships to these formalisms.<br>=C2=A0<br>=C2=A0Furthermore, the practical ap=
plications of ASP also foster work on multi-paradigm problem-solving, and i=
n particular language and solver integration. The most prominent examples i=
n this area currently are the integration of ASP with description logics (i=
n the realm of the Semantic Web) and constraint satisfaction (which recentl=
y led to the Constraint Answer Set Programming (CASP) research direction).<=
br><br>=C2=A0A large body of general results regarding ASP is available and=
 several efficient ASP solvers have been implemented. However, there are st=
ill significant challenges in applying ASP to real life applications, and m=
ore interest in relating ASP to other computing paradigms is emerging. This=
 =C2=A0workshop will provide opportunities for researchers to identify thes=
e challenges and to exchange ideas for overcoming them.<br><br>TOPICS<br><b=
r>=C2=A0Topics of interests include (but are not limited to):<br>=C2=A0- AS=
P and classical logic formalisms (SAT/FOL/QBF/SMT/DL).<br>=C2=A0- ASP and c=
onstraint programming.<br>=C2=A0- ASP and other logic programming paradigms=
, e.g., FO(ID).<br>=C2=A0- ASP and other nonmonotonic languages, e.g., acti=
on languages.<br>=C2=A0- ASP and external means of computation.<br>=C2=A0- =
ASP and probabilistic reasoning.<br>=C2=A0- ASP and knowledge compilation.<=
br>=C2=A0- ASP and machine learning.<br>=C2=A0- New methods of computing an=
swer sets using algorithms or systems of other paradigms.<br>=C2=A0- Langua=
ge extensions to ASP.<br>=C2=A0- ASP and multi-agent systems.<br>=C2=A0- AS=
P and multi-context systems.<br>=C2=A0- Modularity and ASP.<br>=C2=A0- ASP =
and argumentation.<br>=C2=A0- Multi-paradigm problem solving involving ASP.=
<br>=C2=A0- Evaluation and comparison of ASP to other paradigms.<br>=C2=A0-=
 ASP and related paradigms in applications.<br>=C2=A0- Hybridizing ASP with=
 procedural approaches.<br>=C2=A0- Enhanced grounding or beyond grounding.<=
br><br><br>SUBMISSIONS<br><br>=C2=A0The workshop invites two types of submi=
ssions:<br>=C2=A0 - original papers describing original research.<br>=C2=A0=
 - non-original paper already published in formal proceedings or journals.<=
br>=C2=A0Original papers must not exceed 13 pages (excluding references) an=
d must be formatted using the 1-column CEURART style available here.<br><br=
>=C2=A0Authors are requested to clearly specify whether their submission is=
 original or not with a footnote on the first page.<br>=C2=A0Authors are in=
vited to submit their manuscripts in PDF via the EasyChair system at the li=
nk: <a href=3D"https://easychair.org/my/conference?conf=3Daspocp2023">https=
://easychair.org/my/conference?conf=3Daspocp2023</a>.<br><br>=C2=A0IMPORTAN=
T DATES<br><br>=C2=A0 Abstract submission deadline: =C2=A0 =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A015 May 2023<br>=C2=A0 Paper submission deadline: =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 22 May 2023<br>=C2=A0 Notification: =C2=A0 =C2=A0 =
=C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A012=
 June 2023<br>=C2=A0 Camera-ready articles due: =C2=A0 =C2=A0 =C2=A0 =C2=A0=
 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=A0 =C2=
=A0 =C2=A0 22 June 2023<br><br><br>PROCEEDINGS<br><br>=C2=A0Authors of all =
accepted original contributions can opt to publish their work in formal pro=
ceedings. <br>=C2=A0Accepted non-original contributions will be given visib=
ility on the conference web site including a link to the original publicati=
on, if already published.<br><br>=C2=A0A selection of extended and revised =
versions of accepted papers could appear in a special issue. <br>=C2=A0Exte=
nded 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>=C2=A0Francesco Pacenza, Department of Mathematics and Computer Sci=
ence, University of Calabria, Italy<br>=C2=A0Zeynep G. Saribatur, Institute=
 of Logic and Computation, TU Wien, Austria<br><br>CONTACTS<br><br>=C2=A0Fo=
r any questions, please contact the workshop co-chairs at aspocp2023_AT_eas=
ychair.org<br><br><br>PROGRAM COMMITTEE (To date)<br><br>=C2=A0Mario Alvian=
o, University of Calabria<br>=C2=A0Marcello Balduccini, Saint Joseph&#39;s =
University<br>=C2=A0Pedro Cabalar, University of Corunna<br>=C2=A0Francesco=
 Cauteruccio, Polytechnic University of Marche<br>=C2=A0Stefania Costantini=
, University of L&#39;Aquila<br>=C2=A0Carmine Dodaro, University of Calabri=
a<br>=C2=A0Stefan Ellmauthaler, TU Dresden<br>=C2=A0Esra Erdem, Sabanci Uni=
versity<br>=C2=A0Cristina Feier<br>=C2=A0Johannes K. Fichte, Link=C3=B6ping=
 University<br>=C2=A0Martin Gebser<br>=C2=A0Antti Hyv=C3=A4rinen, Certora<b=
r>=C2=A0Giovambattista Ianni, University of Calabria<br>=C2=A0Daniela Incle=
zan, Miami University<br>=C2=A0Tomi Janhunen, Tampere University<br>=C2=A0J=
oao Leite, Universidade NOVA de Lisboa<br>=C2=A0Vladimir Lifschitz, The Uni=
versity of Texas at Austin<br>=C2=A0Michael Morak, University of Klagenfurt=
<br>=C2=A0Javier Romero, University of Potsdam<br>=C2=A0Orkunt Sabuncu, TED=
 University<br>=C2=A0Konstantin Schekotihin, Alpen-Adria Universit=C3=A4t K=
lagenfurt<br>=C2=A0Tran Cao Son, New Mexico State University<br>=C2=A0Mirek=
 Truszczynski, University of Kentucky<br>=C2=A0Johannes P. Wallner, TU Graz=
<br>=C2=A0Stefan Woltran, TU Wien<br>=C2=A0Jia-Huai You, University of Albe=
rta<br>=C2=A0Jessica Zangari, University of Calabria</font><br></div>

--00000000000012a56205fa3a7fb5--