\n

[LICS Aff iliated Workshop] Nearly a century has now passed since D. Hilbert and W. Ackermann asked if there a n algorithm which, when given a formula of first-o rder logic, determines whether that formula is sat isfiable. The negative answer provided by A. Churc h and A. Turing only a decade later transformed th is question into a classification programme: for w hich fragments of first-order logic, we ask, is th e problem of determining the satisfiability of a g iven 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 t hemselves a more ambitious goal: given a fragment of first order logic, if its satisfiability (and/o r its finite satisfiability problem) is decidable, what is its computational complexity?

\nF rom early work on quantifier-prefix fragments, the study of the satisfiability problem (and finite s atisfiability problem) for fragments of first-orde r logic, and indeed of its non-first-order extensi ons,has now become a central topic in Computationa l Logic. The aim of the workshop, affiliated with LICS 2023, is to highlight recent developments in this area, with particular emphasis on those fragm ents which have been the focus of recent interest. These include, for example: Modal and description logics; Logics for ontology-based data access; Th e negation-guarded fragment; The fluted fragment; Separation logics; Logics of dependence and indepe ndence; Combinations of existing fragments.

\n< /div>\n

URL:http://www.cs.man.ac.uk/~ipratt/DPFO2023/dpfo2
023.html
CONTACT:Ian Prattt-Hartmann at ian.pratt at manche
ster.ac.uk
END:VEVENT
END:VCALENDAR
We invite contributions in the fo rm of 30-minute talks on any topic covered by the workshop title (not confined to the list above). T hose interested in giving a contributed talk shoul d submit a short abstract of no more than 2 normal ly spaced A4/letter pages via via Easy chair.

\ nDeadline for submission of abstracts: (April
19th, 2023).

\n Final decision by organizers
and notification: April 28th, 2023