<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1">
<meta name="Generator" content="Microsoft Word 15 (filtered medium)">
<style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
font-size:11.0pt;
font-family:"Calibri",sans-serif;
mso-fareast-language:EN-US;}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:#0563C1;
text-decoration:underline;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri",sans-serif;
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;
font-family:"Calibri",sans-serif;
mso-fareast-language:EN-US;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:72.0pt 72.0pt 72.0pt 72.0pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]-->
</head>
<body lang="EN-GB" link="#0563C1" vlink="#954F72" style="word-wrap:break-word">
<div class="WordSection1">
<p class="MsoNormal">Call for Papers for the Workshop<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">The Decision Problem in First-Order Logic (DPFO2023)<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">affiliated with the Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Boston, USA, 24-25 June 2023.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">We invite contributions in the form of 30-minute talks on any topic covered by the workshop title. Those interested in giving a contributed talk should submit a short abstract of no more than 2 normally spaced A4/letter pages via Easy chair
at<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">https://easychair.org/conferences/?conf=dpfo2023 .<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Deadline: Deadline for submission of abstracts: April 3rd, 2023<o:p></o:p></p>
<p class="MsoNormal">Final decision by organizers and notification: April 14th, 2023<o:p></o:p></p>
<p class="MsoNormal">Homepage: <a href="https://www.cs.man.ac.uk/~ipratt/DPFO2023/dpfo2023.html">
https://www.cs.man.ac.uk/~ipratt/DPFO2023/dpfo2023.html</a><o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Invited speakers include Erich Grädel (RWTH Aachen) and Filip Murlak (University of Warsaw)<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Nearly a century has now passed since D. Hilbert and W. Ackermann asked if there an algorithm which, when given a formula of first-order logic, determines whether that formula is satisfiable. The negative answer provided by A. Church and
A. Turing only a decade later transformed this question into a classification programme: for which fragments of first-order logic, we ask, is the problem of determining the satisfiability of a given formula decidable? Can we chart, in the words of W.V.O. Quine,
the limits of decision in first-order logic? Indeed, logicians now typically set themselves a more ambitious goal: given a fragment of first order logic, if its satisfiability (and/or its finite satisfiability problem) is decidable, what is its computational
complexity?<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">From early work on quantifier-prefix fragments, the study of the satisfiability problem (and finite satisfiability problem) for fragments of first-order logic, and indeed of its non-first-order extensions,has now become a central topic
in Computational Logic. The aim of the workshop, affiliated with LICS 2023, is to highlight recent developments in this area, with particular emphasis on those fragments which have been the focus of recent interest. These include, for example,<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Modal and description logics<o:p></o:p></p>
<p class="MsoNormal">Logics for ontology-based data access<o:p></o:p></p>
<p class="MsoNormal">The negation-guarded fragment<o:p></o:p></p>
<p class="MsoNormal">The fluted fragment<o:p></o:p></p>
<p class="MsoNormal">Separation logics<o:p></o:p></p>
<p class="MsoNormal">Logics of dependence and independence<o:p></o:p></p>
<p class="MsoNormal">Combinations of existing fragments.<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Programme committee<o:p></o:p></p>
<p class="MsoNormal">Bartosz Bednarczyk<o:p></o:p></p>
<p class="MsoNormal">Michael Benedikt<o:p></o:p></p>
<p class="MsoNormal">Balder Ten Cate<o:p></o:p></p>
<p class="MsoNormal">Witold Charatonik<o:p></o:p></p>
<p class="MsoNormal">Stéphane Demri<o:p></o:p></p>
<p class="MsoNormal">Valentin Goranko<o:p></o:p></p>
<p class="MsoNormal">Jean Christoph Jung<o:p></o:p></p>
<p class="MsoNormal">Yevgeny Kazakov<o:p></o:p></p>
<p class="MsoNormal">Carsten Lutz<o:p></o:p></p>
<p class="MsoNormal">Jakub Michaliszyn<o:p></o:p></p>
<p class="MsoNormal">Filip Murlak<o:p></o:p></p>
<p class="MsoNormal">Vladislav Ryzhikov<o:p></o:p></p>
<p class="MsoNormal">Renate Schmidt<o:p></o:p></p>
<p class="MsoNormal">Lidia Tendera<o:p></o:p></p>
<p class="MsoNormal">Yanjing Wang<o:p></o:p></p>
<p class="MsoNormal">Piotr Witkowski<o:p></o:p></p>
<p class="MsoNormal">Michael Zakharyaschev<o:p></o:p></p>
<p class="MsoNormal">Thomas Zeume<o:p></o:p></p>
<p class="MsoNormal"><o:p> </o:p></p>
<p class="MsoNormal">Organizers<o:p></o:p></p>
<p class="MsoNormal">Ian Pratt-Hartmann (University of Manchester/Opole University)<o:p></o:p></p>
<p class="MsoNormal">Sebastian Rudolph (Technische Universität Dresden),<o:p></o:p></p>
<p class="MsoNormal">Frank Wolter (University of Liverpool)<o:p></o:p></p>
</div>
</body>
</html>