The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Peter B. Andrews
    Connections and Higher-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:1-4 [Conf]
  2. Leo Bachmair, Nachum Dershowitz
    Commutation, Transformation, and Termination. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:5-20 [Conf]
  3. Sara Porat, Nissim Francez
    Full-Commutation and Fair-Termination in Equational (and Combined) Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:21-41 [Conf]
  4. Ahlem Ben Cherifa, Pierre Lescanne
    An Actual Implementation of a Procedure That Mechanically Proves Termination of Rewriting Systems Based on Inequalities Between Polynomial Interpretations. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:42-51 [Conf]
  5. Isabelle Gnaedig, Pierre Lescanne
    Proving Termination of Associative Commutative Rewriting Systems by Rewriting. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:52-61 [Conf]
  6. Roland Dietrich
    Relating Resolution and Algebraic Completion for Horn Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:62-78 [Conf]
  7. David A. Plaisted
    A Simple Non-Termination Test for the Knuth-Bendix Method. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:79-88 [Conf]
  8. Rafael Dueire Lins
    A New Formula for the Execution of Categorial Combinators. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:89-98 [Conf]
  9. Deepak Kapur, Paliath Narendran, Hantao Zhang
    Proof by Induction Using Test Sets. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:99-117 [Conf]
  10. Yoshihito Toyama
    How to Prove Equivalence of Term Rewriting Systems without Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:118-127 [Conf]
  11. Hubert Comon
    Sufficient Completness, Term Rewriting Systems and "Anti-Unification". [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:128-140 [Conf]
  12. Jieh Hsiang, Michaël Rusinowitch
    A New Method for Establishing Refutational Completeness in Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:141-152 [Conf]
  13. Gerhard Jäger
    Some Contributions to the Logical Analysis of Circumscrition. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:154-171 [Conf]
  14. Martín Abadi, Zohar Manna
    Modal Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:172-189 [Conf]
  15. Peter H. Schmitt
    Computational Aspects of Three-Valued Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:190-198 [Conf]
  16. Kurt Konolige
    Resolution and Quantified Epistemic Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:199-208 [Conf]
  17. Frank M. Brown
    A Commonsense Theory of Nonmonotonic Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:209-228 [Conf]
  18. Larry Wos, William McCune
    Negative Paramodulation. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:229-239 [Conf]
  19. Younghwan Lim
    The Heuristics and Experimental Results of a New Hyperparamodulation: HL-Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:240-253 [Conf]
  20. Tie-Cheng Wang
    ECR: An Equality Conditional Resolution Proof Procedure. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:254-271 [Conf]
  21. A. J. J. Dick, Jim Cunningham
    Using Narrowing to do Isolation in Symbolic Equation Solving - An Experiment in Automated Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:272-280 [Conf]
  22. Tadashi Kanamori, Hiroshi Fujita
    Formulation of Induction Formulas in Verification of Prolog Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:281-299 [Conf]
  23. Thomas Käufl
    Program Verifier "Tatzelwurm": Reasoning about Systems of Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:300-305 [Conf]
  24. Reiner Hähnle, Maritta Heisel, Wolfgang Reif, Werner Stephan
    An Interactive Verification System Based on Dynamic Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:306-315 [Conf]
  25. Norbert Eisinger
    What You Always Wanted to Know About Clause Graph Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:316-336 [Conf]
  26. Rasiah Loganantharaj, Robert A. Mueller
    Parallel Theorem Proving with Connection Graphs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:337-352 [Conf]
  27. Neil V. Murray, Erik Rosenthal
    Theory Links in Semantic Graphs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:353-364 [Conf]
  28. David A. Plaisted
    Abstraction Using Generalization Functions. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:365-376 [Conf]
  29. Hans-Albert Schneider
    An Improvement of Deduction Plans: Refutation Plans. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:377-383 [Conf]
  30. Franz Oppacher, E. Suen
    Controlling Deduction with Proof Condensation and Heuristics. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:384-393 [Conf]
  31. Jonathan Traugott
    Nested Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:394-402 [Conf]
  32. Gérard P. Huet
    Mechanizing Constructive Proofs (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:403- [Conf]
  33. Douglas J. Howe
    Implementing Number Theory: An Experiment with Nuprl. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:404-415 [Conf]
  34. Cynthia Dwork, Paris C. Kanellakis, Larry J. Stockmeyer
    Parallel Algorithms for Term Matching. [Citation Graph (2, 0)][DBLP]
    CADE, 1986, pp:416-430 [Conf]
  35. Erik Tidén
    Unification in Combinations of Collapse-Free Theories with Disjoint Sets of Function Symbols. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:431-449 [Conf]
  36. Alexander Herold
    Combination of Unification Algorithms. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:450-469 [Conf]
  37. Wolfram Büttner
    Unification in the Data Structure Sets. [Citation Graph (1, 0)][DBLP]
    CADE, 1986, pp:470-488 [Conf]
  38. Deepak Kapur, Paliath Narendran
    NP-Completeness of the Set Unification and Matching Problems. [Citation Graph (2, 0)][DBLP]
    CADE, 1986, pp:489-495 [Conf]
  39. Jalel Mzali
    Matching with Distributivity. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:496-505 [Conf]
  40. Ursula Martin, Tobias Nipkow
    Unification in Boolean Rings. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:506-513 [Conf]
  41. Hans-Jürgen Bürckert
    Some Relationships between Unification, restricted Unification, and Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:514-524 [Conf]
  42. Christoph Walther
    A Classification of Many-Sorted Unification Problems. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:525-537 [Conf]
  43. Manfred Schmidt-Schauß
    Unification in Many-Sorted Eqational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:538-552 [Conf]
  44. Hans Kleine Büning, Theodor Lettmann
    Classes of First Order Formulas Under Various Satisfiability Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:553-563 [Conf]
  45. Volker Weispfenning
    Diamond Formulas in the Dynamic Logic of Recursively Enumerable Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:564-571 [Conf]
  46. Mark E. Stickel
    A prolog Technology Theorem Prover: Implementation by an Extended Prolog Compiler. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:573-587 [Conf]
  47. Ralph Butler, Ewing L. Lusk, William McCune, Ross A. Overbeek
    Paths to High-Performance Automated Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:588-597 [Conf]
  48. F. Keith Hanna, Neil Daeche
    Purely Functional Implementation of a Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:598-607 [Conf]
  49. Philip T. Cox, Tomasz Pietrzykowski
    Causes for Events: Their Computation and Applications. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:608-621 [Conf]
  50. Zohar Manna, Richard J. Waldinger
    How to Clear a Block: Plan Formation in Situational Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:622-640 [Conf]
  51. Jonathan Traugott
    Deductive Synthesis of Sorting Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:641-660 [Conf]
  52. Peter B. Andrews, Frank Pfenning, Sunil Issar, C. P. Klapper
    The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:663-664 [Conf]
  53. Jürgen Avenhaus, Benjamin Benninghofen, Rüdiger Göbel, Klaus Madlener
    TRSPEC: A Term Rewriting Based System for Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:665-667 [Conf]
  54. M. Bayerl
    Highly Parallel Inference Machine. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:668-669 [Conf]
  55. Christoph Beierle, Walter G. Olthoff, Angi Voß
    Automatic Theorem Proving in the ISDV System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:670-671 [Conf]
  56. Susanne Biundo, B. Hummel, Dieter Hutter, Christoph Walther
    The Karlsruhe Induction Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:672-674 [Conf]
  57. Robert S. Boyer, J. Strother Moore
    Overview of a Theorem-Prover for A Computational Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:675-678 [Conf]
  58. Shang-Ching Chou
    GEO-Prover - A Geometry Theorem Prover Developed at UT. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:679-680 [Conf]
  59. Norbert Eisinger, Hans Jürgen Ohlbach
    The Markgraf Karl Refutation Procedure (MKRP). [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:681-682 [Conf]
  60. Jacek Gibert
    The J-Machine: Functional Programming with Combinators. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:683-684 [Conf]
  61. Steven Greenbaum, David A. Plaisted
    The Illinois Prover: A General Purpose Resolution Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:685-687 [Conf]
  62. Gérard P. Huet
    Theorem Proving Systems of the Formel Project. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:687-688 [Conf]
  63. Heinrich Hußmann
    The Passau RAP System: Prototyping Algebraic Specifications Using Conditional Narrowing. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:689-690 [Conf]
  64. Deepak Kapur, G. Sivakumar, Hantao Zhang
    RRL: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:691-692 [Conf]
  65. B. Kutzler, Sabine Stifter
    A Geometry Theorem Prover Based on Buchberger's Algorithm. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:693-694 [Conf]
  66. Pierre Lescanne
    REVE a Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:695-696 [Conf]
  67. Ewing L. Lusk, William McCune, Ross A. Overbeek
    ITP at Argonne National Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:697-698 [Conf]
  68. Charles G. Morgan
    AUTOLOGIC at University of Victoria. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:699-700 [Conf]
  69. Francis Jeffry Pelletier
    THINKER. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:701-702 [Conf]
  70. Mark E. Stickel
    The KLAUS Automated Deduction System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:703-704 [Conf]
  71. Paul B. Thistlewaite, Michael A. McRobbie, Robert K. Meyer
    The KRIPKE Automated Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:705-706 [Conf]
  72. Tie-Cheng Wang
    SHD-Prover at University of Texas at Austin. [Citation Graph (0, 0)][DBLP]
    CADE, 1986, pp:707-708 [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