VSL 2014: VIENNA SUMMER OF LOGIC 2014
VSL FOREWORD
VSL
PROGRAM
VOLUMES
VSL
|
FLoC
|
CAV
|
CSF
|
CSL-LICS
|
ICLP
|
IJCAR
|
ITP
|
RTA-TLCA
|
SAT
|
LC
|
LATD
|
KR
|
DL
|
NMR
|
2FC
|
ACL2
|
ADDCT
|
AISS
|
APPA
|
ARQNL
|
ARW-DT
|
ASA
|
ASPOCP
|
Automatheo
|
CHR
|
CICLOPS-WLPE
|
CLC
|
Coq
|
CSPSAT
|
DCM
|
DTP
|
EC2
|
FCS-FCC
|
FRIDA
|
FWFM
|
GeTFun
|
GSB
|
HCVS
|
HOL
|
HOPA
|
HOR
|
HSB
|
IFIP-WG16
|
INFINITY
|
iPRA
|
ITRS
|
IWC
|
Isabelle
|
KInAR
|
KR4HC
|
LaSh
|
LCC
|
LFMTP
|
LG
|
Linearity
|
LOLA
|
LSB
|
NCPROOFS
|
NLCS
|
NLSR
|
NSV
|
ORE
|
PAAR
|
ParSearchOpt
|
PAS
|
PC
|
PCCR
|
PLP
|
POS
|
PRUV
|
PSC
|
QBF
|
QED
|
QUANTIFY
|
RCRA
|
REORDER
|
RS
|
SMT
|
SD
|
SSV
|
STAST
|
SYNT
|
TermGraph
|
UITP
|
UNIF
|
Vampire
|
VEMDP
|
VERIFY
|
VeriSure
|
VPT
|
VSTTE
|
WING
|
WIR
|
WPTE
|
WST
|
WWV
HOME
|
PC
|
PROGRAM
|
VOLUME
SAT ON TUESDAY, JULY 15TH: TALK VIEW
Days:
previous day
next day
all days
View:
with abstracts
session overview
side by side with other conferences
9:00
9:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
08:45-09:45
FLoC Plenary Talk: From Reachability to Temporal Specifications in Game Theory
Orna Kupfermann
10:45-11:15
Long Proofs of (Seemingly) Simple Formulas
Mladen Miksa, Jakob Nordström
11:15-11:45
Proof complexity and the Lovasz-Kneser Theorem
Gabriel Istrate, Adrian Crăciun
11:50-12:20
Ultimately Incremental SAT
Alexander Nadel, Ofer Strichman, Vadim Ryvchin
12:20-12:40
Community Branching for Parallel Portfolio SAT Solvers
Tomohiro Sonobe, Shuya Kondoh, Mary Inaba
12:40-13:00
Lazy clause exchange policy for parallel SAT solvers
Laurent Simon, Gilles Audemard
14:30-15:30
A (Biased) Proof Complexity Survey for SAT Practitioners
Jakob Nordström
15:30-16:00
Unified characterisations of resolution hardness measures
Oliver Kullmann, Olaf Beyersdorff
16:30-17:00
QBF Resolution Systems and their Proof Complexities
Valeriy Balabanov, Magdalena Widl, Jie-Hong Roland Jiang
17:00-18:00
SAT Association General Assembly
10:15-10:45
Coffee Break
13:00-14:30
Lunch Break
16:00-16:30
Coffee Break
19:00-20:00
VSL Public Lecture: Gödel in Vienna
Karl Sigmund
Disclaimer
|
Powered by EasyChair Smart Program