Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID31st LICS 2016: New York, NY, USA
- Martin Grohe, Eric Koskinen, Natarajan Shankar:
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, New York, NY, USA, July 5-8, 2016. ACM 2016, ISBN 978-1-4503-4391-6
Invited Presentations
- Pedro M. Domingos, Daniel Lowd, Stanley Kok, Aniruddh Nath, Hoifung Poon, Matthew Richardson, Parag Singla:
Unifying Logical and Statistical AI. 1-11 - Mai Gehrke:
Duality in Computer Science. 12-26 - Maurice Herlihy, Mark Moir:
Blockchains and the Logic of Accountability: Keynote Address. 27-30 - Joost-Pieter Katoen:
The Probabilistic Model Checking Landscape. 31-45
Probabilistic Models of Computation
- Nicolas Behr
, Vincent Danos, Ilias Garnier:
Stochastic mechanics of graph rewriting. 46-55 - Souymodip Chakraborty, Joost-Pieter Katoen:
On the Satisfiability of Some Simple Probabilistic Logics. 56-65 - Stefan Kiefer, A. Prasad Sistla:
Distinguishing Hidden Markov Chains. 66-75 - Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop:
Quantitative Automata under Probabilistic Semantics. 76-85
Decidability
- Thomas Sturm, Marco Voigt, Christoph Weidenbach:
Deciding First-Order Satisfiability when Universal and Existential Variables are Separated. 86-95 - Lorenzo Clemente, Pawel Parys, Sylvain Salvati, Igor Walukiewicz:
The Diagonal Problem for Higher-Order Recursion Schemes is Decidable. 96-105 - Andreas Krebs, Kamal Lodaya, Paritosh K. Pandya, Howard Straubing:
Two-variable Logic with a Between Relation. 106-115 - Brijesh Dongol, Robert M. Hierons:
Decidability and Complexity for Quiescent Consistency. 116-125
Proof Theory
- Anupam Das:
From positive and intuitionistic bounded arithmetic to monotone proof complexity. 126-135 - Thomas Powell:
Gödel's functional interpretation and the concept of learning. 136-145 - Olaf Beyersdorff, Ján Pich:
Understanding Gentzen and Frege Systems for QBF. 146-155 - Chuck C. Liang:
Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics. 156-165
Model Checking
- Parosh Aziz Abdulla, C. Aiswarya, Mohamed Faouzi Atig:
Data Communicating Processes with Unreliable Channels. 166-175 - Jakub Gajarský, Petr Hlinený, Jan Obdrzálek, Daniel Lokshtanov, M. S. Ramanujan:
A New Perspective on FO Model Checking of Dense Graph Classes. 176-184 - Azadeh Farzan, Zachary Kincaid, Andreas Podelski:
Proving Liveness of Parameterized Programs. 185-196 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Veronika Loitzenbauer:
Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction. 197-206
Automata Theory
- Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche:
The complexity of regular abstractions of one-counter languages. 207-216 - Luc Dartois, Emmanuel Filiot, Pierre-Alain Reynier, Jean-Marc Talbot:
Two-Way Visibly Pushdown Automata and Transducers. 217-226 - Arnaud Carayol, Christof Löding, Olivier Serre:
Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings. 227-236
Games and Logic
- Takeshi Tsukada, C.-H. Luke Ong:
Plays as Resource Terms via Non-idempotent Intersection Types. 237-246 - Krishnendu Chatterjee, Laurent Doyen:
Perfect-Information Stochastic Games with Generalized Mean-Payoff Objectives. 247-256 - Thomas Colcombet, Stefan Göller:
Games with bound guess actions. 257-266
Model Theory
- Christoph Berkholz, Jakob Nordström:
Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps. 267-276 - Lucas Heimberg, Dietrich Kuske, Nicole Schweikardt:
Hanf normal form for first-order logic with unary counting quantifiers. 277-286 - Sandra Kiefer, Pascal Schweitzer:
Upper Bounds on the Quantifier Depth for Graph Differentiation in First Order Logic. 287-296 - Michael Benedikt, Pierre Bourhis, Balder ten Cate, Gabriele Puppis:
Querying Visible and Invisible Information. 297-306
Induction/Coinduction
- Damien Pous:
Coinduction All the Way Up. 307-316 - Rasmus Ejlers Møgelberg, Marco Paviotti:
Denotational semantics of recursive types in synthetic guarded domain theory. 317-326 - Henning Basold, Herman Geuvers:
Type Theory based on Dependent Inductive and Coinductive Types. 327-336 - Dirk Pattinson, Lutz Schröder:
Program Equivalence is Coinductive. 337-346
Semantics
- James Laird:
Fixed Points In Quantitative Semantics. 347-356 - Tuomo Lempiäinen:
Ability to Count Messages Is Worth Θ(Δ) Rounds in Distributed Computing. 357-366 - Guilhem Jaber, Gabriel Lewertowski, Pierre-Marie Pédrot, Matthieu Sozeau, Nicolas Tabareau:
The Definitional Side of the Forcing. 367-376 - Amina Doumane, David Baelde, Lucca Hirschi, Alexis Saurin:
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions. 377-386
Monadic Second-Order Logic
- Emmanuel Filiot, Olivier Gauwin, Nathan Lhote:
First-order definability of rational transductions: An algebraic approach. 387-396 - Michael Elberfeld, Marlin Frickenschmidt, Martin Grohe:
Order Invariance on Decomposable Structures. 397-406 - Mikolaj Bojanczyk, Michal Pilipczuk:
Definability equals recognizability for graphs of bounded treewidth. 407-416 - Silvio Ghilardi, Sam van Gool:
Monadic second order logic as the model companion of temporal logic. 417-426
Linear Logic
- Thomas Seiller:
Interaction Graphs: Full Linear Logic. 427-436 - Dominic J. D. Hughes, Willem Heijltjes:
Conflict nets: Efficient locally canonical MALL proof nets. 437-446 - Ugo Dal Lago:
Infinitary Lambda Calculi from a Linear Perspective. 447-456
Reachability
- Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche:
First-order logic with reachability for infinite-state systems. 457-466 - Ranko Lazic, Sylvain Schmitz:
The Complexity of Coverability in ν-Petri Nets. 467-476 - Matthias Englert, Ranko Lazic, Patrick Totzke:
Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete. 477-484
Hybrid Systems
- Luca Cardelli, Mirco Tribastone, Max Tschaikowski, Andrea Vandin:
Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective. 485-494 - Brendan Fong, Pawel Sobocinski, Paolo Rapisarda:
A categorical approach to open and interconnected dynamical systems. 495-504 - Sarah M. Loos, André Platzer:
Differential Refinement Logic. 505-514 - Ventsislav Chonev, Joël Ouaknine, James Worrell:
On Recurrent Reachability for Continuous Linear Dynamical Systems. 515-524
Category Theory
- Sam Staton, Hongseok Yang, Frank D. Wood, Chris Heunen, Ohad Kammar:
Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints. 525-534 - Ross Duncan, Kevin Dunne:
Interacting Frobenius Algebras are Hopf. 535-544 - Takeo Uramoto:
Semi-galois Categories I: The Classical Eilenberg Variety Theory. 545-554 - Paul-André Melliès, Noam Zeilberger:
A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine. 555-564
Type Theory
- Kuen-Bang Hou (Favonia), Eric Finster, Daniel R. Licata, Peter LeFanu Lumsdaine:
A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory. 565-574 - Valentin Blot:
Hybrid realizability for intuitionistic and classical choice. 575-584 - Guilhem Jaber, Nikos Tzevelekos:
Trace semantics for polymorphic references. 585-594 - Nicolai Kraus:
Constructions with Non-Recursive Higher Inductive Types. 595-604 - Iosif Petrakis:
A constructive function-theoretic approach to topological compactness. 605-614
Constraint Solving
- Libor Barto, Michael Pinsker:
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. 615-622 - Manuel Bodirsky, Antoine Mottet:
Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction. 623-632 - Marcin Kozik:
Weak consistency notions for all the CSPs of bounded width. 633-641 - Andrei A. Bulatov:
Graphs of relational structures: restricted types. 642-651 - Martin C. Cooper, Stanislav Zivný:
The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns. 652-661
Kleene Award
- Steen Vester:
Winning Cores in Parity Games. 662-671
Probabilistic Models of Computation
- Federico Olmedo, Benjamin Lucien Kaminski, Joost-Pieter Katoen, Christoph Matheja:
Reasoning about Recursive Probabilistic Programs. 672-681 - Wataru Hino, Hiroki Kobayashi, Ichiro Hasuo, Bart Jacobs:
Healthiness from Duality. 682-691 - Dexter Kozen:
Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes. 692-699 - Radu Mardare, Prakash Panangaden, Gordon D. Plotkin:
Quantitative Algebraic Reasoning. 700-709
Algebraic Methods
- Filippo Bonchi, Fabio Gadducci, Aleks Kissinger, Pawel Sobocinski, Fabio Zanasi:
Rewriting modulo symmetric monoidal structure. 710-719 - Alex Galicki:
Effective Brenier Theorem: Applications to Computable Analysis and Algorithmic Randomness. 720-729 - Bakh Khoussainov:
Quantifier Free Definability on Infinite Algebras. 730-738 - Antonino Salibra, Giulio Manzonetto, Giordano Favro:
Factor Varieties and Symbolic Computation. 739-748
Logics of Programs
- Gilles Barthe, Marco Gaboardi, Benjamin Grégoire, Justin Hsu, Pierre-Yves Strub:
Proving Differential Privacy via Probabilistic Couplings. 749-758 - Alan Jeffrey, James Riely:
On Thin Air Reads Towards an Event Structures Model of Relaxed Memory. 759-767 - Viorel Preoteasa, Stavros Tripakis:
Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems. 768-777 - Wan J. Fokkink, Rob J. van Glabbeek:
Divide and Congruence II: Delay and Weak Bisimilarity. 778-787
Decidability
- Leszek Aleksander Kolodziejczyk, Henryk Michalewski:
How unprovable is Rabin's decidability theorem? 788-797 - Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell:
Solvability of Matrix-Exponential Equations. 798-806 - Thomas Zeume, Frederik Harwath:
Order-Invariance of Two-Variable Logic is Decidable. 807-816 - Michael Benedikt, Pierre Bourhis, Michael Vanden Boom:
A Step Up in Expressiveness of Decidable Fixpoint Logics. 817-826
Complexity
- Damiano Mazza:
Church Meets Cook and Levin. 827-836 - Akitoshi Kawamura, Florian Steinberg, Martin Ziegler:
Complexity Theory of (Functions on) Compact Metric Spaces. 837-846 - Diego Figueira:
Semantically Acyclic Conjunctive Queries under Functional Dependencies. 847-856
Automata Theory
- Laure Daviaud, Pierre-Alain Reynier, Jean-Marc Talbot:
A Generalised Twinning Property for Minimisation of Cost Register Automata. 857-866 - Eryk Kopczynski:
Invisible Pushdown Languages. 867-872 - Loris D'Antoni, Margus Veanes:
Minimization of Symbolic Tree Automata. 873-882
a service of 
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 2024-06-10 21: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:
