Conferences in DBLP
Evangelia Antonakos Justified and Common Knowledge: Limited Conservativity. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:1-11 [Conf ] Sergei N. Artëmov , Eduardo Bonelli The Intensional Lambda Calculus. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:12-25 [Conf ] Arnon Avron , Anna Zamansky Generalized Non-deterministic Matrices and (n, k)-ary Quantifiers. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:26-40 [Conf ] Howard A. Blair , David W. Jakel , Robert J. Irwin , Angel Rivera Elementary Differential Calculus on Discrete and Hybrid Structures. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:41-53 [Conf ] Benedikt Bollig , Ingmar Meinecke Weighted Distributed Systems and Their Logics. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:54-68 [Conf ] Patricia Bouyer , Thomas Brihaye , Fabrice Chevalier Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata! [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:69-83 [Conf ] Davide Bresolin , Valentin Goranko , Angelo Montanari , Guido Sciavicco On Decidability and Expressiveness of Propositional Interval Neighborhood Logics. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:84-99 [Conf ] Rémi Brochenin , Stéphane Demri , Étienne Lozes Reasoning About Sequences of Memory States. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:100-114 [Conf ] Guillaume Burel , Claude Kirchner Cut Elimination in Deduction Modulo by Abstract Completion. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:115-131 [Conf ] Agata Ciabattoni , George Metcalfe Density Elimination and Rational Completeness for First-Order Logics. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:132-146 [Conf ] Robert L. Constable , Wojciech Moczydlowski Extracting the Resolution Algorithm from a Completeness Proof for the Propositional Calculus. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:147-161 [Conf ] Jennifer M. Davoren Topological Semantics and Bisimulations for Intuitionistic Modal Logics and Their Classical Companion Logics. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:162-179 [Conf ] Stéphane Demri , Deepak D'Souza , Régis Gascon A Decidable Temporal Logic of Repeating Values. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:180-194 [Conf ] Kai Engelhardt , Peter Gammie , Ron van der Meyden Model Checking Knowledge and Linear Time: PSPACE Cases. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:195-211 [Conf ] Melvin Fitting Realizations and LP. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:212-223 [Conf ] Raffaella Gentilini , Klaus Schneider , B. Mishra Successive Abstractions of Hybrid Automata for Monotonic CTL Model Checking. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:224-240 [Conf ] Evan Goris Explicit Proofs in Formal Provability Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:241-253 [Conf ] Srikanth Gottipati , Anil Nerode A Synthesis Algorithm for Hybrid Systems. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:254-268 [Conf ] Bernhard Heinemann Including the Past in 'Topologic'. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:269-283 [Conf ] Max I. Kanovich A Note on Rewriting Proofs and Fibonacci Numbers. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:284-292 [Conf ] Bakhadyr Khoussainov , Jiamou Liu On Complexity of Ehrenfeucht-Fraïssé Games. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:293-309 [Conf ] Bjørn Kjos-Hanssen , Anil Nerode The Law of the Iterated Logarithm for Algorithmically Random Brownian Motion. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:310-317 [Conf ] Hidenori Kurokawa Hypersequent Calculus for Intuitionistic Logic with Classical Atoms. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:318-331 [Conf ] Roman Kuznets Proof Identity for Classical Logic: Generalizing to Normality. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:332-348 [Conf ] Robert S. Lubarsky , Michael Rathjen On the Constructive Dedekind Reals: Extended Abstract. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:349-362 [Conf ] Zohar Manna , Henny B. Sipma , Ting Zhang Verifying Balanced Trees. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:363-378 [Conf ] Victor W. Marek , Jeffrey B. Remmel Compactness Properties for Stable Semantics of Logic Programs. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:379-400 [Conf ] Virgile Mogbil , Vincent Rahli Uniform Circuits, & Boolean Proof Nets. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:401-421 [Conf ] André Nies , Pavel Semukhin Finite Automata Presentable Abelian Groups. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:422-436 [Conf ] Michael O'Connor Embeddings into Free Heyting Algebras and Translations into Intuitionistic Propositional Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:437-448 [Conf ] Rohit Parikh Some Puzzles About Probability and Probabilistic Conditionals. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:449-456 [Conf ] André Platzer A Temporal Dynamic Logic for Verifying Hybrid System Invariants. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:457-471 [Conf ] Brian F. Redmond Multiplexor Categories and Models of Soft Linear Logic. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:472-485 [Conf ] Vladimir V. Rybakov Until-Since Temporal Logic Based on Parallel Time with Common Past. Deciding Algorithms. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:486-497 [Conf ] David Steiner , Thomas Studer Total Public Announcements. [Citation Graph (0, 0)][DBLP ] LFCS, 2007, pp:498-511 [Conf ]