FLOC 2022: FEDERATED LOGIC CONFERENCE 2022
PROGRAM
AUTHORS
KEYWORDS
SLIDES
VOLUMES
FLoC

LICS

ICLP

FSCD

NMR

KR

ITP

CP

SAT

CSF

DL

CAV

IJCAR

Olympic Games

SYNT

HoTT/UF

PC

TERMGRAPH

FoMLAS

ABR

PAAR

FOMEO

XLoKR

PERR

CHANGE

VeriProp

NSV

PLP

WST

IFIPWG1.6

QBF

ThEdu

DECFOML

ModRef

ASPOCP

MC

LMML

GDE

WPTE

GuttmanFest

iPRA

FCS

BCORE

UNIF

Coq

WOLVERINE

PDAR

Isabelle

SMT

ASL

DatalogMTL

TLLALINEARITY

LFMTP

IWC

ARQNL

REAI

PCCR

VardiFest

WiL

FMBC

Mentoring Workshop

SC^2

LogTeach

POS

FRIDA

DSV
PROGRAM

AUTHORS

KEYWORDS

SLIDES

VOLUME
PC 2022 PROGRAM PAPERS
Papers
Papers with Abstracts
Preface
Author Index
Keyword Index
Editors:
Marc Vinyals
,
Olaf Beyersdorff
and
Jan Johannsen
Authors
Title
Paper
Talk
Azza Gaysin
Proof complexity of CSP
Jul 31 14:30
Emre Yolcu
and
Marijn Heule
Exponential separations using guarded extension variables
Aug 01 17:00
Hunter Monroe
AverageCase Hardness of Proving Tautologies and Theorems
Aug 01 14:00
Dmitry Itsykson
and
Artur Riazanov
Proof complexity of natural formulas via communication arguments
Jul 31 15:00
Nikita Gaevoy
Simulations between proof systems
Aug 01 14:30
Benjamin Böhm
,
Tomáš Peitl
and
Olaf Beyersdorff
QCDCL with Cube Learning or Pure Literal Elimination – What is best?
Aug 01 10:00
Ilario Bonacina
,
Nicola Galesi
and
Massimo Lauria
On vanishing sums of roots of unity in polynomial calculus and sumofsquares (an extended abstract)
Aug 01 16:00
Tomáš Peitl
and
Stefan Szeider
Are Hitting Formulas Hard for Resolution?
Aug 01 15:00
Disclaimer

Powered by EasyChair Smart Program