Conferences in DBLP
Luigia Carlucci Aiello , Richard W. Weyhrauch Using Meta-Theoretic Reasoning to do Algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Gábor Belovári , J. A. Campbell Generating Contours of Integration: An Application of Prolog in Symbolic Computing. [Citation Graph (0, 0)][DBLP ] Conf ] Alan Bundy , Bob Welham Using Meta-Level Inference for Selective Application of Multiple Rewrite Rules in Algebraic Manipulation. [Citation Graph (0, 0)][DBLP ] Conf ] Chris Goad Proofs as Description of Computation. [Citation Graph (0, 0)][DBLP ] Conf ] Gérard D. Guiho , Christian Gresse Program Synthesis from Incomplete Specifiactions. [Citation Graph (0, 0)][DBLP ] Conf ] Laurent Kott A System for Proving Equivalences of Recursive Programs. [Citation Graph (0, 0)][DBLP ] Conf ] W. W. Bledsoe , Larry M. Hines Variable Elimination and Chaining in a Resolution-based Prover for Inequalities. [Citation Graph (1, 0)][DBLP ] Conf ] Alfredo Ferro , Eugenio G. Omodeo , Jacob T. Schwartz Decision Procedures for Some Fragments of Set Theory. [Citation Graph (0, 0)][DBLP ] Conf ] Donald W. Loveland , Robert E. Shostak Simplifying Interpreted Formulas. [Citation Graph (0, 0)][DBLP ] Conf ] Frederick C. Furtek Specification and Verification of Real-Time, Distributed Systems Using the Theory of Constraints. [Citation Graph (0, 0)][DBLP ] Conf ] Leonard Friedman Reasoning by Plausible Inference. [Citation Graph (0, 0)][DBLP ] Conf ] Alan M. Thompson Logical Support in a Time-Varying Model. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Y. Gloess An Experiment with the Boyer-Moore Theorem Prover: A Proof of the Correctness of a Simple Parser of Expressions. [Citation Graph (0, 0)][DBLP ] Conf ] Jacek Leszczylowski An Experiment with "Edinburgh LCF". [Citation Graph (0, 0)][DBLP ] Conf ] Rob Nederpelt An Approach to Theorem Proving on the Basis of a Typed Lambda-Calculus. [Citation Graph (0, 0)][DBLP ] Conf ] Paul Y. Gloess , Jean-Pierre H. Laurent Adding Dynamic Paramodulation to Rewrite Algorithms. [Citation Graph (0, 0)][DBLP ] Conf ] Larry Wos , Ross A. Overbeek , Lawrence J. Henschen Hyperparamodulation: A Refinement of Paramodulation. [Citation Graph (0, 0)][DBLP ] Conf ] Roddy W. Erickson , David R. Musser The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Ross A. Overbeek , Ewing L. Lusk Data Structures and Control Architectures for Implementation of Theorem-Proving Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Helga Noll A Note on Resolution: How to Get Rid of Factoring without Loosing Completeness. [Citation Graph (0, 0)][DBLP ] Conf ] David A. Plaisted Abstraction Mappings in Mechanical Theorem Proving. [Citation Graph (0, 0)][DBLP ] Conf ] Peter B. Andrews Transforming Matings into Natural Deduction Proofs. [Citation Graph (0, 0)][DBLP ] Conf ] Maurice Bruynooghe Analysis of Dependencies to Improve the Behaviour of Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Luís Moniz Pereira , António Porto Selective Backtracking for Logic Programs. [Citation Graph (0, 0)][DBLP ] Conf ] Jean-Marie Hullot Canonical Forms and Unification. [Citation Graph (1, 0)][DBLP ] Conf ] Hans-Josef Jeanrond Deciding Unique Termination of Permutative Rewriting Systems: Choose Your Term Algebra Carefully. [Citation Graph (0, 0)][DBLP ] Conf ] Joseph A. Goguen How to Prove Algebraic Inductive Hypotheses Without Induction. [Citation Graph (0, 0)][DBLP ] Conf ] Philip T. Cox , Tomasz Pietrzykowski A Complete, Nonredundant Algorithm for Reversed Skolemization. [Citation Graph (0, 0)][DBLP ] Conf ] 