Conferences in DBLP
Klaus Ambos-Spies , Dongping Yang Honest Polynomial-Time Degrees of Elementary Recursive Sets. [Citation Graph (0, 0)][DBLP ] Conf ] Grigoris Antoniou , Volker Sperschneider On the Verification of Modules. [Citation Graph (0, 0)][DBLP ] Conf ] Egon Börger A Logical Operational Semantics of Full Prolog. Part I: Selection Core and Control. [Citation Graph (1, 0)][DBLP ] Conf ] Domenico Cantone , Vincenzo Cutello , Alberto Policriti Set-Theoretic Reductions of Hilbert's Tenth Problem. [Citation Graph (0, 0)][DBLP ] Conf ] Elias Dahlhaus The Complexity of Subtheories of the Existential Linear Theory of Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Bernd I. Dahn On Test Classes for Universal Theories. [Citation Graph (0, 0)][DBLP ] Conf ] Hendrik Decker , Lawrence Cavedon Generalizing Allowedness While Retaining Completeness of SLDNF-Resolution. [Citation Graph (1, 0)][DBLP ] Conf ] Manfred Droste , Rüdiger Göbel Effectively Given Information Systems and Domains. [Citation Graph (0, 0)][DBLP ] Conf ] Andreas Goerdt Davis-Putnam Resolution versus Unrestricted Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Grädel On Logical Descriptions of Some Concepts in Structural Complexity Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Yuri Gurevich , Lawrence S. Moss Algebraic Operational Semantics and Occam. [Citation Graph (1, 0)][DBLP ] Conf ] Jan Krajícek , Pavel Pudlák Propositional Provability and Models of Weak Arithmetic. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Leiß Polymorphic Recursion and Semi-Unification. [Citation Graph (0, 0)][DBLP ] Conf ] Alexander Leitsch Deciding Horn Classes by Hyperresolution. [Citation Graph (1, 0)][DBLP ] Conf ] Christoph Meinel Omega-Branching Programs of Bounded Width. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Mey A Predicate Calculus with Control of Derivations. [Citation Graph (0, 0)][DBLP ] Conf ] Daniele Mundici Reducibility of Monotone Formulas to µ-Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Jürgen Ohlbach New Ways for Developing Proof Theories for First-Order Multi Modal Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Michel Parigot On the Representation of Data in Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Ana Pasztor , Ildikó Sain A Streamlined Temporal Completeness Theorem. [Citation Graph (0, 0)][DBLP ] Conf ] Wojciech Penczek A Concurrent Branching Time Temporal Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Lutz Priese , Doris Nolte Semantic for Abstract Fairness using Metric Spaces. [Citation Graph (0, 0)][DBLP ] Conf ] Ewald Speckenmeyer , Rainer Kemp On the Average Time Complexity of Set Partitioning. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Stärk A Direct Proof for the Completeness of SLD-Resolution. [Citation Graph (0, 0)][DBLP ] Conf ] Robert F. Stärk A Quantifier-Free Completion of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Olga Stepánková , Petr Stepánek Stratification of Definite Clause Programs and of General Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Hugo Volger The Semantics of Disjunctive Deductive Databases. [Citation Graph (0, 0)][DBLP ] Conf ] Elisabeth Wette Sequential Representation of Primitive Recursive Functions, and Complexity Classes. [Citation Graph (0, 0)][DBLP ] Conf ] 