CSL 2017: 26TH EACSL ANNUAL CONFERENCE ON COMPUTER SCIENCE LOGIC

A
Abramsky, Samson	The Quantum Monad on Relational Structures
Abu Zaid, Faried	Advice Automatic Structures and Uniformly Automatic Classes
Ahrens, Benedikt	Categorical structures for type theory in univalent foundations
Aler Tubella, Andrea	Removing Cycles from Proofs
Angluin, Dana	Query Learning of Derived Omega-Tree Languages in Polynomial Time
Antonopoulos, Timos	Query Learning of Derived Omega-Tree Languages in Polynomial Time
B
Barbosa, Rui Soares	The Quantum Monad on Relational Structures
Becher, Verónica	Normal Numbers, Logic and Automata
Bednarczyk, Bartosz	Extending Two-Variable Logic on Trees
Boker, Udi	On the (In)Succinctness of Muller Automata
Borlido, Célia	Stone duality and the substitution principle
Boudou, Joseph	Decidable Logics with associative binary modalities A decidable intuitionistic temporal logic
Bresolin, Davide	Fast(er) Reasoning in Interval Temporal Logic
C
Cadilhac, Michaël	Weaker counting abilities in first-order logic
Carton, Olivier	Polishness of some topologies related to automata
Charatonik, Witold	Extending Two-Variable Logic on Trees
Chatterjee, Krishnendu	Improved Set-based Symbolic Algorithms for Parity Games
Chen, Yijia	Slicewise definability in first-order logic with bounded quantifier rank
Cheney, James	Strongly Normalizing Audited Computation
Cockett, Robin	Integral Categories and Calculus Categories
Czarnetzki, Silke	Stone duality and the substitution principle
D
de Brecht, Matthew	Noetherian Quasi-Polish spaces
De Oliveira Oliveira, Mateus	On Supergraphs Satisfying CMSO Properties
de Silva, Nadish	The Quantum Monad on Relational Structures
De Visme, Marc	Strategies with Parallel Causes
Diéguez, Martín	A decidable intuitionistic temporal logic
Dvořák, Wolfgang	Improved Set-based Symbolic Algorithms for Parity Games
E
Escardo, Martin	Partial Elements and Recursion via Dominances in Univalent Type Theory
F
Fernández-Duque, David	A decidable intuitionistic temporal logic
Finkel, Olivier	Polishness of some topologies related to automata
Fisman, Dana	Query Learning of Derived Omega-Tree Languages in Polynomial Time
Flum, Jörg	Slicewise definability in first-order logic with bounded quantifier rank
Fokkink, Wan	Precongruence Formats with Lookahead through Modal Decomposition
G
Gehrke, Mai	Stone duality and the substitution principle
Ghica, Dan	Diagrammatic Semantics for Digital Circuits The Dynamic Geometry of Interaction Machine
Gouveia, Maria João	aleph_1 and the modal mu-calculus
Grußien, Berit	Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs
Grädel, Erich	The Model-Theoretic Expressiveness of Propositional Proof Systems Advice Automatic Structures and Uniformly Automatic Classes
Guglielmi, Alessio	Removing Cycles from Proofs
Gérard, Ulysse	Separating Functional Computation from Relations
H
Hannula, Miika	Validity and Entailment in Modal and Propositional Dependence Logics
Henzinger, Monika	Improved Set-based Symbolic Algorithms for Parity Games
Horcik, Rostislav	An Algebraic Approach to Valued Constraint Satisfaction
Huang, Xuangui	Slicewise definability in first-order logic with bounded quantifier rank
J
Jung, Achim	Diagrammatic Semantics for Digital Circuits
K
Kieronski, Emanuel	Extending Two-Variable Logic on Trees
Klin, Bartek	Modal mu-calculus with atoms
Knapp, Cory	Partial Elements and Recursion via Dominances in Univalent Type Theory
Kolaitis, Phokion G.	Schema mappings: Structural Properties and Limits
Kovács, Laura	First-Order Interpolation and Grey Areas of Proofs
Krebs, Andreas	Stone duality and the substitution principle
Kreutzer, Stephan	Current Trends and New Perspectives for First-Order Model Checking
Kuroda, Satoru	On Takeuti-Yasumoto forcing
L
Lecomte, Dominique	Polishness of some topologies related to automata
Lehtinen, Karoliina	The modal mu-calculus and the descriptive complexity of parity games
Lemay, Jean-Simon	Integral Categories and Calculus Categories
Loitzenbauer, Veronika	Improved Set-based Symbolic Algorithms for Parity Games
Lopez, Aliaume	Diagrammatic Semantics for Digital Circuits
Lumsdaine, Peter Lefanu	Categorical structures for type theory in univalent foundations
Lück, Martin	Filtration versus Team Semantics
M
Mahajan, Meena	Arithmetic Circuits: An Overview
Maieli, Roberto	Non decomposable connectives of linear logic
Miller, Dale	Separating Functional Computation from Relations
Moraschini, Tommaso	An Algebraic Approach to Valued Constraint Satisfaction
Muroya, Koko	The Dynamic Geometry of Interaction Machine
Muñoz-Velasco, Emilio	Fast(er) Reasoning in Interval Temporal Logic
P
Pago, Benedikt	The Model-Theoretic Expressiveness of Propositional Proof Systems
Pakusa, Wied	The Model-Theoretic Expressiveness of Propositional Proof Systems
Pauly, Arno	Noetherian Quasi-Polish spaces
Pavaux, Alice	Inductive and Functional Types in Ludics
R
Ralph, Benjamin	Removing Cycles from Proofs
Reinhardt, Frederic	Advice Automatic Structures and Uniformly Automatic Classes
Ricciotti, Wilmer	Strongly Normalizing Audited Computation
S
Sammartino, Matteo	CALF: Categorical Automata Learning Framework
Sankaran, Abhisekh	A Finitary Analogue of the Downward Löwenheim-Skolem Property
Santocanale, Luigi	aleph_1 and the modal mu-calculus
Sciavicco, Guido	Fast(er) Reasoning in Interval Temporal Logic
Silva, Alexandra	CALF: Categorical Automata Learning Framework
Simon, Pierre	Recent directions in model theory
T
Thomas, Wolfgang	Determinacy of Infinite Games: Perspectives of the Algorithmic Approach
V
van Glabbeek, Rob	Precongruence Formats with Lookahead through Modal Decomposition
van Heerdt, Gerco	CALF: Categorical Automata Learning Framework
Vaux, Lionel	Taylor expansion, β-reduction and normalization
Veanes, Margus	Symbolic automata theory with applications (extended abstract)
Verbitsky, Oleg	On the First-Order Complexity of Induced Subgraph Isomorphism
Vidal Wandelmer, Amanda	An Algebraic Approach to Valued Constraint Satisfaction
Voevodsky, Vladimir	Categorical structures for type theory in univalent foundations
Voigt, Marco	On Implicit Dependence and Independence between Differently Quantified First-Order Variables
W
Wang, Ren-June	Interpreting the plus sign in justification logic as the union of sets of justifications (Extended Abstract)
Winskel, Glynn	Strategies with Parallel Causes
Y
Yamada, Norihiro	Game Semantics for Martin-Löf Type Theory
Z
Zapata, Octavio	The Quantum Monad on Relational Structures
Zhukovskii, Maksim	On the First-Order Complexity of Induced Subgraph Isomorphism
Ł
Łełyk, Mateusz	Modal mu-calculus with atoms

Disclaimer | Powered by EasyChair Smart Program