Conferences in DBLP
Petr Hájek Trakhtenbrot Theorem and Fuzzy Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Schwentick Descriptive Complexity, Lower Bounds and Linear Time. [Citation Graph (0, 0)][DBLP ] Conf ] Mihalis Yannakakis , David Lee Testing for Finite State Systems. [Citation Graph (0, 0)][DBLP ] Conf ] David Kempe , Arno Schöegge On the Power of Quantifers in First-Order Algebraic Specification. [Citation Graph (0, 0)][DBLP ] Conf ] Fosca Giannotti , Giuseppe Manco , Mirco Nanni , Dino Pedreschi On the Effective Semantics of Nondeterministic, Nonmonotonic, Temporal Logic Databases. [Citation Graph (0, 0)][DBLP ] Conf ] V. Wiktor Marek , Inna Pivkina , Miroslaw Truszczynski Revision Programming = Logic Programming + Integrity Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Uwe Egly Quantifers and the System KE: Some Surprising Results. [Citation Graph (0, 0)][DBLP ] Conf ] H. Khanh Hoang Choice Construct and Lindström Logics. [Citation Graph (0, 0)][DBLP ] Conf ] Martin Kreidler , Detlef Seese Monadic NP and Graph Minors. [Citation Graph (0, 0)][DBLP ] Conf ] Johann A. Makowsky Invariant Definability and P/poly . [Citation Graph (0, 0)][DBLP ] Conf ] Elena Pezzoli Computational Complexity of Ehrenfeucht-Fraïssé Games on Finite Structures. [Citation Graph (0, 0)][DBLP ] Conf ] Hans Kleine Büning An Upper Bound for Minimal Resolution Refutations. [Citation Graph (0, 0)][DBLP ] Conf ] Zenon Sadowski On an Optimal Deterministic Algorithm for SAT. [Citation Graph (0, 0)][DBLP ] Conf ] Margarita V. Korovina , Oleg V. Kudinov Characteristic Properties of Majorant-Computability over the Reals. [Citation Graph (0, 0)][DBLP ] Conf ] Ján Komara , Paul J. Voda Theorems af Péter and Parsons in Computer Programming. [Citation Graph (0, 0)][DBLP ] Conf ] Jaques Riche , Robert K. Meyer Belnap, Urquhart and Relevant Decidability & Complexity. ``Das ist nicht Mathematik, das ist Theologie.''. [Citation Graph (0, 0)][DBLP ] Conf ] Gilles Barthe Existence and Uniqueness of Normal Forms in Pure Type Systems with betaeta-Conversion. [Citation Graph (0, 0)][DBLP ] Conf ] Zurab Khasidashvili , Adolfo Piperno Normalization of Typable Terms by Superdevelopments. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei G. Vorobyov Subtyping Functional+Nonempty Record Types. [Citation Graph (0, 0)][DBLP ] Conf ] Ralph Matthes Monotone Fixed-Point Types and Strong Normalization. [Citation Graph (0, 0)][DBLP ] Conf ] Richard Statman Morphisms and Partitions of V-sets. [Citation Graph (0, 0)][DBLP ] Conf ] Alex K. Simpson Computational Adequacy in an Elementary Topos. [Citation Graph (0, 0)][DBLP ] Conf ] Thorsten Altenkirch Logical Relations and Inductive/Coinductive Types. [Citation Graph (0, 0)][DBLP ] Conf ] Reinhard Pichler On the Complexity of H-Subsumption. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Bonfante , Adam Cichon , Jean-Yves Marion , Hélène Touzet Complexity Classes and Rewrite Systems with Polynomial Interpretation. [Citation Graph (0, 0)][DBLP ] Conf ] Paliath Narendran , Michaël Rusinowitch , Rakesh M. Verma RPO Constraint Solving Is in NP. [Citation Graph (0, 0)][DBLP ] Conf ] Matthias Baaz , Helmut Veith Quantifier Elimination in Fuzzy Logic. [Citation Graph (0, 0)][DBLP ] Conf ] Thomas Lukasiewicz Many-Valued First-Order Logics with Probabilistic Semantics. [Citation Graph (0, 0)][DBLP ] Conf ] 