<!DOCTYPE html>
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<p
style="color: rgb(34, 34, 34); font-family: Arial, Helvetica, sans-serif; font-size: small; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; text-indent: 0px; text-transform: none; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; white-space: normal; background-color: rgb(255, 255, 255); text-decoration-thickness: initial; text-decoration-style: initial; text-decoration-color: initial;"><span
style="font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; word-spacing: 0px; white-space: normal; background-color: rgb(255, 255, 255); text-decoration-style: initial; text-decoration-color: initial; color: rgba(0, 0, 0, 0.87); font-family: Roboto, RobotoDraft, Helvetica, Arial, sans-serif; font-size: 14px;">[Apologies
for cross-posting]</span><font
style="color: rgb(34, 34, 34); font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; word-spacing: 0px; white-space: normal; background-color: rgb(255, 255, 255); text-decoration-style: initial; text-decoration-color: initial;"
face="monospace"><br>
==============================<wbr>==============================<wbr>========================<br>
<br>
CALL FOR PAPERS
<br>
<span>ASPOCP</span><span> </span>2024
<br>
17th Workshop on Answer Set Programming and Other
Computing Paradigms <br>
<a
href="https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fsites.google.com%2Funical.it%2Faspocp2024%2F&data=05%7C02%7C%7Cd24cf98869a54c7d623f08dc9b4af8fd%7Ccc7df24760ce4a0f9d75704cf60efc64%7C0%7C0%7C638555994695251595%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C20000%7C%7C%7C&sdata=QaExdlpaDJQj%2F3pGxlOGm8oPvurjPBeyCns0Unafx10%3D&reserved=0" originalSrc="https://sites.google.com/unical.it/aspocp2024/" shash="MRXDMFtMShUe+0RNyhfkfySILIRlQRuSYb7Dt70sWggQOVCl4z0hrS9kuyMOM/Rtpq8QyL8VJ02gBTnXWMkibj3JOF8wgYhABf50Ozfh99Iy2MwtVG6wdWpxxrzPj1AEqOfsjQMpWZmidK1mM+SqBsCVoWYj3b/Up5X5AllyerQ="
target="_blank"
data-saferedirecturl="https://www.google.com/url?q=https://sites.google.com/unical.it/aspocp2024/&source=gmail&ust=1720088659910000&usg=AOvVaw0lN9wiFTeIZtZW0SNsvMYl"
style="color: rgb(17, 85, 204);" moz-do-not-send="true">https://sites.google.com/<wbr>unical.it/aspocp2024/</a><span><span> </span></span>
<br>
October 12 or October 13
<br>
<br>
<br>
Affiliated with ICLP 2024, 40th International Conference
on Logic Programming<br>
<span> </span><a
href="https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.iclp24.utdallas.edu%2F&data=05%7C02%7C%7Cd24cf98869a54c7d623f08dc9b4af8fd%7Ccc7df24760ce4a0f9d75704cf60efc64%7C0%7C0%7C638555994695251595%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C20000%7C%7C%7C&sdata=lMimUt%2Bw9dw6RKgL2T1wXmwTcd0KFe%2BF8nl2cw6K4Os%3D&reserved=0" originalSrc="https://www.iclp24.utdallas.edu/" shash="WANzpKiupOG83vfckQk86xTd0sKlXRXGuQGwHXR7uOR/7Ilv0JSoFw+jZraw0KeYqrBqJlp9/ecWj6xIpKTwjbkKMSYKfZMlsCV/ehye6ukJxAxqL6unSIr6PihKjLzYAejisSDneY7Wz3Mqx5EYwRI4Bf1tdeboLXJ6Y9PSVWg=" target="_blank"
data-saferedirecturl="https://www.google.com/url?q=https://www.iclp24.utdallas.edu/&source=gmail&ust=1720088659910000&usg=AOvVaw05zaN3SzDO5uVO6mQj_OHg"
style="color: rgb(17, 85, 204);" moz-do-not-send="true">https://www.iclp24.utdallas.<wbr>edu/</a><span><span> </span></span>
<br>
October 11 - 17, 2024
<br>
<br>
<br>
==============================<wbr>==============================<wbr>========================<br>
<br>
AIMS AND SCOPE<br>
<br>
Since its introduction in the late 1980s, Answer Set
Programming (<span>ASP</span>) has been widely applied to
various knowledge-intensive tasks and combinatorial search
problems.<span> </span><span>ASP</span><span> </span>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<span> </span><span>ASP</span><span> </span>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<span> </span><span>ASP</span><span> </span>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<span> </span><span>ASP</span><span> </span>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<span> </span><span>ASP</span><span> </span>is
available and several efficient<span> </span><span>ASP</span><span> </span>solvers
have been implemented. However, there are still significant
challenges in applying<span> </span><span>ASP</span><span> </span>to
real life applications, and more interest in relating<span> </span><span>ASP</span><span> </span>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>
-<span> </span><span>ASP</span><span> </span>and classical
logic formalisms (SAT/FOL/QBF/SMT/DL).<br>
-<span> </span><span>ASP</span><span> </span>and constraint
programming.<br>
-<span> </span><span>ASP</span><span> </span>and other logic
programming paradigms, e.g., FO(ID).<br>
-<span> </span><span>ASP</span><span> </span>and other
nonmonotonic languages, e.g., action languages.<br>
-<span> </span><span>ASP</span><span> </span>and external means
of computation.<br>
-<span> </span><span>ASP</span><span> </span>and probabilistic
reasoning.<br>
-<span> </span><span>ASP</span><span> </span>and knowledge
compilation.<br>
-<span> </span><span>ASP</span><span> </span>and machine
learning.<br>
- New methods of computing answer sets using algorithms or
systems of other paradigms.<br>
- Language extensions to<span> </span><span>ASP</span>.<br>
-<span> </span><span>ASP</span><span> </span>and multi-agent
systems.<br>
-<span> </span><span>ASP</span><span> </span>and multi-context
systems.<br>
- Modularity and<span> </span><span>ASP</span>.<br>
-<span> </span><span>ASP</span><span> </span>and argumentation.<br>
- Multi-paradigm problem solving involving<span> </span><span>ASP</span>.<br>
- Evaluation and comparison of<span> </span><span>ASP</span><span> </span>to
other paradigms.<br>
-<span> </span><span>ASP</span><span> </span>and related
paradigms in applications.<br>
- Hybridizing<span> </span><span>ASP</span><span> </span>with
procedural approaches.<br>
- Enhanced grounding or beyond grounding.<br>
<br>
<br>
SUBMISSIONS<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<span> </span><a
href="https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fdrive.google.com%2Ffile%2Fd%2F15jC34VXDf8GUMMpobnvaAaX0R4RSQ18v%2Fview%3Fusp%3Dshare_link&data=05%7C02%7C%7Cd24cf98869a54c7d623f08dc9b4af8fd%7Ccc7df24760ce4a0f9d75704cf60efc64%7C0%7C0%7C638555994695251595%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C20000%7C%7C%7C&sdata=2mgO6kjdvNcfY7UfLRNPIBzdIOSF%2BpXGED0LNR%2Biy88%3D&reserved=0" originalSrc="https://drive.google.com/file/d/15jC34VXDf8GUMMpobnvaAaX0R4RSQ18v/view?usp=share_link" shash="oysHrlW3/r7Ot9q8whbOatobL/vOphehVNPsUrkevMcw6IBLvi5zAqVaIhEtK4UX+Pd68EfrXI8iNnF3r1X7ca30454pmQ1wTE5wjhGxRR5eI4QukgjiWAzPWG8wq64X86fVAjoB8gyR50N8PdklUI9Tvy+YlXD7sZV2EGzCI8c="
target="_blank"
data-saferedirecturl="https://www.google.com/url?q=https://drive.google.com/file/d/15jC34VXDf8GUMMpobnvaAaX0R4RSQ18v/view?usp%3Dshare_link&source=gmail&ust=1720088659910000&usg=AOvVaw0Agg0luqujabW_8dbbselU"
style="color: rgb(17, 85, 204);" moz-do-not-send="true">here</a>.<br>
A ready-to-clone overleaf project containing a 1-column CEURART
style is available<span> </span><a
href="https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Fwww.overleaf.com%2Fread%2Fcqxqwrgjccwk%23deb4a7&data=05%7C02%7C%7Cd24cf98869a54c7d623f08dc9b4af8fd%7Ccc7df24760ce4a0f9d75704cf60efc64%7C0%7C0%7C638555994695407864%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C20000%7C%7C%7C&sdata=AULIxLQQ4fDVPaXrMOstYQHRbweNMextDTvrkN%2BcJIM%3D&reserved=0" originalSrc="https://www.overleaf.com/read/cqxqwrgjccwk#deb4a7" shash="ce5uWzvMPvcY10aLPUgtAhFUr7sV8a+h6GXMrpJefaSFXy57gvZGgV249q1cyyrFed3mm3trp4zFDSD8zZ5bzWTqXrAWKZ4LVuJuzoAo5CvpIgQs9V8cNgLQFOyLU26rjySi8mUl/gjjmUjOsWB0c5Itzf0uNMRuwt9706lH8wo="><span
style="color: rgb(17, 85, 204);"><span
style="color: rgb(17, 85, 204);">here</span></span></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:<span> </span><a
href="https://eur02.safelinks.protection.outlook.com/?url=https%3A%2F%2Feasychair.org%2Fmy%2Fconference%3Fconf%3Daspocp2024&data=05%7C02%7C%7Cd24cf98869a54c7d623f08dc9b4af8fd%7Ccc7df24760ce4a0f9d75704cf60efc64%7C0%7C0%7C638555994695407864%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C20000%7C%7C%7C&sdata=yWeoUePVOLQxgpyD%2BBJgPTt9%2FA4yDTgAciBpIgJ2K3Q%3D&reserved=0" originalSrc="https://easychair.org/my/conference?conf=aspocp2024" shash="kVlTJv6SB77JFX/rJavEsLUk047OrquRk39+1Xc6ZhZGKmKJ+vfs00TR6158pMbuIcqTz7jhO8qk1D58LZ9UErVPkOBQ6KaEZ794oSlHW3bcuPqivsGVy84O1PmPA400q2nRd1aor+XRRBrt2xvtXXuBwseIg8HjevK8jV99mvE="
target="_blank"
data-saferedirecturl="https://www.google.com/url?q=https://easychair.org/my/conference?conf%3Daspocp2024&source=gmail&ust=1720088659910000&usg=AOvVaw2-uN10HQSXohg3JrZ1bwe7"
style="color: rgb(17, 85, 204);" moz-do-not-send="true"><span
style="color: rgb(17, 85, 204);">https://easychair.org/<wbr>my/conference?conf=aspocp2024</span></a>.<br>
<br>
IMPORTANT DATES<br>
<br>
Abstract submission deadline: 01
August 2024<br>
Paper submission deadline: 08
August 2024<br>
Notification: 05
September 2024<br>
<br>
<br>
PROCEEDINGS<br>
<br>
Authors of all accepted original contributions can opt to
publish their work in 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>
<br>
PROGRAM COMMITTEE</font></p>
<p
style="color: rgb(34, 34, 34); font-family: Arial, Helvetica, sans-serif; font-size: small; font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; text-indent: 0px; text-transform: none; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; white-space: normal; background-color: rgb(255, 255, 255); text-decoration-thickness: initial; text-decoration-style: initial; text-decoration-color: initial;"><font
style="color: rgb(34, 34, 34); font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; text-align: start; text-indent: 0px; text-transform: none; word-spacing: 0px; white-space: normal; background-color: rgb(255, 255, 255); text-decoration-style: initial; text-decoration-color: initial;"
face="monospace">TBA</font></p>
<p></p>
</body>
</html>