Conferences in DBLP
Yaniv Bargury , Johann A. Makowsky The Expressive Power of Transitive Closue and 2-way Multihead Automata. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:1-14 [Conf ] Christoph Beierle , Egon Börger Correctness Proof For the WAM with Types. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:15-34 [Conf ] Eike Best , Javier Esparza Model Checking of Persistent Petri Nets. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:35-52 [Conf ] Jawahar Chirimar , James Lipton Provability in TBLL: A Decision Procedure. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:53-67 [Conf ] Elias Dahlhaus How to Implement First Order Formulas in Local Memory Machine Models. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:68-78 [Conf ] Solomon Feferman A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:79-95 [Conf ] Tim Fernando A Primitive Recursive Set Theory and AFA: On the Logical Complexity of the Largest Bisimulation. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:96-110 [Conf ] Jörg Flum On Bounded Theories. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:111-118 [Conf ] Andreas Goerdt The Cutting Plane Proof System with Bounded Degree of Falsity. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:119-133 [Conf ] J. C. González-Moreno , Maria Teresa Hortalá-González , Mario Rodríguez-Artalejo Denotational Versus Declarative Semantics for Functional Programming. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:134-148 [Conf ] Erich Grädel On Transitive Closure Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:149-163 [Conf ] Peter Heusch , Ewald Speckenmeyer Some Aspects of the Probabilistic Behavior of Variants of Resolution. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:164-172 [Conf ] Yoram Hirshfeld Safe Queries in Relational Databases with Functions. [Citation Graph (1, 0)][DBLP ] CSL, 1991, pp:173-183 [Conf ] John N. Hooker Logical Inference and Polyhedral Projection. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:184-200 [Conf ] Brigitte Bösli Stable Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:201-212 [Conf ] M. R. K. Krishna Rao , Deepak Kapur , R. K. Shyamasundar A Transformational Methodology for Proving Termination of Logic Programs. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:213-226 [Conf ] Daniel J. Lehmann Plausibility Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:227-241 [Conf ] Hans Leiß Towards Kleene Algebra with Recursion. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:242-256 [Conf ] Karl Meinke Equational Specification of Abstract Types and Combinators. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:257-271 [Conf ] Daniele Mundici Normal Forms in Infinite-Valued Logic: The Case of One Variable. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:272-277 [Conf ] Halit Oguztüzün A Fragment of First Order Logic Adequate for Observation Equivalence. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:278-292 [Conf ] Sophie Pinchinat Ordinal Processes in Comparative Concurrency Semantics. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:293-305 [Conf ] Gerard R. Renardel de Lavalette Logical Semantics of Modularisation. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:306-315 [Conf ] Ulf R. Schmerl A Cut-Elimination Procedure Designed for Evaluating Proofs as Programs. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:316-325 [Conf ] Helmut Schwichtenberg Minimal from Classical Proofs. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:326-328 [Conf ] Sebastian Seibert Quantifier Hierarchies over Word Relations. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:329-352 [Conf ] Iain A. Stewart On Completeness for NP via Projection Translations. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:353-366 [Conf ] J. G. Thistle , W. Murray Wonham Control of omega-Automata, Church's Problem, and the Emptiness Problem for Tree omega-Automata. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:367-382 [Conf ] A. S. Troelstra Comparing the Theory of Representations and Constructive Mathematics. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:383-395 [Conf ] Jerzy Tyszkiewicz Infinitary Queries and Their Asymptotic Probabilities I: Properties Definable in Transitive Closue Logic. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:396-410 [Conf ] Andrei Voronkov On Completeness of Program Synthesis Systems. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:411-418 [Conf ] Andreas Weiermann Proving Termination for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP ] CSL, 1991, pp:419-428 [Conf ]