default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7th GandALF 2016: Catania, Italy
- Domenico Cantone, Giorgio Delzanno:
Proceedings of the Seventh International Symposium on Games, Automata, Logics and Formal Verification, GandALF 2016, Catania, Italy, 14-16 September 2016. EPTCS 226, 2016 - Patrick Ah-Fat, Michael Huth:
Partial Solvers for Parity Games: Effective Polynomial-Time Composition. 1-15 - Carlos Areces
, Raul Fervari, Guillaume Hoffmann, Mauricio Martel:
Relation-Changing Logics as Fragments of Hybrid Logics. 16-29 - Massimo Benerecetti, Daniele Dell'Erba, Fabio Mogavero:
A Delayed Promotion Policy for Parity Games. 30-45 - Nick Bezhanishvili, Clemens Kupke:
Games for Topological Fixpoint Logic. 46-60 - Patricia Bouyer, Nicolas Markey, Daniel Stan:
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games. 61-75 - Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron, Pietro Sala:
Model Checking the Logic of Allen's Relations Meets and Started-by is PNP-Complete. 76-90 - Davide Bresolin, Emilio Muñoz-Velasco, Guido Sciavicco:
On the Expressive Power of Sub-Propositional Fragments of Modal Logic. 91-104 - Florian Bruse:
Alternation Is Strict For Higher-Order Modal Fixpoint Logic. 105-119 - Florian Bruse, Daniel Kernberger, Martin Lange:
A Canonical Model Construction for Iteration-Free PDL with Intersection. 120-134 - Véronique Bruyère, Quentin Hautem, Mickael Randour:
Window parity games: an alternative approach toward parity games with time bounds. 135-148 - Manfred Droste, George Rahonis:
Weighted Linear Dynamic Logic. 149-163 - Gaëlle Fontaine, Fabio Mogavero, Aniello Murano, Giuseppe Perelli, Loredana Sorrentino:
Cycle Detection in Computation Tree Logic. 164-177 - Pierre Ganty, Damir Valput:
Bounded-oscillation Pushdown Automata. 178-197 - Miika Hannula, Juha Kontinen, Martin Lück, Jonni Virtema:
On Quantified Propositional Logics and the Exponential Time Hierarchy. 198-212 - Milka Hutagalung, Norbert Hundeshagen, Dietrich Kuske, Martin Lange, Étienne Lozes:
Multi-Buffer Simulations for Trace Language Inclusion. 213-227 - Swen Jacobs, Leander Tentrup, Martin Zimmermann:
Distributed PROMPT-LTL Synthesis. 228-241 - Stéphane Le Roux, Arno Pauly:
A Semi-Potential for Finite and Infinite Sequential Games (Extended Abstract). 242-256 - Tomer Libal, Marco Volpe:
Certification of Prefixed Tableau Proofs for Modal Logic. 257-271 - Yoshiki Nakamura:
The Almost Equivalence by Asymptotic Probabilities for Regular Languages and Its Computational Complexities. 272-286 - Mark Reynolds:
A New Rule for LTL Tableaux. 287-301 - Leander Tentrup, Alexander Weinert, Martin Zimmermann:
Approximating Optimal Bounds in Prompt-LTL Realizability in Doubly-exponential Time. 302-315
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-11-15 19:18 CET 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:
