[EULP 2026 - Call for Papers] 1st Workshop on End-User Logic Programming, Lisbon, Portugal | July 26
Manuel Alejandro Borroto Santana via clean-list <[email protected]> Thu, 30 Apr 2026 17:14:52 +0200
| Newsgroups | gmane.comp.lang.clean |
|---|---|
| Message-ID | <CAF4PLRD+ZCDnD-VS17K8F3XEmxCzMTert6u8pKFdJZ=vXAyZqg__3733.6994939082$1777566578$gmane$org@mail.gmail.com> |
--===============5148517715695549889==
Content-Type: multipart/alternative; boundary="000000000000d97b4e0650aeedb1"
--000000000000d97b4e0650aeedb1
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
*Call for Papers*
1st Workshop on End-User Logic Programming (EULP 2026)
July 18, 2026 | Lisbon, Portugal
https://eur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Feulp.gi=
tlab.io%2Feulp2026%2F&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e7=
0e80c46a0b57208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C6391=
31589880491012%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAu=
MDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&s=
data=3DbNlo4Jwbgk1w%2BliLrz5XQm1uGqNBPKVe%2BgldV36QHPw%3D&reserved=3D0
Part of FLoC 2026
https://eur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Fwww.flo=
c26.org%2F&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e70e80c46a0b5=
7208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C639131589880520=
427%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlA=
iOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=3D%2Bb=
kdUIra5qjTuXePhRQexahDph1OsntT6kaTsPMaoKY%3D&reserved=3D0
IMPORTANT DATES (AoE):
- Submission Deadline: *May 9, 2026*
- Notification of Acceptance: *May 21, 2026*
*GENERAL INFORMATION*
Since its inception, Logic Programming (LP) has proven itself as a powerful
technique for tackling concrete problems, such as configuration,
scheduling,
and planning. Yet, LP and related approaches have difficulties gaining
wider
traction within industry, and LP adoption is still largely driven by an
academic
push rather than an industry pull. A key reason for this discrepancy is the
fact
that building accurate programs is a difficult, costly, and error-prone
process,
especially for people without prior LP experience. More generally, this
problem
is known as the Knowledge Acquisition Bottleneck, which is a challenge for
all
approaches in the broader field of knowledge representation.
To help tackle this issue, researchers have been looking at ways to improve
the
accessibility of LP. More recently, the research direction has seen a
significant
rise in interest. Still, with no dedicated event to support it, tools and
methodologies can be scattered and hard to find.
The "End-user Logic Programming" (EULP) workshop offers a dedicated forum
for work
on techniques and methodologies that lower the logic programming threshold
for
non-experts. Additionally, we also welcome work which allows LP-approaches
to be
turned into full-fledged, user-ready products. In this way, we facilitate
sharing
new techniques, and stimulate networking between researchers from different
fields.
*SCOPE*
EULP welcomes all works that aim to lower the threshold related to logic
programming
for non-experts and to help LP approaches gain more traction in real-life
situations.
A non-exhaustive list of topics includes:
- User-friendly formalisms, such as Controlled Natural Languages and
graphical languages
- Accessible interactivity with logic programs
- Visualisation methods
- Explainability
- LLM-assisted workflows: LLMs in formalization, validation,
explanation, and others
- Integration of LP approaches in traditional programs
- Cognitive modeling complexity of LP
- Accessible UI design for LP-based tools
*SUBMISSIONS*
We invite three types of submissions:
- Long papers (up to 14 pages) describing original, unpublished
research.
- Short papers (up to 8 pages) describing original, unpublished
research.
- Extended abstracts (2-4 pages) of work that has already been
published.
Proceedings shall be submitted to CEUR-WS.org for online publication.
Therefore, all papers should use the CEURART style (
https://eur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Feulp.gi=
tlab.io%2Feulp2026%2Fceur.zip&data=3D05%7C02%7Cclean-list%40science.ru.nl%7=
C77535e70e80c46a0b57208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C=
0%7C639131589880535397%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYi=
OiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C=
%7C%7C&sdata=3DmreEjVS6EB50GrTL0W935TibAdCeYN2vh65%2BKoODBaM%3D&reserved=3D=
0).
Submission Site
Papers should be submitted through the dedicated EULP submission system:
https://eur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Fsubmiss=
ions.floc26.org%2Feulp%2F&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C775=
35e70e80c46a0b57208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C=
639131589880549871%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIw=
LjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%=
7C&sdata=3DZx9LiQMo7kQdtjSCElNVyjS774zyl3gID8gn6ltVUF0%3D&reserved=3D0
*ORGANIZATION*
Mario Alviano, University of Calabria
Susana Hahn, University of Potsdam
Luis Angel Rodriguez Reiners, University of Calabria
Torsten Schaub, University of Potsdam
Simon Vandevelde, KU Leuven
For any questions regarding the workshop, please contact:
[email protected]
--=20
---------------------------------------------------------------------------=
---------------------------------------
Il banner =C3=A8 generato automaticamente dal servizio di posta elettronica=
=20
dell'Universit=C3=A0 della Calabria
<https://eur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Fwww.u=
nical.it%2F5x1000&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e70e80=
c46a0b57208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C63913158=
9880564241%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAw=
MCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=
=3D9vn9DshJm9T816ntzah0KK5x3S9is1%2BUiRJyfayLNFs%3D&reserved=3D0>
--000000000000d97b4e0650aeedb1
Content-Type: text/html; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
<div dir=3D"ltr"><div dir=3D"ltr"><div><b><br></b></div><div><b>Call for Pa=
pers</b></div><br>1st Workshop on End-User Logic Programming (EULP 2026) <b=
r>July 18, 2026 | Lisbon, Portugal <br><a href=3D"https://eur01.safelinks.p=
rotection.outlook.com/?url=3Dhttps%3A%2F%2Feulp.gitlab.io%2Feulp2026%2F&=
;data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e70e80c46a0b57208dea6cb=
43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C639131589880616095%7CUnkn=
own%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zM=
iIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=3DKG8XPMBFmd=
tOC7qelxbGyIS0N8reAtUr6HWQGxKrtvI%3D&reserved=3D0" originalSrc=3D"https=
://eulp.gitlab.io/eulp2026/" target=3D"_blank">https://eulp.gitlab.io/eulp2=
026/</a><br><br><div>Part of FLoC 2026=C2=A0</div><div><a href=3D"https://e=
ur01.safelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Fwww.floc26.org%2=
F&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e70e80c46a0b57208d=
ea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C639131589880670306%7=
CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJX=
aW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=3DejT1m=
c9K%2B1dKc7jyHGEtzPo7Q%2BR0kJgPvkuENWLn56A%3D&reserved=3D0" originalSrc=
=3D"https://www.floc26.org/" target=3D"_blank">https://www.floc26.org/</a><=
/div><br>IMPORTANT DATES (AoE):<br><br>=C2=A0 =C2=A0 - Submission Deadline:=
<b>May 9, 2026</b><br>=C2=A0 =C2=A0 - Notification of Acceptance: <b>May 2=
1, 2026</b><br><br><br><b>GENERAL INFORMATION</b><br><br>Since its inceptio=
n, Logic Programming (LP) has proven itself as a powerful <br>technique for=
tackling concrete problems, such as configuration, scheduling, <br>and pla=
nning. Yet, LP and related approaches have difficulties gaining wider <br>t=
raction within industry, and LP adoption is still largely driven by an acad=
emic <br>push rather than an industry pull. A key reason for this discrepan=
cy is the fact <br>that building accurate programs is a difficult, costly, =
and error-prone process, <br>especially for people without prior LP experie=
nce. More generally, this problem <br>is known as the Knowledge Acquisition=
Bottleneck, which is a challenge for all <br>approaches in the broader fie=
ld of knowledge representation.<br><br>To help tackle this issue, researche=
rs have been looking at ways to improve the <br>accessibility of LP. More r=
ecently, the research direction has seen a significant <br>rise in interest=
. Still, with no dedicated event to support it, tools and <br>methodologies=
can be scattered and hard to find.<br><br>The "End-user Logic Program=
ming" (EULP) workshop offers a dedicated forum for work <br>on techniq=
ues and methodologies that lower the logic programming threshold for <br>no=
n-experts. Additionally, we also welcome work which allows LP-approaches to=
be <br>turned into full-fledged, user-ready products. In this way, we faci=
litate sharing <br>new techniques, and stimulate networking between researc=
hers from different fields.<br><br><br><b>SCOPE</b><br><br>EULP welcomes al=
l works that aim to lower the threshold related to logic programming <br>fo=
r non-experts and to help LP approaches gain more traction in real-life sit=
uations. <br>A non-exhaustive list of topics includes:<br><br>=C2=A0 =C2=A0=
- User-friendly formalisms, such as Controlled Natural Languages and graph=
ical languages<br>=C2=A0 =C2=A0 - Accessible interactivity with logic progr=
ams<br>=C2=A0 =C2=A0 - Visualisation methods<br>=C2=A0 =C2=A0 - Explainabil=
ity<br>=C2=A0 =C2=A0 - LLM-assisted workflows: LLMs in formalization, valid=
ation, explanation, and others<br>=C2=A0 =C2=A0 - Integration of LP approac=
hes in traditional programs<br>=C2=A0 =C2=A0 - Cognitive modeling complexit=
y of LP<br>=C2=A0 =C2=A0 - Accessible UI design for LP-based tools<br><br><=
br><b>SUBMISSIONS</b><br><br><div>We invite three types of submissions:</di=
v><div><br></div>=C2=A0 =C2=A0 - Long papers (up to 14 pages) describing or=
iginal, unpublished research.<br>=C2=A0 =C2=A0 - Short papers (up to 8 page=
s) describing original, unpublished research.<br>=C2=A0 =C2=A0 - Extended a=
bstracts (2-4 pages) of work that has already been published.<br><br><br>Pr=
oceedings shall be submitted to CEUR-WS.org for online publication. <br>The=
refore, all papers should use the CEURART style (<a href=3D"https://eur01.s=
afelinks.protection.outlook.com/?url=3Dhttps%3A%2F%2Feulp.gitlab.io%2Feulp2=
026%2Fceur.zip&data=3D05%7C02%7Cclean-list%40science.ru.nl%7C77535e70e8=
0c46a0b57208dea6cb43a1%7C084578d9400d4a5aa7c7e76ca47af400%7C1%7C0%7C6391315=
89880687081%7CUnknown%7CTWFpbGZsb3d8eyJFbXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDA=
wMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIldUIjoyfQ%3D%3D%7C60000%7C%7C%7C&=
sdata=3DcRMPBu5eDFx5zvSbDuFKZMWv4uLd2YW2uAQ%2FVyGwx%2BY%3D&reserved=3D0=
" originalSrc=3D"https://eulp.gitlab.io/eulp2026/ceur.zip" target=3D"_blank=
">https://eulp.gitlab.io/eulp2026/ceur.zip</a>).<br><br><br>Submission Site=
<div>Papers should be submitted through the dedicated EULP submission syste=
m:</div><div><a href=3D"https://eur01.safelinks.protection.outlook.com/?url=
=3Dhttps%3A%2F%2Fsubmissions.floc26.org%2Feulp%2F&data=3D05%7C02%7Cclea=
n-list%40science.ru.nl%7C77535e70e80c46a0b57208dea6cb43a1%7C084578d9400d4a5=
aa7c7e76ca47af400%7C1%7C0%7C639131589880703910%7CUnknown%7CTWFpbGZsb3d8eyJF=
bXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIld=
UIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=3DqswVLyo8bWowwrkTTPUggeywsNlEi7m8=
A99EieOaYcU%3D&reserved=3D0" originalSrc=3D"https://submissions.floc26.=
org/eulp/" target=3D"_blank">https://submissions.floc26.org/eulp/</a></div>=
<br><br><b>ORGANIZATION</b><br><br>=C2=A0 =C2=A0 Mario Alviano, University =
of Calabria<br>=C2=A0 =C2=A0 Susana Hahn, University of Potsdam<br>=C2=A0 =
=C2=A0 Luis Angel Rodriguez Reiners, University of Calabria<br>=C2=A0 =C2=
=A0 Torsten Schaub, University of Potsdam<br>=C2=A0 =C2=A0 Simon Vandevelde=
, KU Leuven<br><br><br>For any questions regarding the workshop, please con=
tact: <a href=3D"mailto:[email protected]" target=3D"_blank">s.vande=
[email protected]</a><br><br></div>
</div>
<br>
<div style=3D"font-family:Arial,Helvetica,sans-serif;font-size:1.3em">-----=
-------------------------<span></span><span></span><span></span><span></spa=
n><span></span><span></span><span></span><wbr>-----------------------------=
-<span></span><span></span><span></span><span></span><span></span><span></s=
pan><span></span><wbr>------------------------------<span></span><span></sp=
an><span></span><span></span><span></span><span></span><span></span><wbr>--=
----------------------</div><div><font face=3D"Arial, Helvetica, sans-serif=
"><span style=3D"font-size:13px">Il banner =C3=A8 generato automaticamente =
dal servizio di posta elettronica dell'Universit=C3=A0 della Calabria</=
span></font></div><div><font face=3D"Arial, Helvetica, sans-serif"><span st=
yle=3D"font-size:13px"><a href=3D"https://eur01.safelinks.protection.outloo=
k.com/?url=3Dhttps%3A%2F%2Fwww.unical.it%2F5x1000&data=3D05%7C02%7Cclea=
n-list%40science.ru.nl%7C77535e70e80c46a0b57208dea6cb43a1%7C084578d9400d4a5=
aa7c7e76ca47af400%7C1%7C0%7C639131589880718412%7CUnknown%7CTWFpbGZsb3d8eyJF=
bXB0eU1hcGkiOnRydWUsIlYiOiIwLjAuMDAwMCIsIlAiOiJXaW4zMiIsIkFOIjoiTWFpbCIsIld=
UIjoyfQ%3D%3D%7C60000%7C%7C%7C&sdata=3DqXKbZEGgCNXFyq%2F2Q%2BTBigLRxM8r=
pcKzS6npuVuoGn0%3D&reserved=3D0" originalSrc=3D"https://www.unical.it/5=
x1000" target=3D"_blank"><img src=3D"https://www.unical.it/uuid-media/ec031=
9a7-45d7-49d8-9d9d-45463b1ed86d/" alt=3D"https://www.unical.it/5x1000"></a>=
<br></span></font></div>=
--000000000000d97b4e0650aeedb1--
--===============5148517715695549889==
Content-Type: text/plain; charset="utf-8"
MIME-Version: 1.0
Content-Transfer-Encoding: base64
Content-Disposition: inline
X19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX19fX18KY2xlYW4tbGlz
dCBtYWlsaW5nIGxpc3QKY2xlYW4tbGlzdEBzY2llbmNlLnJ1Lm5sCmh0dHBzOi8vbWFpbG1hbi5z
Y2llbmNlLnJ1Lm5sL21haWxtYW4vbGlzdGluZm8vY2xlYW4tbGlzdAo=
--===============5148517715695549889==--