Abstract is missing.
- LICS 2017 forewordJoël Ouaknine. [doi]
- MDPs with energy-parity objectivesRichard Mayr, Sven Schewe, Patrick Totzke, Dominik Wojtczak. 1-12 [doi]
- The logic of counting query answersHubie Chen, Stefan Mengel. 1-12 [doi]
- Riesz Modal logic for Markov processesMatteo Mio, Robert Furber, Radu Mardare. 1-12 [doi]
- The real projective spaces in homotopy type theoryUlrik Buchholtz, Egbert Rijke. 1-8 [doi]
- Partial derivatives on graphs for Kleene allegoriesYoshiki Nakamura. 1-12 [doi]
- Regular separability of one counter automataWojciech Czerwinski, Slawomir Lasota. 1-12 [doi]
- Foundation for a series of efficient simulation algorithmsGérard Cécé. 1-12 [doi]
- Descriptive complexity of linear equation systems and applications to propositional proof complexityMartin Grohe, Wied Pakusa. 1-12 [doi]
- The pebbling comonad in Finite Model TheorySamson Abramsky, Anuj Dawar, Pengming Wang. 1-12 [doi]
- An interpretation of system F through bar recursionValentin Blot. 1-12 [doi]
- Definability of summation problems for Abelian groups and semigroupsFaried Abu Zaid, Anuj Dawar, Erich Grädel, Wied Pakusa. 1-11 [doi]
- The continuity of monadic stream functionsVenanzio Capretta, Jonathan Fowler. 1-12 [doi]
- Stack semantics of type theoryThierry Coquand, Bassel Mannaa, Fabian Ruch. 1-11 [doi]
- Dual-context calculi for modal logicG. A. Kavvos. 1-12 [doi]
- Uniform, integral and efficient proofs for the determinant identitiesIddo Tzameret, Stephen A. Cook. 1-12 [doi]
- Learning first-order definable concepts over structures of small degreeMartin Grohe, Martin Ritzert. 1-12 [doi]
- Foundations of information integration under bag semanticsAndré Hernich, Phokion G. Kolaitis. 1-12 [doi]
- First-order logic with countingDietrich Kuske, Nicole Schweikardt. 1-12 [doi]
- Lean and full congruence formats for recursionRob J. van Glabbeek. 1-11 [doi]
- On delay and regret determinization of max-plus automataEmmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin. 1-12 [doi]
- Higher-order parity automataPaul-André Melliès. 1-12 [doi]
- Data structures for quasistrict higher categoriesKrzysztof Bar, Jamie Vicary. 1-12 [doi]
- Categorical liveness checking by corecursive algebrasNatsuki Urabe, Masaki Hara, Ichiro Hasuo. 1-12 [doi]
- Understanding the complexity of #SAT using knowledge compilationFlorent Capelli. 1-10 [doi]
- The primitivity of operators in the algebra of binary relations under conjunctions of containmentsDimitri Surinx, Jan Van den Bussche, Dirk Van Gucht. 1-10 [doi]
- Decidability, complexity, and expressiveness of first-order logic over the subword orderingSimon Halfon, Philippe Schnoebelen, Georg Zetzsche. 1-12 [doi]
- Succinct progress measures for solving parity gamesMarcin Jurdzinski, Ranko Lazic. 1-9 [doi]
- On strong determinacy of countable stochastic gamesStefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak. 1-12 [doi]
- Timed pushdown automata and branching vector addition systemsLorenzo Clemente, Slawomir Lasota, Ranko Lazic, Filip Mazowiecki. 1-12 [doi]
- Polynomial automata: Zeroness and applicationsMichael Benedikt, Timothy Duff, Aditya Sharad, James Worrell. 1-12 [doi]
- The complexity of minimal inference problem for conservative constraint languagesMichal Wrona. 1-12 [doi]
- Revisiting reachability in timed automataKarin Quaas, Mahsa Shirmohammadi, James Worrell. 1-12 [doi]
- The Weisfeiler-Leman dimension of planar graphs is at most 3Sandra Kiefer, Ilia Ponomarenko, Pascal Schweitzer. 1-12 [doi]
- Herbrand property, finite quasi-Herbrand models, and a Chandra-Merlin theorem for quantified conjunctive queriesSimone Bova, Fabio Mogavero. 1-12 [doi]
- Quotients in monadic programming: Projective algebras are equivalent to coalgebrasDusko Pavlovic, Peter-Michael Seidel. 1-12 [doi]
- Typability in bounded dimensionAndrej Dudenhefner, Jakob Rehof. 1-12 [doi]
- The geometry of concurrent interaction: Handling multiple ports by way of multiple tokensUgo Dal Lago, Ryo Tanaka, Akira Yoshimizu. 1-12 [doi]
- The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problemsLibor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker. 1-12 [doi]
- The limits of SDP relaxations for general-valued CSPsJohan Thapper, Stanislav Zivny. 1-12 [doi]
- On shift-invariant maximal filters and hormonal cellular automataJulien Cervelle, Grégory Lafitte. 1-10 [doi]
- Algorithms for some infinite-state MDPs and stochastic gamesKousha Etessami. 1 [doi]
- Equivalence of inductive definitions and cyclic proofs under arithmeticStefano Berardi, Makoto Tatsuta. 1-12 [doi]
- The clocks are ticking: No more delays!Patrick Bahr, Hans Bugge Grathwohl, Rasmus Ejlers Møgelberg. 1-12 [doi]
- A fine-grained hierarchy of hard problems in the separated fragmentMarco Voigt. 1-12 [doi]
- Capturing polynomial time using Modular DecompositionBerit Grußien. 1-12 [doi]
- Logics for continuous reachability in Petri nets and vector addition systems with statesMichael Blondin, Christoph Haase. 1-12 [doi]
- Separation for dot-depth twoThomas Place, Marc Zeitoun. 1-12 [doi]
- Bounded time computation on metric spaces and Banach spacesMatthias Schröder, Florian Steinberg. 1-12 [doi]
- Fully abstract encodings of λ-calculus in HOcore through abstract machinesMalgorzata Biernacka, Dariusz Biernacki, Sergueï Lenglet, Piotr Polesiuk, Damien Pous, Alan Schmitt. 1-12 [doi]
- Verification of randomized security protocolsRohit Chadha, A. Prasad Sistla, Mahesh Viswanathan 0001. 1-12 [doi]
- A type-theoretical definition of weak ω-categoriesEric Finster, Samuel Mimram. 1-12 [doi]
- Generalised species of rigid resource termsTakeshi Tsukada, Kazuyuki Asada, C.-H. Luke Ong. 1-12 [doi]
- Quantifiers on languages and codensity monadsMai Gehrke, Daniela Petrisan, Luca Reggio. 1-12 [doi]
- Gödel logic: From natural deduction to parallel computationFederico Aschieri, Agata Ciabattoni, Francesco A. Genco. 1-12 [doi]
- A categorical semantics for causal structureAleks Kissinger, Sander Uijlen. 1-12 [doi]
- Descriptive Complexity for counting complexity classesMarcelo Arenas, Martin Muñoz, Cristian Riveros. 1-12 [doi]
- The homomorphism problem for regular graph patternsMiguel Romero 0001, Pablo Barceló, Moshe Y. Vardi. 1-12 [doi]
- A crevice on the Crane Beach: Finite-degree predicatesMichaël Cadilhac, Charles Paperman. 1-9 [doi]
- Foundational nonuniform (Co)datatypes for higher-order logicJasmin Christian Blanchette, Fabian Meier, Andrei Popescu 0001, Dmitriy Traytel. 1-12 [doi]
- Register automata with linear arithmeticYu-Fang Chen, Ondrej Lengál, Tony Tan, Zhilin Wu. 1-12 [doi]
- Domains and event structures for fusionsPaolo Baldan, Andrea Corradini, Fabio Gadducci. 1-12 [doi]
- Logic and regular cost functionsThomas Colcombet. 1-4 [doi]
- Perfect half space gamesThomas Colcombet, Marcin Jurdzinski, Ranko Lazic, Sylvain Schmitz. 1-11 [doi]
- Definability of semidefinite programming and lasserre lower bounds for CSPsAnuj Dawar, Pengming Wang. 1-12 [doi]
- Quantitative semantics of the lambda calculus: Some generalisations of the relational modelC.-H. Luke Ong. 1-12 [doi]
- Enumeration reducibility in closure spaces with applications to logic and algebraEmmanuel Jeandel. 1-11 [doi]
- Unrestricted stone duality for Markov processesRobert Furber, Dexter Kozen, Kim G. Larsen, Radu Mardare, Prakash Panangaden. 1-9 [doi]
- Constraint satisfaction problems over semilattice block Mal'tsev algebrasAndrei A. Bulatov. 1-11 [doi]
- A monad for full ground reference cellsOhad Kammar, Paul Blain Levy, Sean K. Moss, Sam Staton. 1-12 [doi]
- Parity objectives in countable MDPsStefan Kiefer, Richard Mayr, Mahsa Shirmohammadi, Dominik Wojtczak. 1-11 [doi]
- Differentiation in logical formAbbas Edalat, Mehrdad Maleki. 1-12 [doi]
- Cut-free completeness for modal mu-calculusBahareh Afshari, Graham E. Leigh. 1-12 [doi]
- An effectful way to eliminate addiction to dependencePierre-Marie Pédrot, Nicolas Tabareau. 1-12 [doi]
- A cartesian-closed category for higher-order model checkingMartin Hofmann, Jeremy Ledent. 1-12 [doi]
- Linear combinations of unordered data vectorsPiotr Hofman, Jérôme Leroux, Patrick Totzke. 1-11 [doi]
- Constructive completeness for the linear-time μ-calculusAmina Doumane. 1-12 [doi]
- Strategy logic with imperfect informationRaphaël Berthon, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi. 1-12 [doi]
- Large scale geometries of infinite stringsBakh Khoussainov, Toru Takisaka. 1-12 [doi]
- Static analysis of deterministic negotiationsJavier Esparza, Anca Muscholl, Igor Walukiewicz. 1-12 [doi]
- Games with costs and delaysMartin Zimmermann. 1-12 [doi]
- Infinitary intersection types as sequences: A new answer to Klop's problemPierre Vial. 1-12 [doi]
- Untwisting two-way transducers in elementary timeFélix Baschenis, Olivier Gauwin, Anca Muscholl, Gabriele Puppis. 1-12 [doi]
- Effectful applicative bisimilarity: Monads, relators, and Howe's methodUgo Dal Lago, Francesco Gavazzo, Paul Blain Levy. 1-12 [doi]
- On the axiomatizability of quantitative algebrasRadu Mardare, Prakash Panangaden, Gordon D. Plotkin. 1-12 [doi]
- Symbolic execution and probabilistic reasoningCorina S. Pasareanu. 1 [doi]
- On the extension of computable real functionsMathieu Hoyrup, Walid Gomaa. 1-12 [doi]
- Bar induction: The good, the bad, and the uglyVincent Rahli, Mark Bickford, Robert L. Constable. 1-12 [doi]
- Fibred fibration categoriesTaichi Uemura. 1-12 [doi]
- A convenient category for higher-order probability theoryChris Heunen, Ohad Kammar, Sam Staton, Hongseok Yang. 1-12 [doi]
- Model-checking for successor-invariant first-order formulas on graph classes of bounded expansionJan van den Heuvel, Stephan Kreutzer, Michal Pilipczuk, Daniel A. Quiroz, Roman Rabinovich, Sebastian Siebertz. 1-11 [doi]
- Common knowledge and multi-scale locality analysis in Cayley structuresFelix Canavoi, Martin Otto. 1-12 [doi]
- Computing quantiles in Markov chains with multi-dimensional costsChristoph Haase, Stefan Kiefer, Markus Lohrey. 1-12 [doi]
- A weakest pre-expectation semantics for mixed-sign expectationsBenjamin Lucien Kaminski, Joost-Pieter Katoen. 1-12 [doi]