The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Larry Wos
    The Impossibility of the Automation of Logical Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:1-3 [Conf]
  2. Kurt Ammon
    Automatic Proofs in Mathematical Logic and Analysis. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:4-19 [Conf]
  3. Shang-Ching Chou, Xiao-Shan Gao
    Proving Geometry Statements of Constructive Type. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:20-34 [Conf]
  4. Larry M. Hines
    The Central Variable Strategy of Str+ve. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:35-49 [Conf]
  5. Franz Baader, Klaus U. Schulz
    Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:50-65 [Conf]
  6. Tobias Nipkow, Zhenyu Qian
    Reduction and Unification in Lambda Calculi with Subtypes. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:66-78 [Conf]
  7. Daniel J. Dougherty, Patricia Johann
    A Combinatory Logic Approach to Higher-order E-unification (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:79-93 [Conf]
  8. Wolfgang Bibel, Steffen Hölldobler, Jörg Würtz
    Cycle Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:94-108 [Conf]
  9. Katherine A. Yelick, Stephen J. Garland
    A Parallel Completion Procedure for Term Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:109-123 [Conf]
  10. David A. McAllester
    Grammar Rewriting. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:124-138 [Conf]
  11. Adam Cichon, Pierre Lescanne
    Polynomial Interpretations and the Complexity of Algorithms. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:139-147 [Conf]
  12. Leonidas Fegaras, Tim Sheard, David W. Stemple
    Uniform Traversal Combinators: Definition, Use and Properties. [Citation Graph (2, 0)][DBLP]
    CADE, 1992, pp:148-162 [Conf]
  13. Tomás E. Uribe
    Sorted Unification Using Set Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:163-177 [Conf]
  14. Alan M. Frisch, Anthony G. Cohn
    An Abstract View of Sorted Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:178-192 [Conf]
  15. Alexandre Boudet
    Unification in Order-Sorted Algebras with Overloading. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:193-207 [Conf]
  16. Raymond M. Smullyan
    Puzzles and Paradoxes (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:208- [Conf]
  17. William McCune, Larry Wos
    Experiments in Automated Deduction with Condensed Detachment. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:209-223 [Conf]
  18. Owen L. Astrachan, Mark E. Stickel
    Caching and Lemmaizing in Model Elimination Theorem Provers. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:224-238 [Conf]
  19. Vincent J. Digricoli, Eugene Kochendorfer
    LIM+ Challenge Problems by RUE Hyper-Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:239-252 [Conf]
  20. Peter Jackson
    Computing Prime Implicates Incrementally. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:253-267 [Conf]
  21. Geoff Sutcliffe
    Linear-Input Subset Analysis. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:268-280 [Conf]
  22. Belaid Benhamou, Lakhdar Sais
    Theoretical Study of Symmetries in Propositional Calculus and Applications. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:281-294 [Conf]
  23. David A. Basin, Toby Walsh
    Difference Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:295-309 [Conf]
  24. Jane Hesketh, Alan Bundy, Alan Smaill
    Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:310-324 [Conf]
  25. Toby Walsh, Alex Nunes, Alan Bundy
    The Use of Proof Plans to Sum Series. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:325-339 [Conf]
  26. Martin Protzen
    Disproving Conjectures. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:340-354 [Conf]
  27. Mathias Bauer
    An Interval-based Temporal Logic in a Multivalued Setting. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:355-369 [Conf]
  28. Michael Fisher
    A Normal Form for First-Order Temporal Formulae. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:370-384 [Conf]
  29. Ricardo Caferra, Stéphane Demri
    Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:385-399 [Conf]
  30. Katsumi Inoue, Miyuki Koshimura, Ryuzo Hasegawa
    Embedding Negation as Failure into a Model Generation Theorem Prover. [Citation Graph (1, 0)][DBLP]
    CADE, 1992, pp:400-415 [Conf]
  31. Robert S. Boyer, Yuan Yu
    Automated Correctness Proofs of Machine Code Programs for a Commercial Microprocessor. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:416-430 [Conf]
  32. Hantao Zhang, Xin Hua
    Proving the Chinese Remainder Theorem by the Cover Set Induction. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:431-445 [Conf]
  33. Peter Madden
    Automatic Program Optimization Through Proof Transformation. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:446-460 [Conf]
  34. Leo Bachmair, Harald Ganzinger, Christopher Lynch, Wayne Snyder
    Basic Paramodulation and Superposition. [Citation Graph (1, 0)][DBLP]
    CADE, 1992, pp:462-476 [Conf]
  35. Robert Nieuwenhuis, Albert Rubio
    Theorem Proving with Ordering Constrained Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:477-491 [Conf]
  36. Zohar Manna, Richard J. Waldinger
    The Special-Relation Rules are Incomplete. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:492-506 [Conf]
  37. Bernhard Beckert, Reiner Hähnle
    An Improved Method for Adding Equality to Free Variable Semantic Tableaux. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:507-521 [Conf]
  38. Natarajan Shankar
    Proof Search in the Intuitionistic Sequent Calculus. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:522-536 [Conf]
  39. Frank Pfenning, Ekkehard Rohwedder
    Implementing the Meta-Theory of Deductive Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:537-551 [Conf]
  40. Wilfred Z. Chen
    Tactic-based Theorem Proving and Knowledge-based Forward Chaining: an Experiment with Nuprl and Ontic. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:552-566 [Conf]
  41. William M. Farmer, Joshua D. Guttman, F. Javier Thayer
    Little Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:567-581 [Conf]
  42. Jim Christian
    Some Termination Criteria for Narrowing and E-Narrowing. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:582-588 [Conf]
  43. Nachum Dershowitz, Subrata Mitra, G. Sivakumar
    Decidable Matching for Convergent Systems (Preliminary Version). [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:589-602 [Conf]
  44. Delia Kesner
    Free Sequentially in Orthogonal Order-Sorted Rewriting Systems with Constructors. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:603-617 [Conf]
  45. R. C. Sekar, I. V. Ramakrishnan
    Programming with Equations: A Framework for Lazy Parallel Evaluation. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:618-632 [Conf]
  46. Anthony G. Cohn
    A Many Sorted Logic with Possibly Empty Sorts. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:633-647 [Conf]
  47. Andrei Voronkov
    Theorem Proving in Non-Standard Logics Based on the Inverse Method. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:648-662 [Conf]
  48. Konstantin Vershinin, Igor Romanenko
    One More Logic with Uncertainty and Resolution Principle for it. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:663-667 [Conf]
  49. Li Dafa
    A Natural Deduction Automated Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:668-672 [Conf]
  50. Tobias Nipkow, Lawrence C. Paulson
    Isabelle-91. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:673-676 [Conf]
  51. Geoff Sutcliffe
    The Semantically Guided Linear Deduction System. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:677-680 [Conf]
  52. Kurt Ammon
    The SHUNYATA System. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:681-685 [Conf]
  53. Shang-Ching Chou
    A Geometry Theorem Prover for Macintoshes. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:686-690 [Conf]
  54. Xin Hua, Hantao Zhang
    FRI: Failure-Resistant Induction in RRL. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:691-695 [Conf]
  55. Hantao Zhang
    Herky: High Performance Rewriting in RRL. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:696-700 [Conf]
  56. William M. Farmer, Joshua D. Guttman, F. Javier Thayer
    IMPS: System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:701-705 [Conf]
  57. Geoffrey D. Alexander, David A. Plaisted
    Proving Equality Theorems with Hyper-Linking. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:706-710 [Conf]
  58. Jawahar Chirimar, Carl A. Gunter, Myra Van Inwegen
    Xpnet: A Graphical Interface to Proof Nets with an Efficient Proof Checker. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:711-715 [Conf]
  59. Dave Barker-Plummer, Sidney C. Bailin, Andrew S. Merrill
    &: Automated Natural Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:716-720 [Conf]
  60. Tomás E. Uribe, Alan M. Frisch, Michael K. Mitchell
    An Overview of FRAPPS 2.0: A Framework for Resolution-based Automated Proof Procedure Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:721-725 [Conf]
  61. Dave Barker-Plummer, Alex Rothenberg
    The GAZER Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:726-730 [Conf]
  62. Ewing L. Lusk, William McCune, John K. Slaney
    ROO: A Parallel Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:731-734 [Conf]
  63. Tie-Cheng Wang, Allen Goldberg
    RVF: An Automated Formal Verification System. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:735-739 [Conf]
  64. Johann Schumann
    KPROP - An AND-parallel Theorem Prover for Propositional Logic implemented in KL1 (System Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:740-742 [Conf]
  65. K. Blackburn
    A Report in ICL HOL. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:743-747 [Conf]
  66. Sam Owre, John M. Rushby, Natarajan Shankar
    PVS: A Prototype Verification System. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:748-752 [Conf]
  67. Wolfgang Reif
    The KIV System: Systematic Construction of Verified Software. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:753-757 [Conf]
  68. Bernhard Beckert, Stefan Gerberding, Reiner Hähnle, Werner Kernig
    The Tableau-Based Theorem Prover 3TAP for Multi-Valued Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:758-760 [Conf]
  69. Edmund M. Clarke, Xudong Zhao
    Analytica - A Theorem Prover in Mathematica. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:761-765 [Conf]
  70. Klaus Schneider, Ramayya Kumar, Thomas Kropf
    The FAUST - Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:766-770 [Conf]
  71. Dan Craigen, Sentot Kromodimoeljo, Irwin Meisels, Bill Pase, Mark Saaltink
    Eves System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:771-775 [Conf]
  72. Ryuzo Hasegawa, Miyuki Koshimura, Hiroshi Fujita
    MGTP: A Parallel Theorem Prover Based on Lazy Model Generation. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:776-780 [Conf]
  73. Ewing L. Lusk, Larry Wos
    Benchmark Problems in Which Equality Plays the Major Role. [Citation Graph (0, 0)][DBLP]
    CADE, 1992, pp:781-785 [Conf]
  74. David A. Randell, Anthony G. Cohn, Zhan Cui
    Computing Transivity Tables: A Challenge For Automated Theorem Provers. [Citation Graph (1, 0)][DBLP]
    CADE, 1992, pp:786-790 [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