Conferences in DBLP
Samson Abramsky Full Completeness: Interactive and Geometric Characterizations of the Space of Proofs (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Luca de Alfaro The Symbolic Approach to Repeated Games (Abstract). [Citation Graph (0, 0)][DBLP ] Conf ] Arnold Beckmann Proofs, Programs and Abstract Complexity. [Citation Graph (0, 0)][DBLP ] Conf ] Anuj Dawar Model-Checking First-Order Logic: Automata and Locality. [Citation Graph (0, 0)][DBLP ] Conf ] Orna Kupferman Tightening the Exchange Rates Between Automata. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Gawlitza , Helmut Seidl Precise Relational Invariants Through Strategy Iteration. [Citation Graph (0, 0)][DBLP ] Conf ] Eryk Kopczynski Omega-Regular Half-Positional Winning Conditions. [Citation Graph (0, 0)][DBLP ] Conf ] Jan Obdrzálek Clique-Width and Parity Games. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Rabinovich , Wolfgang Thomas Logical Refinements of Church's Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Anuj Dawar , David Richerby The Power of Counting Logics on Restricted Classes of Finite Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Parosh Aziz Abdulla , Giorgio Delzanno , Laurent Van Begin Comparing the Expressive Power of Well-Structured Transition Systems. [Citation Graph (0, 0)][DBLP ] Conf ] Olivier Finkel , Dominique Lecomte There Exist Some omega -Powers of Any Borel Rank. [Citation Graph (0, 0)][DBLP ] Conf ] Emmanuel Filiot , Jean-Marc Talbot , Sophie Tison Satisfiability of a Spatial Logic with Tree Variables. [Citation Graph (0, 0)][DBLP ] Conf ] Mikolaj Bojanczyk Forest Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Arnaud Carayol , Christof Löding MSO on the Infinite Binary Tree: Choice and Order. [Citation Graph (0, 0)][DBLP ] Conf ] Hervé Fournier , Danièle Gardy , Antoine Genitrini , Marek Zaionc Classical and Intuitionistic Logic Are Asymptotically Identical. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Bodirsky , Hubie Chen Qualitative Temporal and Spatial Reasoning Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Bagan , Arnaud Durand , Etienne Grandjean On Acyclic Conjunctive Queries and Constant Delay Enumeration. [Citation Graph (0, 0)][DBLP ] Conf ] Konstantin Korovin , Andrei Voronkov Integrating Linear Arithmetic into Superposition Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Delia Kesner The Theory of Calculi with Explicit Substitutions Revisited. [Citation Graph (0, 0)][DBLP ] Conf ] Marco Gaboardi , Simona Ronchi Della Rocca A Soft Type Assignment System for lambda -Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Chantal Berline , Giulio Manzonetto , Antonino Salibra Lambda Theories of Effective Lambda Models. [Citation Graph (0, 0)][DBLP ] Conf ] Søren B. Lassen , Paul Blain Levy Typed Normal Form Bisimulation. [Citation Graph (0, 0)][DBLP ] Conf ] Antonio Bucciarelli , Thomas Ehrhard , Giulio Manzonetto Not Enough Points Is Enough. [Citation Graph (0, 0)][DBLP ] Conf ] Alexandre Miquel Classical Program Extraction in the Calculus of Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] Frédéric Blanqui , Jean-Pierre Jouannaud , Pierre-Yves Strub Building Decision Procedures in the Calculus of Inductive Constructions. [Citation Graph (0, 0)][DBLP ] Conf ] P. Weis , Neil Immerman Structure Theorem and Strict Alternation Hierarchy for FO2 on Words. [Citation Graph (0, 0)][DBLP ] Conf ] Stefan Göller On the Complexity of Reasoning About Dynamic Policies. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Aehlig , Stephen Cook , Phuong Nguyen Relativizing Small Complexity Classes and Their Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Yijia Chen , Jörg Flum Subexponential Time and Fixed-Parameter Tractability: Exploiting the Miniaturization Mapping. [Citation Graph (0, 0)][DBLP ] Conf ] Dale Miller , Alexis Saurin From Proofs to Focused Proofs: A Modular Proof of Focalization in Linear Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Naohiko Hoshino Linear Realizability. [Citation Graph (0, 0)][DBLP ] Conf ] Paulin Jacobé de Naurois , Virgile Mogbil Correctness of Multiplicative (and Exponential) Proof Structures is NL -Complete. [Citation Graph (0, 0)][DBLP ] Conf ] Chuck Liang , Dale Miller Focusing and Polarization in Intuitionistic Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Dale Miller , Vivek Nigam Incorporating Tables into Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Joxe Gaintzarain , Montserrat Hermo , Paqui Lucio , Marisa Navarro , Fernando Orejas A Cut-Free and Invariant-Free Sequent Calculus for PLTL. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Burel Unbounded Proof-Length Speed-Up in Deduction Modulo. [Citation Graph (0, 0)][DBLP ] Conf ] Klaus Aehlig , Arnold Beckmann Propositional Logic for Circuit Classes. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Hertel , Alasdair Urquhart Game Characterizations and the PSPACE-Completeness of Tree Resolution Space. [Citation Graph (0, 0)][DBLP ] Conf ] Jean Goubault-Larrecq Continuous Previsions. [Citation Graph (0, 0)][DBLP ] Conf ] Andrzej S. Murawski Bad Variables Under Control. [Citation Graph (0, 0)][DBLP ] Conf ] Guy McCusker , David Pym A Games Model of Bunched Implications. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Grohe , Martin Hyland , Johann A. Makowsky , Damian Niwinski The Ackermann Award 2007. [Citation Graph (0, 0)][DBLP ] Conf ] 