[DL] Call for Papers: The Decision Problem in First-Order Logic (DPFO2023)

[Wolter, Frank]

Call for Papers for the Workshop

The Decision Problem in First-Order Logic (DPFO2023)

affiliated with the Thirty-Eighth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) Boston, USA, 24-25 June 2023.

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

https://easychair.org/conferences/?conf=dpfo2023 .

Deadline: Deadline for submission of abstracts: April 3rd, 2023
Final decision by organizers and notification: April 14th, 2023
Homepage: https://www.cs.man.ac.uk/~ipratt/DPFO2023/dpfo2023.html

Invited speakers include Erich Grädel (RWTH Aachen) and Filip Murlak (University of Warsaw)

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?

>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,

Modal and description logics
Logics for ontology-based data access
The negation-guarded fragment
The fluted fragment
Separation logics
Logics of dependence and independence
Combinations of existing fragments.

Programme committee
Bartosz Bednarczyk
Michael Benedikt
Balder Ten Cate
Witold Charatonik
Stéphane Demri
Valentin Goranko
Jean Christoph Jung
Yevgeny Kazakov
Carsten Lutz
Jakub Michaliszyn
Filip Murlak
Vladislav Ryzhikov
Renate Schmidt
Lidia Tendera
Yanjing Wang
Piotr Witkowski
Michael Zakharyaschev
Thomas Zeume

Organizers
Ian Pratt-Hartmann (University of Manchester/Opole University)
Sebastian Rudolph (Technische Universität Dresden),
Frank Wolter (University of Liverpool)
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mailman.zih.tu-dresden.de/pipermail/dl/attachments/20230320/74e67e89/attachment-0001.htm>