Conferences in DBLP
Jörg H. Siekmann Universal Unification. [Citation Graph (1, 0)][DBLP ] CADE, 1984, pp:1-42 [Conf ] Ewing L. Lusk , Ross A. Overbeek A Portable Environment for Research in Automated Reasoning. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:43-52 [Conf ] Deepak Kapur , Balakrishnan Krishnamurthy A Natural Proof System Based on rewriting Techniques. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:53-64 [Conf ] Jussi Ketonen EKL - A Mathematically Oriented Proof Checker. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:65-79 [Conf ] Silvio Ursic A Linear Characterization of NP-Complete Problems. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:80-100 [Conf ] Allen Van Gelder A Satisfiability Tester for Non-Clausal Propositional Calculus. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:101-112 [Conf ] Ana R. Cavalli , Luis Fariñas del Cerro A Decision Method for Linear Temporal Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:113-127 [Conf ] Dallas Lankford , Gregory Butler II , A. Michael Ballantyne A Progress Report on New Decision Algorithms for Finitely Prsented Abelian Groups. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:128-141 [Conf ] Philippe le Chenadec Canonical Forms in Finitely Presented Algebras. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:142-165 [Conf ] Pierre Lescanne Term Rewriting Systems and Algebra. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:166-174 [Conf ] Jean-Pierre Jouannaud , Miguel Munoz Termination of a Set of Rules Modulo a Set of Equations. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:175-193 [Conf ] François Fages Associative-Commutative Unification. [Citation Graph (1, 0)][DBLP ] CADE, 1984, pp:194-208 [Conf ] Donald Simon A Linear Time Algorithm for a Subcase of Second Order Instantiation. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:209-223 [Conf ] Claude Kirchner A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:224-247 [Conf ] Mark E. Stickel A Case Study of Theorem Proving by the Knuth-Bendix Method: Discovering That x³=x Implies Ring Commutativity. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:248-258 [Conf ] Laurent Fribourg A Narrowing Procedure for Theories with Constructors. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:259-281 [Conf ] Hélène Kirchner A General Inductive Completion Algorithm and Application to Abstract Data Types. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:282-302 [Conf ] Patrick Suppes The Next Generation of Interactive Theorem Provers. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:303-315 [Conf ] Larry Wos , Robert Veroff , B. Smith , William McCune The Linked Inference Principle, II: The User's Viewpoint. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:316-332 [Conf ] Etienne Paul A New Interpretation of the Resolution Principle. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:333-355 [Conf ] David A. Plaisted Using Examples, Case Analysis, and Dependency Graphs in Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:356-374 [Conf ] Dale Miller Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:375-393 [Conf ] Frank Pfenning Analytic and Non-analytic Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:394-413 [Conf ] Jack Minker , Donald Perlis Applications of Protected Circumscription. [Citation Graph (4, 0)][DBLP ] CADE, 1984, pp:414-425 [Conf ] Kenneth Forsythe , Stan Matwin Implementation Strategies for Plan-Based Deduction. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:426-444 [Conf ] David A. Schmidt A Programming Notation for Tactical Reasoning. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:445-459 [Conf ] Ketan Mulmuley The Mechanization of Existence Proofs of Recursive Predicates. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:460-475 [Conf ] Alex Pelin , Jean H. Gallier Solving Word Problems in Free Algebras Using Complexity Functions. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:476-495 [Conf ] Hans Jürgen Ohlbach , Graham Wrightson Solving a Problem in Relevance Logic with an Automated Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1984, pp:496-508 [Conf ]