default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCSL 2017: Stockholm, Sweden
- Valentin Goranko, Mads Dam:
26th EACSL Annual Conference on Computer Science Logic, CSL 2017, August 20-24, 2017, Stockholm, Sweden. LIPIcs 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2017, ISBN 978-3-95977-045-3 - Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers. 0:i-0:xviii
- Anuj Dawar, Daniel Leivant:
The Ackermann Award 2017. 1:1-1:4 - Phokion G. Kolaitis:
Schema Mappings: Structural Properties and Limits (Invited Talk). 2:1-2:1 - Laura Kovács:
First-Order Interpolation and Grey Areas of Proofs (Invited Talk). 3:1-3:1 - Stephan Kreutzer
:
Current Trends and New Perspectives for First-Order Model Checking (Invited Talk). 4:1-4:5 - Meena Mahajan:
Arithmetic Circuits: An Overview (Invited Talk). 5:1-5:1 - Wolfgang Thomas:
Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk). 6:1-6:1 - Margus Veanes:
Symbolic Automata Theory with Applications (Invited Talk). 7:1-7:3 - Benedikt Ahrens, Peter LeFanu Lumsdaine, Vladimir Voevodsky:
Categorical Structures for Type Theory in Univalent Foundations. 8:1-8:16 - Andrea Aler Tubella, Alessio Guglielmi, Benjamin Ralph:
Removing Cycles from Proofs. 9:1-9:17 - Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query Learning of Derived Omega-Tree Languages in Polynomial Time. 10:1-10:21 - Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski:
Extending Two-Variable Logic on Trees. 11:1-11:20 - Udi Boker:
On the (In)Succinctness of Muller Automata. 12:1-12:16 - Célia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs:
Stone Duality and the Substitution Principle. 13:1-13:20 - Joseph Boudou, Martín Diéguez, David Fernández-Duque:
A Decidable Intuitionistic Temporal Logic. 14:1-14:17 - Joseph Boudou:
Decidable Logics with Associative Binary Modalities. 15:1-15:15 - Matthew de Brecht, Arno Pauly:
Noetherian Quasi-Polish spaces. 16:1-16:17 - Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco:
Fast(er) Reasoning in Interval Temporal Logic. 17:1-17:17 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Improved Set-Based Symbolic Algorithms for Parity Games. 18:1-18:21 - Yijia Chen, Jörg Flum, Xuangui Huang:
Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. 19:1-19:16 - J. Robin B. Cockett, Jean-Simon Lemay:
Integral Categories and Calculus Categories. 20:1-20:17 - Martín Hötzel Escardó, Cory M. Knapp:
Partial Elements and Recursion via Dominances in Univalent Type Theory. 21:1-21:16 - Olivier Carton, Olivier Finkel, Dominique Lecomte:
Polishness of Some Topologies Related to Automata. 22:1-22:16 - Ulysse Gérard, Dale Miller:
Separating Functional Computation from Relations. 23:1-23:17 - Dan R. Ghica, Achim Jung, Aliaume Lopez:
Diagrammatic Semantics for Digital Circuits. 24:1-24:16 - Wan J. Fokkink, Rob J. van Glabbeek:
Precongruence Formats with Lookahead through Modal Decomposition. 25:1-25:20 - Berit Grußien:
Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs. 26:1-26:19 - Erich Grädel, Benedikt Pago, Wied Pakusa:
The Model-Theoretic Expressiveness of Propositional Proof Systems. 27:1-27:18 - Miika Hannula:
Validity and Entailment in Modal and Propositional Dependence Logics. 28:1-28:17 - Gerco van Heerdt, Matteo Sammartino, Alexandra Silva:
CALF: Categorical Automata Learning Framework. 29:1-29:24 - Bartek Klin, Mateusz Lelyk:
Modal mu-Calculus with Atoms. 30:1-30:21 - Martin Lück:
The Power of the Filtration Technique for Modal Logics with Team Semantics. 31:1-31:20 - Koko Muroya, Dan R. Ghica:
The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter. 32:1-32:15 - Mateus de Oliveira Oliveira:
On Supergraphs Satisfying CMSO Properties. 33:1-33:15 - Alice Pavaux:
Inductive and Functional Types in Ludics. 34:1-34:20 - Faried Abu Zaid, Erich Grädel, Frederic Reinhardt:
Advice Automatic Structures and Uniformly Automatic Classes. 35:1-35:20 - Wilmer Ricciotti, James Cheney:
Strongly Normalizing Audited Computation. 36:1-36:21 - Abhisekh Sankaran:
A Finitary Analogue of the Downward Löwenheim-Skolem Property. 37:1-37:21 - Maria João Gouveia, Luigi Santocanale:
Aleph1 and the Modal mu-Calculus. 38:1-38:16 - Lionel Vaux:
Taylor Expansion, lambda-Reduction and Normalization. 39:1-39:16 - Oleg Verbitsky, Maksim Zhukovskii:
On the First-Order Complexity of Induced Subgraph Isomorphism. 40:1-40:16 - Marc de Visme, Glynn Winskel:
Strategies with Parallel Causes. 41:1-41:21 - Rostislav Horcík, Tommaso Moraschini, Amanda Vidal:
An Algebraic Approach to Valued Constraint Satisfaction. 42:1-42:20
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-06-04 20:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
