Conferences in DBLP
Wu Wen-Tsün The Char-Set Method and Its Applications to Automated Reasoning. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:1-3 [Conf ] Irène Durand , Aart Middeldorp Decidable Call by Need Computations in term Rewriting (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:4-18 [Conf ] Franz Baader , Cesare Tinelli A New Approach for Combining Decision Procedure for the Word Problem, and Its Connection to the Nelson-Oppen Combination Method. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:19-33 [Conf ] Joachim Niehren , Manfred Pinkal , Peter Ruhrberg On Equality Up-to Constraints over Finite Trees, Context Unification, and One-Step Rewriting. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:34-48 [Conf ] Robert Nieuwenhuis , José Miguel Rivero , Miguel Ángel Vallejo Dedan: A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:49-52 [Conf ] Maria Paola Bonacina The Clause-Diffusion Theorem Prover Peers-mcd (System Description). [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:53-56 [Conf ] Bernd I. Dahn , Jürgen Gehne , Th. Honigmann , Andreas Wolf Integration of Automated and Interactive Theorem Proving in ILP. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:57-60 [Conf ] Andreas Wolf , Johann Schumann ILF-SETHEO: Processing Model Elimination Proofs for Natural Language Output. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:61-64 [Conf ] Bernd Fischer , Johann Schumann SETHEO Goes Software Engineering: Application of ATP to Software Reuse. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:65-68 [Conf ] Wolfgang Reif , Gerhard Schellhorn , Kurt Stenzel Proving System Correctness with KIV 3.0. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:69-72 [Conf ] Lu Yang , Hongguang Fu , Zhenbing Zeng A Practical Symbolic Algorithm for the Inverse Kinematics of 6R Manipulators with Simple Geometry. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:73-86 [Conf ] Johann Schumann Automatic Verification of Cryptographic Protocols with SETHEO. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:87-100 [Conf ] Nikolaj Bjørner , Mark E. Stickel , Tomás E. Uribe A Practical Integration of First-Order Reasoning and Decision Procedures. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:101-115 [Conf ] Uwe Egly Some Pitfalls of LK-to-LJ Translations and How to Avoid Them. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:116-130 [Conf ] Daniel S. Korn , Christoph Kreitz Deciding Intuitionistic Propositional Logic via Translation into Classical Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:131-145 [Conf ] Koji Iwanuma Lemma Matching for a PTTP-based Top-down Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:146-160 [Conf ] Olivier Roussel , Philippe Mathieu Exact Kanowledge Compilation in Predicate Calculus: The Partial Achievement Case. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:161-175 [Conf ] Ryuzo Hasegawa , Katsumi Inoue , Yoshihiko Ohta , Miyuki Koshimura Non-Horn Magic Sets to Incorporate Top-down Inference into Bottom-up Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:176-190 [Conf ] Moshe Y. Vardi Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:191-206 [Conf ] Christoph Kreitz , Heiko Mantel , Jens Otten , Stephan Schmitt Connection-Based Proof Construction in Linear Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:207-221 [Conf ] James Harland , David J. Pym Resource-Distribution via Boolean Constraint (Extended Abstract). [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:222-236 [Conf ] Mary Cryan , Allan Ramsay Constructing a Normal Form for Property Theory. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:237-251 [Conf ] Christoph Benzmüller , Lassaad Cheikhrouhou , Detlef Fehrer , Armin Fiedler , Xiaorong Huang , Manfred Kerber , Michael Kohlhase , Karsten Konrad , Andreas Meier , Erica Melis , Wolf Schaarschmidt , Jörg H. Siekmann , Volker Sorge Omega: Towards a Mathematical Assistant. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:252-255 [Conf ] Thomas Kolbe , Jürgen Brauburger Plagiator - A Learning Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:256-259 [Conf ] Dirk Fuchs , Matthias Fuchs CODE: A Powerful Prover for Problems of Condensed Detachment. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:260-263 [Conf ] Fausto Giunchiglia , Marco Roveri , Roberto Sebastiani A New Method for Testing Decision Procedures in Modal Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:264-267 [Conf ] John K. Slaney Minlog: A Minimal Logic Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:268-271 [Conf ] Hantao Zhang SATO: An Efficient Propositional Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:272-275 [Conf ] Louise A. Dennis , Alan Bundy , Ian Green Using A Generalisation Critic to Find Bisimulations for Coinductive Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:276-290 [Conf ] Dieter Hutter , Michael Kohlhase A Colored Version of the Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:291-305 [Conf ] Seán Matthews A Practical Implementation of Simple Consequence Relations Using Inductive Definitions. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:306-320 [Conf ] Harald Ganzinger , Christoph Meyer , Christoph Weidenbach Soft Typing for Ordered Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:321-335 [Conf ] Hans de Nivelle A Classification of Non-liftable Orders for Resolution. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:336-350 [Conf ] Amy P. Felty , Douglas J. Howe Hybrid Interactive Theorem Proving Using Nuprl and HOL. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:351-365 [Conf ] Katherine A. Eastaughffe , Maris A. Ozols , Anthony Cant Proof Tactics for a Theory of State Machines in a Graphical Environment. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:366-379 [Conf ] David von Oheimb , Thomas F. Gritzner RALL: Machine-Supported Proofs for Relation Algebra. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:380-394 [Conf ] Jason J. Hickey Nuprl-Light: An Implementation Framework for Higher-Order Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:395-399 [Conf ] Maris A. Ozols , Anthony Cant , Katherine A. Eastaughffe XIsabelle: A System Description. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:400-403 [Conf ] Helen Lowe , David Duncan XBarnacle: Making Theorem Provers More Accessible. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:404-407 [Conf ] Mathias Kettner , Norbert Eisinger The Tableau Browser SNARKS. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:408-411 [Conf ] Richard Bornat , Bernard Sufrin Jape: A Calculator for Animating Proof-on-Paper. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:412-415 [Conf ] Matthias Fuchs Evolving Combinators. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:416-430 [Conf ] Gilles Défourneaux , Nicolas Peltier Partial Matching for Analogy Discovery in Proofs and Counter-Examples. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:431-445 [Conf ] Jürgen Ehrensberger , Claus Zinn DiaLog: A System for Dialogue Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1997, pp:446-460 [Conf ]