BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2023/newsitem/14214/24
 -June-2023-DPFO-23-The-Decision-Problem-in-First-O
 rder-Logic
DTSTAMP:20230406T144210
SUMMARY:DPFO'23: The Decision Problem in First-Ord
 er Logic
DTSTART;VALUE=DATE:20230624
DTEND;VALUE=DATE:20230425
LOCATION:Boston, United States
DESCRIPTION:[LICS Affiliated Workshop] Nearly a ce
 ntury has now passed since D. Hilbert and W. Acker
 mann asked if there an algorithm which, when given
  a formula of first-order logic, determines whethe
 r that formula is satisfiable. The negative answer
  provided by A. Church and A. Turing only a decade
  later transformed this question into a classifica
 tion programme: for which fragments of first-order
  logic, we ask, is the problem of determining the 
 satisfiability of a given formula decidable? Can w
 e chart, in the words of W.V.O. Quine, the limits 
 of decision in first-order logic? Indeed, logician
 s now typically set themselves a more ambitious go
 al: given a fragment of first order logic, if its 
 satisfiability (and/or its finite satisfiability p
 roblem) is decidable, what is its computational co
 mplexity?  From early work on quantifier-prefix fr
 agments, the study of the satisfiability problem (
 and finite satisfiability problem) for fragments o
 f first-order logic, and indeed of its non-first-o
 rder extensions,has now become a central topic in 
 Computational Logic. The aim of the workshop, affi
 liated with LICS 2023, is to highlight recent deve
 lopments in this area, with particular emphasis on
  those fragments which have been the focus of rece
 nt interest. These include, for example: Modal and
  description logics; Logics for ontology-based dat
 a access; The negation-guarded fragment; The flute
 d fragment; Separation logics; Logics of dependenc
 e and independence; Combinations of existing fragm
 ents.  We invite contributions in the form of 30-m
 inute talks on any topic covered by the workshop t
 itle (not confined to the list above). Those inter
 ested in giving a contributed talk should submit a
  short abstract of no more than 2 normally spaced 
 A4/letter pages via via Easy chair.  Deadline for 
 submission of abstracts: (April 19th, 2023).  Fina
 l decision by organizers and notification: April 2
 8th, 2023
X-ALT-DESC;FMTTYPE=text/html:<div>\n  <p>[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?</p>\n  <p>F
 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.</p>\n<
 /div><div>\n  <p>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.</p>\
 n  <p>Deadline for submission of abstracts: (April
  19th, 2023).<br>\n  Final decision by organizers 
 and notification: April 28th, 2023</p>\n</div>
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