Conferences in DBLP
Robert S. Boyer , J. Strother Moore A Theorem Prover for a Computational Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:1-15 [Conf ] Xumin Nie , David A. Plaisted A Complete Semantic Back Chaining Proof System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:16-27 [Conf ] John K. Slaney , Ewing L. Lusk Parallelizing the Closure Computation in Automated Deduction. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:28-39 [Conf ] Johann Schumann , Reinhold Letz PARTHEO: A High-Performance Parallel Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:40-56 [Conf ] Sang Ho Lee , Lawrence J. Henschen Substitution-based Compilation of Extended Rules in Deductive Databases. [Citation Graph (2, 0)][DBLP ] CADE, 1990, pp:57-71 [Conf ] Newton C. A. da Costa , Lawrence J. Henschen , James J. Lu , V. S. Subrahmanian Automatic Theorem Proving in Paraconsistent Logics: Theory and Implementation. [Citation Graph (1, 0)][DBLP ] CADE, 1990, pp:72-86 [Conf ] Toshiro Wakayama , T. H. Payne Case-Free Programs: An Abstraction of Definite Horn Programs. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:87-101 [Conf ] Chitta Baral , Jorge Lobo , Jack Minker Generalized Well-founded Semantics for Logic Programs (Extended Abstract). [Citation Graph (3, 0)][DBLP ] CADE, 1990, pp:102-116 [Conf ] Maritta Heisel , Wolfgang Reif , Werner Stephan Tactical Theorem Proving in Program Verification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:117-131 [Conf ] Alan Bundy , Frank van Harmelen , Alan Smaill , Andrew Ireland Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:132-146 [Conf ] Dieter Hutter Guiding Induction Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:147-161 [Conf ] Uday S. Reddy Term Rewriting Induction. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:162-177 [Conf ] Hans-Jürgen Bürckert A Resolution Principle for Clauses with Constraints. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:178-192 [Conf ] Larry M. Hines Str+ve-Subset: The Str+ve-based Subset Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:193-206 [Conf ] Shang-Ching Chou , Xiao-Shan Gao Ritt-Wu's Decomposition Algorithm and Geometry Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:207-220 [Conf ] Amy P. Felty , Dale Miller Encoding a Dependent-Type Lambda-Calculus in a Logic Programming Language. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:221-235 [Conf ] David J. Pym , Lincoln A. Wallen Investigations into Proof-Search in a System of First-Order Dependent Function Types. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:236-250 [Conf ] David A. Basin Equality of Terms Containing Associative-Commutative Functions and Commutative Binding Operators in Isomorphism Complete. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:251-260 [Conf ] Daniel J. Dougherty , Patricia Johann An Improved General E-Unification Method. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:261-275 [Conf ] Paliath Narendran , Friedrich Otto Some Results on Equational Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:276-291 [Conf ] Alexandre Boudet Unification in a Combination of Equational Theories: an Efficient Algorithm. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:292-307 [Conf ] Alan F. McMichael SLIM: An Automated Reasoner For Equivalences, Applied To Set Theory. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:308-321 [Conf ] Mark Tarver An Examination of the Prolog Technology Theorem-Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:322-335 [Conf ] Frank Pfenning , Dan Nesmith Presenting Intuitive Deductions via Symmetric Simplification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:336-350 [Conf ] William Pierce Toward Mechanical Methods for Streamlining Proofs. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:351-365 [Conf ] Ursula Martin , Tobias Nipkow Ordered Rewriting and Confluence. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:366-380 [Conf ] Gerald E. Peterson Complete Sets of Reductions with Constraints. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:381-395 [Conf ] Franz Baader Rewrite Systems for Varieties of Semigroups. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:396-410 [Conf ] Joachim Steinbach Improving Assoviative Path Orderings. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:411-425 [Conf ] Wolfgang Bibel Perspectives on Automated Deduction (Abstract). [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:426- [Conf ] Leo Bachmair , Harald Ganzinger On Restrictions of Ordered Paramodulation with Simplification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:427-441 [Conf ] Dan Benanav Simultaneous Paramodulation. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:442-455 [Conf ] Yusuf Ozturk , Lawrence J. Henschen Hyper Resolution and Equality Axioms without Function Substitutions. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:456-469 [Conf ] Christian B. Suttner , Wolfgang Ertel Automatic Acquisition of Search Guiding Heuristics. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:470-484 [Conf ] Larry Wos , S. Winker , William McCune , Ross A. Overbeek , Ewing L. Lusk , Rick L. Stevens , Ralph Butler Automated Reasoning Contributed to Mathematics and Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:485-499 [Conf ] James A. Altucher , Prakash Panangaden A Mechanically Assisted Constructive Proof in Category Theory. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:500-513 [Conf ] Heikki Tuominen Dynamic Logic as a Uniform Framework for Theorem Proving in Intensional Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:514-527 [Conf ] Camilla Schwind A Tableau-Based Theorem Prover for a Decidable Subset of Default Logic. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:528-542 [Conf ] Peter Jackson , John Pais Computing Prime Implicants. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:543-557 [Conf ] Thierry Boy de la Tour Minimizing the Number of Clauses by Renaming. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:558-572 [Conf ] Wayne Snyder Higher Order E-Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:573-587 [Conf ] Masami Hagiya Programming by Example and Proving by Example Using Higher-order Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:588-602 [Conf ] Mikael Rittri Retrieving Library Identifiers via Equational Matching of Types. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:603-617 [Conf ] Werner Nutt Unification in Monoidal Theories. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:618-632 [Conf ] Alan Bundy A Science of Reasoning: Extended Abstract. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:633-640 [Conf ] Peter B. Andrews , Sunil Issar , Dan Nesmith , Frank Pfenning The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:641-642 [Conf ] Frank M. Brown , Carlos Araya Schemata. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:643-644 [Conf ] Frank M. Brown , Carlos Araya Cylindric Algebra Equation Solver. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:645-646 [Conf ] Alan Bundy , Frank van Harmelen , Christian Horn , Alan Smaill The Oyster-Clam System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:647-648 [Conf ] Ralph Butler , Ian T. Foster , Anita Jindal , Ross A. Overbeek A High-Performance Parallel Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:649-650 [Conf ] Carl Eichenlaub , Bruce Esrig , James Hook , Carl Klapper , Garrel Pottinger The Romulus Proof Checker. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:651-652 [Conf ] William M. Farmer , Joshua D. Guttman , F. Javier Thayer IMPS: An Interactive Mathematical Proof System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:653-654 [Conf ] Bernhard Gramlich UNICOM: A Refined Completion Based Inductive Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:655-656 [Conf ] Thomas Käufl , Nicolas Zabel The Theorem Prover of the Program Verifier Tatzelwurm. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:657-658 [Conf ] Matt Kaufmann RCL: A Lisp Verification System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:659-660 [Conf ] Pierre Lescanne ORME: An Implementation of Completion Procedures as Sets of Transition Rules. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:661-662 [Conf ] William McCune OTTER 2.0. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:663-664 [Conf ] Neil V. Murray , Erik Rosenthal DISSOLVER: A Dissolution-based Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:665-666 [Conf ] Robert Nieuwenhuis , Fernando Orejas , Albert Rubio TRIP: An Implementation of Clausal Rewriting. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:667-668 [Conf ] John L. Pollock OSCAR. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:669-670 [Conf ] Ronald W. Satz EXPERT THINKER: An Adaptation of F-Prolog to Microcomputers. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:671-672 [Conf ] Mark E. Stickel A Prolog Technology Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:673-674 [Conf ] Geoff Sutcliffe A General Clause Theorem Prover. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:675-676 [Conf ] Andrei Voronkov LISS - The Logic Inference Search System. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:677-678 [Conf ] David A. Wolfram ACE: The Abstract Clause Engine. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:679-680 [Conf ] Ewing L. Lusk , William McCune Tutorial on High-Performance Automated Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:681- [Conf ] Jürgen Müller , Franz Baader , Bernhard Nebel , Werner Nutt , Gert Smolka Tutorial on Reasoning and Representation with Concept Languages. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:681- [Conf ] Claude Kirchner Tutorial on Equational Unification. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:682- [Conf ] Amy P. Felty , Elsa L. Gunter , Dale Miller , Frank Pfenning Tutorial on Lambda-Prolog. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:682- [Conf ] Hans Jürgen Ohlbach , Andreas Herzig Tutorial on Compilation techniques for Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:683- [Conf ] Johann Schumann , Reinhold Letz , Franz J. Kurfess Tutorial on High-Performance Theorem Provers: Efficient Implementation and Parallelisation. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:683- [Conf ] Jieh Hsiang , Jean-Pierre Jouannaud Tutorial on Rewrite-Based Theorem Proving. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:684- [Conf ] Richard J. Waldinger Tutorial on Program-Synthetic Deduction. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:684- [Conf ] Paul Pritchard , John K. Slaney Tutorial on Computing Models of Propositional Logics. [Citation Graph (0, 0)][DBLP ] CADE, 1990, pp:685- [Conf ]