Conferences in DBLP
Philippe de Groote A dynamic programming approach to categorial deduction. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:1-15 [Conf ] Stéphane Demri , Rajeev Goré Tractable Transformations from Modal Provability Logics into First-Order Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:16-30 [Conf ] Erich Grädel Invited Talk: Decision procedures for guarded logics. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:31-51 [Conf ] Stephan Tobies A PSpace Algorithm for Graded Modal Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:52-66 [Conf ] Manfred Schmidt-Schauß , Klaus U. Schulz Solvability of Context Equations with Two Context Variables is Decidable. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:67-81 [Conf ] Tomasz Wierzbicki Complexity of the higher order matching. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:82-96 [Conf ] Reinhard Pichler Solving Equational Problems Efficiently. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:97-111 [Conf ] A. A. Adams , Hanne Gottliebsen , Steve Linton , Ursula Martin VSDITLU: a verifiable symbolic definite integral table look-up. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:112-126 [Conf ] Predrag Janicic , Alan Bundy , Ian Green A Framework for the Flexible Integration of a Class of Decision Procedures into Theorem Provers. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:127-141 [Conf ] Helmut Horacek Presenting Proofs in a Human-Oriented Way. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:142-156 [Conf ] Viorica Sofronie-Stokkermans On the Universal Theory of Varieties of Distributive Lattices with Operators: Some Decidability and Complexity Results. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:157-171 [Conf ] Ullrich Hustadt , Renate A. Schmidt Maslov's Class K Revisited. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:172-186 [Conf ] Carlos Areces , Hans de Nivelle , Maarten de Rijke Prefixed Resolution: A Resolution Method for Modal and Description Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:187-201 [Conf ] Frank Pfenning , Carsten Schürmann System Description: Twelf - A Meta-Logical Framework for Deductive Systems. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:202-206 [Conf ] Serge Autexier , Dieter Hutter , Heiko Mantel , Axel Schairer System Description: inka 5.0 - A Logic Voyager. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:207-211 [Conf ] Matthias Baaz , Alexander Leitsch , Georg Moser System Description: CutRes 0.1: Cut Elimination by Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:212-216 [Conf ] Andreas Franke , Michael Kohlhase System Description: MathWeb, an Agent-Based Communication Layer for Distributed Automated Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:217-221 [Conf ] E. Pascal Gribomont , Nachaat Salloum System Description: Using OBDD's for the validation of Skolem verification conditions. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:222-226 [Conf ] Jason Hickey Fault-Tolerant Distributed Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:227-231 [Conf ] Thomas Hillenbrand , Andreas Jaeger , Bernd Löchner System Description: Waldmeister - Improvements in Performance and Ease of Use. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:232-236 [Conf ] Amy P. Felty , Douglas J. Howe , Abhik Roychoudhury Formal Metatheory using Implicit Syntax, and an Application to Data Abstraction for Asynchronous Systems. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:237-251 [Conf ] Frédéric Prost A formalization of Static Analyses in System F. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:252-266 [Conf ] Sergei N. Artëmov On Explicit Reflection in Theorem Proving and Formal Verification. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:267-281 [Conf ] Karsten Konrad , David A. Wolfram System Description: Kimba, A Model Generator for Many-Valued First-Order Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:282-286 [Conf ] Gopalan Nadathur , Dustin J. Mitchell System Description: Teyjus - A Compiler and Abstract Machine Based Implementation of lambda-Prolog. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:287-291 [Conf ] Alexandre Riazanov , Andrei Voronkov Vampire. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:292-296 [Conf ] Stephan Schulz System Abstract: E 0.3. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:297-301 [Conf ] Robert Nieuwenhuis Invited Talk: Rewrite-based Deduction and Symbolic Constraints. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:302-313 [Conf ] Christoph Weidenbach Towards an Automatic Analysis of Security Protocols in First-Order Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:314-328 [Conf ] Peter Baumgartner , Norbert Eisinger , Ulrich Furbach A Confluent Connection Calculus. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:329-343 [Conf ] Marc Fuchs , Dirk Fuchs Abstraction-Based Relevancy Testing for Model Elimination. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:344-358 [Conf ] Matthew Bishop A Breadth-First Strategy for Mating Search. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:359-373 [Conf ] Dieter Hutter , Alan Bundy The Design of the CADE-16 Inductive Theorem Prover Contest. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:374-377 [Conf ] Christoph Weidenbach System Description: Spass Version 1.0.0. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:378-382 [Conf ] Andrei Voronkov KK: a theorem prover for K. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:383-387 [Conf ] Jon Whittle , Alan Bundy , Richard J. Boulton , Helen Lowe System Description: CyNTHIA. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:388-392 [Conf ] Jian Zhang System Description: MCS: Model-based Conjecture Searching. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:393-397 [Conf ] Tobias Nipkow Invited Talk: Embedding Programming Languages in Theorem Provers (Abstract). [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:398- [Conf ] Christoph Benzmüller Extensional Higher-Order Paramodulation and RUE-Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:399-413 [Conf ] Raul H. C. Lopes Automatic Generation of Proof Search Strategies for Second-order Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1999, pp:414-428 [Conf ]