The SCEAS System
Navigation Menu

Conferences in DBLP

International Conference on Automated Deduction (CADE) (cade)
1990 (conf/cade/1990)

  1. Robert S. Boyer, J. Strother Moore
    A Theorem Prover for a Computational Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:1-15 [Conf]
  2. Xumin Nie, David A. Plaisted
    A Complete Semantic Back Chaining Proof System. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:16-27 [Conf]
  3. John K. Slaney, Ewing L. Lusk
    Parallelizing the Closure Computation in Automated Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:28-39 [Conf]
  4. Johann Schumann, Reinhold Letz
    PARTHEO: A High-Performance Parallel Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:40-56 [Conf]
  5. 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]
  6. 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]
  7. 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]
  8. 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]
  9. Maritta Heisel, Wolfgang Reif, Werner Stephan
    Tactical Theorem Proving in Program Verification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:117-131 [Conf]
  10. 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]
  11. Dieter Hutter
    Guiding Induction Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:147-161 [Conf]
  12. Uday S. Reddy
    Term Rewriting Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:162-177 [Conf]
  13. Hans-Jürgen Bürckert
    A Resolution Principle for Clauses with Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:178-192 [Conf]
  14. Larry M. Hines
    Str+ve-Subset: The Str+ve-based Subset Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:193-206 [Conf]
  15. 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]
  16. 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]
  17. 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]
  18. 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]
  19. Daniel J. Dougherty, Patricia Johann
    An Improved General E-Unification Method. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:261-275 [Conf]
  20. Paliath Narendran, Friedrich Otto
    Some Results on Equational Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:276-291 [Conf]
  21. Alexandre Boudet
    Unification in a Combination of Equational Theories: an Efficient Algorithm. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:292-307 [Conf]
  22. Alan F. McMichael
    SLIM: An Automated Reasoner For Equivalences, Applied To Set Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:308-321 [Conf]
  23. Mark Tarver
    An Examination of the Prolog Technology Theorem-Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:322-335 [Conf]
  24. Frank Pfenning, Dan Nesmith
    Presenting Intuitive Deductions via Symmetric Simplification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:336-350 [Conf]
  25. William Pierce
    Toward Mechanical Methods for Streamlining Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:351-365 [Conf]
  26. Ursula Martin, Tobias Nipkow
    Ordered Rewriting and Confluence. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:366-380 [Conf]
  27. Gerald E. Peterson
    Complete Sets of Reductions with Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:381-395 [Conf]
  28. Franz Baader
    Rewrite Systems for Varieties of Semigroups. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:396-410 [Conf]
  29. Joachim Steinbach
    Improving Assoviative Path Orderings. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:411-425 [Conf]
  30. Wolfgang Bibel
    Perspectives on Automated Deduction (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:426- [Conf]
  31. Leo Bachmair, Harald Ganzinger
    On Restrictions of Ordered Paramodulation with Simplification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:427-441 [Conf]
  32. Dan Benanav
    Simultaneous Paramodulation. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:442-455 [Conf]
  33. Yusuf Ozturk, Lawrence J. Henschen
    Hyper Resolution and Equality Axioms without Function Substitutions. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:456-469 [Conf]
  34. Christian B. Suttner, Wolfgang Ertel
    Automatic Acquisition of Search Guiding Heuristics. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:470-484 [Conf]
  35. 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]
  36. James A. Altucher, Prakash Panangaden
    A Mechanically Assisted Constructive Proof in Category Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:500-513 [Conf]
  37. 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]
  38. 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]
  39. Peter Jackson, John Pais
    Computing Prime Implicants. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:543-557 [Conf]
  40. Thierry Boy de la Tour
    Minimizing the Number of Clauses by Renaming. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:558-572 [Conf]
  41. Wayne Snyder
    Higher Order E-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:573-587 [Conf]
  42. Masami Hagiya
    Programming by Example and Proving by Example Using Higher-order Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:588-602 [Conf]
  43. Mikael Rittri
    Retrieving Library Identifiers via Equational Matching of Types. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:603-617 [Conf]
  44. Werner Nutt
    Unification in Monoidal Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:618-632 [Conf]
  45. Alan Bundy
    A Science of Reasoning: Extended Abstract. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:633-640 [Conf]
  46. 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]
  47. Frank M. Brown, Carlos Araya
    Schemata. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:643-644 [Conf]
  48. Frank M. Brown, Carlos Araya
    Cylindric Algebra Equation Solver. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:645-646 [Conf]
  49. Alan Bundy, Frank van Harmelen, Christian Horn, Alan Smaill
    The Oyster-Clam System. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:647-648 [Conf]
  50. 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]
  51. 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]
  52. 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]
  53. Bernhard Gramlich
    UNICOM: A Refined Completion Based Inductive Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:655-656 [Conf]
  54. Thomas Käufl, Nicolas Zabel
    The Theorem Prover of the Program Verifier Tatzelwurm. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:657-658 [Conf]
  55. Matt Kaufmann
    RCL: A Lisp Verification System. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:659-660 [Conf]
  56. Pierre Lescanne
    ORME: An Implementation of Completion Procedures as Sets of Transition Rules. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:661-662 [Conf]
  57. William McCune
    OTTER 2.0. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:663-664 [Conf]
  58. Neil V. Murray, Erik Rosenthal
    DISSOLVER: A Dissolution-based Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:665-666 [Conf]
  59. Robert Nieuwenhuis, Fernando Orejas, Albert Rubio
    TRIP: An Implementation of Clausal Rewriting. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:667-668 [Conf]
  60. John L. Pollock
    OSCAR. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:669-670 [Conf]
  61. Ronald W. Satz
    EXPERT THINKER: An Adaptation of F-Prolog to Microcomputers. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:671-672 [Conf]
  62. Mark E. Stickel
    A Prolog Technology Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:673-674 [Conf]
  63. Geoff Sutcliffe
    A General Clause Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:675-676 [Conf]
  64. Andrei Voronkov
    LISS - The Logic Inference Search System. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:677-678 [Conf]
  65. David A. Wolfram
    ACE: The Abstract Clause Engine. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:679-680 [Conf]
  66. Ewing L. Lusk, William McCune
    Tutorial on High-Performance Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:681- [Conf]
  67. 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]
  68. Claude Kirchner
    Tutorial on Equational Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:682- [Conf]
  69. Amy P. Felty, Elsa L. Gunter, Dale Miller, Frank Pfenning
    Tutorial on Lambda-Prolog. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:682- [Conf]
  70. Hans Jürgen Ohlbach, Andreas Herzig
    Tutorial on Compilation techniques for Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:683- [Conf]
  71. 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]
  72. Jieh Hsiang, Jean-Pierre Jouannaud
    Tutorial on Rewrite-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:684- [Conf]
  73. Richard J. Waldinger
    Tutorial on Program-Synthetic Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:684- [Conf]
  74. Paul Pritchard, John K. Slaney
    Tutorial on Computing Models of Propositional Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1990, pp:685- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002