CSL B

44 papers

YearTitle / Authors
201726th EACSL Annual Conference on Computer Science Logic, CSL 2017, Stockholm, Sweden, August 20-24, 2017
Valentin Goranko, Mads Dam
2017A Decidable Intuitionistic Temporal Logic.
Joseph Boudou, Martín Diéguez, David Fernández-Duque
2017A Finitary Analogue of the Downward Löwenheim-Skolem Property.
Abhisekh Sankaran
2017Advice Automatic Structures and Uniformly Automatic Classes.
Faried Abu Zaid, Erich Grädel, Frederic Reinhardt
2017Aleph1 and the Modal mu-Calculus.
Maria João Gouveia, Luigi Santocanale
2017An Algebraic Approach to Valued Constraint Satisfaction.
Rostislav Horcík, Tommaso Moraschini, Amanda Vidal
2017Arithmetic Circuits: An Overview (Invited Talk).
Meena Mahajan
2017CALF: Categorical Automata Learning Framework.
Gerco van Heerdt, Matteo Sammartino, Alexandra Silva
2017Capturing Logarithmic Space and Polynomial Time on Chordal Claw-Free Graphs.
Berit Grußien
2017Categorical Structures for Type Theory in Univalent Foundations.
Benedikt Ahrens, Peter LeFanu Lumsdaine, Vladimir Voevodsky
2017Current Trends and New Perspectives for First-Order Model Checking (Invited Talk).
Stephan Kreutzer
2017Decidable Logics with Associative Binary Modalities.
Joseph Boudou
2017Determinacy of Infinite Games: Perspectives of the Algorithmic Approach (Invited Talk).
Wolfgang Thomas
2017Diagrammatic Semantics for Digital Circuits.
Dan R. Ghica, Achim Jung, Aliaume Lopez
2017Extending Two-Variable Logic on Trees.
Bartosz Bednarczyk, Witold Charatonik, Emanuel Kieronski
2017Fast(er) Reasoning in Interval Temporal Logic.
Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco
2017First-Order Interpolation and Grey Areas of Proofs (Invited Talk).
Laura Kovács
2017Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers.
2017Improved Set-Based Symbolic Algorithms for Parity Games.
Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer
2017Inductive and Functional Types in Ludics.
Alice Pavaux
2017Integral Categories and Calculus Categories.
J. Robin B. Cockett, Jean-Simon Lemay
2017Modal mu-Calculus with Atoms.
Bartek Klin, Mateusz Lelyk
2017Noetherian Quasi-Polish spaces.
Matthew de Brecht, Arno Pauly
2017On Supergraphs Satisfying CMSO Properties.
Mateus de Oliveira Oliveira
2017On the (In)Succinctness of Muller Automata.
Udi Boker
2017On the First-Order Complexity of Induced Subgraph Isomorphism.
Oleg Verbitsky, Maksim Zhukovskii
2017Partial Elements and Recursion via Dominances in Univalent Type Theory.
Martín Hötzel Escardó, Cory M. Knapp
2017Polishness of Some Topologies Related to Automata.
Olivier Carton, Olivier Finkel, Dominique Lecomte
2017Precongruence Formats with Lookahead through Modal Decomposition.
Wan J. Fokkink, Rob J. van Glabbeek
2017Query Learning of Derived Omega-Tree Languages in Polynomial Time.
Dana Angluin, Timos Antonopoulos, Dana Fisman
2017Removing Cycles from Proofs.
Andrea Aler Tubella, Alessio Guglielmi, Benjamin Ralph
2017Schema Mappings: Structural Properties and Limits (Invited Talk).
Phokion G. Kolaitis
2017Separating Functional Computation from Relations.
Ulysse Gérard, Dale Miller
2017Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
Yijia Chen, Jörg Flum, Xuangui Huang
2017Stone Duality and the Substitution Principle.
Célia Borlido, Silke Czarnetzki, Mai Gehrke, Andreas Krebs
2017Strategies with Parallel Causes.
Marc de Visme, Glynn Winskel
2017Strongly Normalizing Audited Computation.
Wilmer Ricciotti, James Cheney
2017Symbolic Automata Theory with Applications (Invited Talk).
Margus Veanes
2017Taylor Expansion, lambda-Reduction and Normalization.
Lionel Vaux
2017The Ackermann Award 2017.
Anuj Dawar, Daniel Leivant
2017The Dynamic Geometry of Interaction Machine: A Call-by-Need Graph Rewriter.
Koko Muroya, Dan R. Ghica
2017The Model-Theoretic Expressiveness of Propositional Proof Systems.
Erich Grädel, Benedikt Pago, Wied Pakusa
2017The Power of the Filtration Technique for Modal Logics with Team Semantics.
Martin Lück
2017Validity and Entailment in Modal and Propositional Dependence Logics.
Miika Hannula