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
Jakob Nordstrom
Organization:
KTH Royal Institute of Technology
Web site:
http://www.csc.kth.se/~jakobn/
Pages in this Program
All Proceedings Papers
Paper: A (Biased) Proof Complexity Survey for SAT Practitioners
Paper: A (Biased) Survey of Space Complexity and Time-Space Trade-offs in Proof Complexity
Paper: From Small Space to Small Width in Resolution
Paper: Long Proofs of (Seemingly) Simple Formulas
Paper: Narrow Proofs May Be Maximally Long
Paper: Size-Space Bounds and Trade-offs for CDCL Proofs
Paper: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds
PC 2014 Abstracts
PC 2014 Abstracts: Papers with Abstracts
PC on Saturday, July 12th
PC on Sunday, July 13th
PC Program
Program
Program for Saturday, July 12th
Program for Sunday, July 13th
Program for Tuesday, July 15th
SAT 2014 LNCS Proceedings
SAT 2014 LNCS Proceedings: Papers with Abstracts
SAT on Tuesday, July 15th
SAT Program
SAT Program Committee
Disclaimer
|
Powered by EasyChair Smart Program
