VSL 2014: VIENNA SUMMER OF LOGIC 2014

PROGRAM FOR SATURDAY, JULY 19TH: TALK VIEW

Days:
previous day
next day
all days

View: with abstractssession overview

IJCAR
LATD
ICLP
LC
VSL
CSF
DL
FLoC
RTA-TLCA
SAT
CAV
CSL-LICS
ITP
NMR
8:30
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
20:30
21:00
21:30
22:00
22:30
23:00
23:30
08:30-09:30
Geometry without points
Dana Scott
08:30-09:30
Geometry without points
Dana Scott
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-10:15
FLoC Panel: Computational Complexity and Logic: Theory vs. Experiments
F. Bacchus, A. Biere, B. Cook, J. Ouaknine, K. Sakallah, M. Truszczynski
08:45-09:15
Tableau vs. Sequent Calculi for Minimal Entailment
Olaf Beyersdorff, Leroy Chew
09:15-09:45
Revisiting Chase Termination for Existential Rules and their Extension to Nonmonotonic Negation
Jean-François Baget, Fabien Garreau, Marie-Laure Mugnier, Swan Rocher
09:45-10:15
Causality in Databases: The Diagnosis and Repair Connections
Babak Salimi, Leopoldo Bertossi
09:35-09:55
Provability logics and proof-theoretic ordinals
David Fernández-Duque, Joost Joosten
09:55-10:15
On Uniform Interpolation for the Guarded Fragment
Giovanna D'Agostino, Giacomo Lenzi
09:35-09:55
Degree spectra of sequences of structures
Alexandra Soskova
09:55-10:15
Computability in generic extensions
Noah Schweber
09:35-09:55
Forcing with finite conditions and preserving CH
Miguel Angel Mota
09:55-10:15
Reflection principle of list-chromatic number of graphs
Toshimichi Usuba
09:35-09:55
Justifying proof-theoretic reflection principles
Marianna Antonutti Marfori
09:55-10:15
C. I. Lewis' Influence on the Early Work of Emil Post
Mate Szabo
09:35-09:55
Indiscernible extraction and Morley sequences
Sebastien Vasey
09:55-10:15
Consequences of the existence of ample generics and automorphism groups of homogeneous metric
Maciej Malicki
09:45-10:15
A Semi-relevant, Paraconsistent Dual of {\L}ukasiewicz Logic
Arnon Avron
09:45-10:15
Recent advances in the structural description of involutive FL$_e$-chains
Sándor Jenei
10:45-11:05
The Spirit of Ghost Code
Jean-Christophe Filliatre, Léon Gondelman, Andrei Paskevich
11:05-11:25
SMT-based Model Checking for Recursive Programs
Anvesh Komuravelli, Arie Gurfinkel, Sagar Chaki
11:25-11:45
Property-Directed Shape Analysis
Shachar Itzhaky, Nikolaj Bjørner, Thomas Reps, Mooly Sagiv, Aditya Thakur
11:45-12:05
Shape Analysis via Second-Order Bi-Abduction
Quang Loc Le, Cristian Gherghina, Shengchao Qin, Wei-Ngan Chin
12:05-12:25
ICE: A Robust Learning Framework for Synthesizing Invariants
Pranav Garg, Christof Loding, P. Madhusudan, Daniel Neider
12:25-12:45
From Invariant Checking to Invariant Inference Using Randomized Search
Rahul Sharma, Alex Aiken
12:45-12:55
SMACK: Decoupling Source Language Details from Verifier Implementations
Zvonimir Rakamaric, Michael Emmi
12:55-13:05
Syntax-Guided Synthesis Competition Results
Rajeev Alur
10:45-11:00
Conference Opening
Tom Schrijvers
11:00-11:30
A Linear Logic Programming Language for Concurrent Programming over Graph Structures
Flavio Cruz, Ricardo Rocha, Seth Goldstein, Frank Pfenning
11:30-12:00
Lifted Variable Elimination for Probabilistic Logic Programming
E. Bellodi, E. Lamma, F. Riguzzi, V. Santos Costa, R. Zese
12:00-12:30
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
Angelos Charalambidis, Zoltan Esik, Panos Rondogiannis
12:30-13:00
Abstract Diagnosis for tccp using a Linear Temporal Logic
Marco Comini, Laura Titolo, Alicia Villanueva
10:45-11:45
And-Or Tableaux for Fixpoint Logics with Converse: LTL, CTL, PDL and CPDL
Rajeev Gore
11:45-12:15
Unified Classical Logic Completeness: A Coinductive Pearl
Jasmin Christian Blanchette, Andrei Popescu, Dmitriy Traytel
12:15-12:45
A Focused Sequent Calculus for Higher-Order Logic
Fredrik Lindblad
10:45-11:15
Declarative Policies for Capability Control
Christos Dimoulas, Scott Moore, Aslan Askarov, Stephen Chong
11:15-11:45
Portable Software Fault Isolation
Joshua Kroll, Gordon Stewart, Andrew Appel
11:45-12:15
Certificates for Verifiable Forensics
Radha Jagadeesan, Cm Lubinski, Corin Pitcher, James Riely, Charles Winebrinner
12:15-12:45
Information flow monitoring as abstract interpretation for relational logic
Andrey Chudnov, George Kuan, David Naumann
10:45-11:15
Declarative Policies for Capability Control
Christos Dimoulas, Scott Moore, Aslan Askarov, Stephen Chong
11:15-11:45
Portable Software Fault Isolation
Joshua Kroll, Gordon Stewart, Andrew Appel
11:45-12:15
Certificates for Verifiable Forensics
Radha Jagadeesan, Cm Lubinski, Corin Pitcher, James Riely, Charles Winebrinner
12:15-12:45
Information flow monitoring as abstract interpretation for relational logic
Andrey Chudnov, George Kuan, David Naumann
10:45-11:45
Invited Talk: Structured Data on the Web (or, a Personal Journey Away From and Back To Ontologies)
Alon Halevy
11:45-12:10
On Faceted Search over Knowledge Bases
B. Cuenca Grau, E. Kharlamov, D. Zheleznyakov, M. Arenas, S. Marciuska
12:10-12:35
Pushing the CFDnc Envelope
David Toman, Grant Weddell
12:35-12:38
OptiqueVQS: Visual Query Formulation for OBDA
A. Soylu, E. Kharlamov, D. Zheleznyakov, E. Jimenez-Ruiz, M. Giese, I. Horrocks
12:38-12:41
Visualization and management of mappings in ontology-based data access (progress report)
D. Lembo, R. Rosati, M. Ruzzi, D.F. Savo, E. Tocci
12:41-12:44
Graphol: Ontology representation through diagrams
Marco Console, Domenico Lembo, Valerio Santarelli, Domenico Fabio Savo
12:44-12:47
Reducing global consistency to local consistency in Ontology-based Data Access - Extended Abstract
Marco Console, Maurizio Lenzerini
12:47-12:50
Expressive Identification Constraints to Capture Functional Dependencies in Description Logics
D. Calvanese, W. Fischl, R. Pichler, E. Sallinger, M. Simkus
12:50-12:53
OBDA Using RL Reasoners and Repairing
Giorgos Stoilos
12:53-12:56
A Method to Develop Description Logic Ontologies Iteratively with Automatic Requirement Traceability
Yuri Malheiros, Fred Freitas
12:56-12:59
Evaluation of Extraction Techniques for Ontology Excerpts
Jieying Chen, Michel Ludwig, Yue Ma, Dirk Walther
10:45-11:45
Step frames analysis in single- and multi-conclusion calculi
Silvio Ghilardi
11:45-12:45
Tutorial: Fuzzy Description Logics (Part 2)
Franz Baader
10:45-11:15
Interactive Debugging of ASP Programs
Kostyantyn Shchekotykhin
11:15-11:45
Semantics and Compilation of Answer Set Programming with Generalized Atoms
Mario Alviano, Wolfgang Faber
11:45-12:15
A Family of Descriptive Approaches To Preferred Answer Sets
Alexander Šimko
11:00-12:00
Tutorial on Classical Realizability and Forcing 3
Alexandre Miquel
12:00-13:00
Reductions in computability theory from a constructive point of view
Andrej Bauer
12:15-12:37
Integrating Declarative Programming and Probabilistic Graphical Models for Knowledge Representation and Reasoning in
Shiqi Zhang, Mohan Sridharan, Michael Gelfond, Jeremy Wyatt
12:37-12:59
An ASP-Based Architecture for Autonomous UAVs in Dynamic Environments: Progress Report
Marcello Balduccini, William Regli, Duc Nguyen
14:00-15:00
On a theorem of McAloon
Albert Visser
15:00-16:00
The Singular Cardinals Problem after 130 years or so
Matt Foreman
14:30-14:50
Synthesis of Masking Countermeasures against Side Channel Attacks
Hassan Eldib, Chao Wang
14:50-15:10
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
Omar Chowdhury, Limin Jia, Deepak Garg, Anupam Datta
15:10-15:30
Program Verification through String Rewriting
P.A. Abdulla, M.F. Atig, Y.-F. Chen, L. Holik, A. Rezine, P. Reummer, J. Stenman
15:30-15:50
A Conference Management System with Verified Document Confidentiality
Sudeep Kanav, Peter Lammich, Andrei Popescu
15:50-16:00
VAC - Verifier of Administrative Role-based Access Control Policies
Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen, Gennaro Parlato
14:30-14:50
Synthesis of Masking Countermeasures against Side Channel Attacks
Hassan Eldib, Chao Wang
14:50-15:10
Temporal Mode-Checking for Runtime Monitoring of Privacy Policies
Omar Chowdhury, Limin Jia, Deepak Garg, Anupam Datta
15:10-15:30
Program Verification through String Rewriting
P.A. Abdulla, M.F. Atig, Y.-F. Chen, L. Holik, A. Rezine, P. Reummer, J. Stenman
15:30-15:50
A Conference Management System with Verified Document Confidentiality
Sudeep Kanav, Peter Lammich, Andrei Popescu
15:50-16:00
VAC - Verifier of Administrative Role-based Access Control Policies
Anna Lisa Ferrara, P. Madhusudan, Truc L. Nguyen, Gennaro Parlato
14:30-15:00
A Module System for Domain-Specific Languages
Ethan K. Jackson
15:00-16:00
Combinatorial Search With Picat
Neng-Fa Zhou
14:30-15:00
SAT-based Decision Procedure for Analytic Pure Sequent Calculi
Ori Lahav, Yoni Zohar
15:00-15:30
A Unified Proof System for QBF Preprocessing
Marijn Heule, Martina Seidl, Armin Biere
15:30-16:00
The Fractal Dimension of SAT Formulas
Carlos Ansótegui, Maria Luisa Bonet, Jesus Giráldez-Cru, Jordi Levy
14:30-15:00
SAT-based Decision Procedure for Analytic Pure Sequent Calculi
Ori Lahav, Yoni Zohar
15:00-15:30
A Unified Proof System for QBF Preprocessing
Marijn Heule, Martina Seidl, Armin Biere
15:30-16:00
The Fractal Dimension of SAT Formulas
Carlos Ansótegui, Maria Luisa Bonet, Jesus Giráldez-Cru, Jordi Levy
14:30-14:55
Query Inseparability by Games
E. Botoeva, R. Kontchakov, V. Ryzhikov, F. Wolter, M. Zakharyaschev
14:55-15:20
Detecting Conjunctive Query Differences between ELHr-Terminologies using Hypergraphs
Michel Ludwig, Dirk Walther
15:20-15:45
Forgetting and Uniform Interpolation for ALC-Ontologies with ABoxes
Patrick Koopmann, Renate A. Schmidt
15:45-15:48
TBox abduction in ALC using a DL tableau
Ken Halland, Arina Britz, Szymon Klarman
15:48-15:51
Understandable Explanations in Description Logic
Fredrik Engström, Abdul Rahim Nizamani, Claes Strannegård
15:51-15:54
WApproximation: computing approximate answers for ontological queries
Yahia Chabane, Christophe Rey, Farouk Toumani
15:54-15:57
Towards Parallel Repair: An Ontology Decomposition-based Approach
Yue Ma, Rafael Peñaloza
15:57-16:00
Analyzing the Complexity of Consistent Query Answering under Existential Rules
Michaël Thomazo
14:30-15:00
MV-algebras with product and the Pierce-Birkhoff conjecture
Serafina Lapenta, Ioana Leustean
15:00-15:30
On tensor product in Lukasiewicz logic
Serafina Lapenta, Ioana Leustean
15:30-16:00
On the Logic of Perfect MV-algebras
Revaz Grigolia, Antonio Di Nola, Giacomo Lenzi
14:30-15:00
Bases for admissible rules for fragments of RMt
Laura Schnüriger
15:00-15:30
The Admissible Rules of Subframe Logics
Jeroen Goudsmit
15:30-16:00
Admissible rules and almost structural completeness in some first-order modal logics
Wojciech Dzik, Piotr Wojtylak
14:30-15:30
Revisiting Postulates for Inconsistency Measures
Philippe Besnard
15:30-16:00
Implementing Default and Autoepistemic Logics via the Logic of GK
Jianmin Ji, Hannes Strass
16:00-16:50 Poster Session (with coffee break)
16:30-16:50
From LTL to Deterministic Automata: A Safraless Compositional Approach
Javier Esparza, Jan Kretinsky
16:50-17:10
Symbolic Visibly Pushdown Automata
Loris D'Antoni, Rajeev Alur
16:30-17:00
Pengines: Web Logic Programming Made Easy
Torbjörn Lager, Jan Wielemaker
17:00-17:30
Incremental Tabling for Knowledge Representation and Reasoning
Terrance Swift
17:30-18:00
Tabling, Rational Terms, and Coinduction Finally Together!
Theofrastos Mantadelis, Ricardo Rocha, Paulo Moura
16:30-17:00
A Gentle Non-Disjoint Combination of Satisfiability Procedures
Paula Chocron, Pascal Fontaine, Christophe Ringeissen
16:30-17:00
A Gentle Non-Disjoint Combination of Satisfiability Procedures
Paula Chocron, Pascal Fontaine, Christophe Ringeissen
16:30-17:30
The problem of a model without collection and without exponentiation
Leszek Kolodziejczyk
17:30-18:30
Computable structure theory and formulas of special forms
Julia Knight
16:30-17:30
Towards a Zero-Software Trusted Computing Base for Extensible Systems
Frank Piessens
16:30-17:00
Separating intermediate predicate logics of well-founded and dually well-founded structures by monadic
Arnold Beckmann, Norbert Preining
16:30-17:00
A meta-Logic of multiple-conclusion rules
Alex Citkin
16:30-17:00
Compact Argumentation Frameworks
R. Baumann, W. Dvorak, T. Linsbichler, H. Strass, S. Woltran
17:00-17:30
Extension--based Semantics of Abstract Dialectical Frameworks
Sylwia Polberg
17:30-18:00
Credulous and Skeptical Argument Games for Complete Semantics in Conflict Resolution based
Jozef Frtús
18:00-18:30
On the Relative Expressiveness of Argumentation Frameworks, Normal Logic Programs and Abstract Dialectical
Hannes Strass
16:50-17:15
Pay-as-you-go Ontology Query Answering Using a Datalog Reasoner
Yujiao Zhou, Yavor Nenov, Bernardo Cuenca Grau, Ian Horrocks
17:15-17:40
Hybrid Query Answering Over DL Ontologies
Giorgos Stoilos, Giorgos Stamou
17:40-18:05
Optimised Absorption for Expressive Description Logics
Andreas Steigmiller, Birte Glimm, Thorsten Liebig
18:05-18:30
Planning Problems for Graph Structured Data in Description Logics
Shqiponja Ahmetaj, Diego Calvanese, Magdalena Ortiz, Mantas Simkus
17:00-17:10 Best Paper Award Ceremony
17:10-18:00
Designing and verifying molecular circuits and systems made of DNA
Erik Winfree
17:10-18:00 Herbrand Award Ceremony
17:30-18:00
On Dynamic Flow-sensitive Floating-Label Systems
Pablo Buiras, Deian Stefan, Alejandro Russo
18:00-18:30
Noninterference under Weak Memory Models
Heiko Mantel, Matthias Perner, Jens Sauer
17:30-18:00
On Dynamic Flow-sensitive Floating-Label Systems
Pablo Buiras, Deian Stefan, Alejandro Russo
18:00-18:30
Noninterference under Weak Memory Models
Heiko Mantel, Matthias Perner, Jens Sauer
18:00-18:30 CAV Award Ceremony
18:30-18:45 ORE Competition Results
10:15-10:45 Coffee Break
13:00-14:30 Lunch Break
16:00-16:30 Coffee Break
19:00-21:30 VSL Reception 2
22:00-23:59 VSL Student Reception 2
Disclaimer | Powered by EasyChair Smart Program