The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. John K. Slaney
    The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:1-13 [Conf]
  2. Toby Walsh
    A Divergence Critic. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:14-28 [Conf]
  3. Dieter Hutter
    Synthesis of Induction Orderings for Existence Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:29-41 [Conf]
  4. Martin Protzen
    Lazy Generation of Induction Hypotheses. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:42-56 [Conf]
  5. David A. Plaisted
    The Search Efficiency of Theorem Proving Strategies. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:57-71 [Conf]
  6. Christophe Bourely, Ricardo Caferra, Nicolas Peltier
    A Method for Building Models Automatically. Experiments with an Extension of OTTER. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:72-86 [Conf]
  7. Peter Baumgartner, Ulrich Furbach
    Model Elimination Without Contrapositives. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:87-101 [Conf]
  8. François Bronsard, Uday S. Reddy, Robert W. Hasker
    Induction using Term Orderings. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:102-117 [Conf]
  9. Jacques Chazarain, Emmanuel Kounalis
    Mechanizable Inductive Proofs for a Class of Forall Exists Formulas. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:118-132 [Conf]
  10. Olav Lysne
    On the Connection between Narrowing and Proof by Consistency. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:133-147 [Conf]
  11. Lawrence C. Paulson
    A Fixedpoint Approach to Implementing (Co)Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:148-161 [Conf]
  12. Claus-Peter Wirth, Bernhard Gramlich
    On Notions of Inductive Validity for First-Oder Equational Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:162-176 [Conf]
  13. Siani Baker
    A New Application for Explanation-Based Generalisation within Automated Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:177-191 [Conf]
  14. Heng Chu, David A. Plaisted
    Semantically Guided First-Order Theorem Proving using Hyper-Linking. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:192-206 [Conf]
  15. D. Andre de Waal, John P. Gallagher
    The Applicability of Logic Program Analysis and Transformation to Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:207-221 [Conf]
  16. Stefan Brüning
    Detecting Non-Provable Goals. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:222-236 [Conf]
  17. Robert S. Boyer
    Panel Discussion: A Mechanically Proof-Checked Encyclopedia of Mathematics: Should We Build One? Can We? [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:237- [Conf]

  18. The QED Manifesto. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:238-251 [Conf]
  19. Geoff Sutcliffe, Christian B. Suttner, Theodor Yemenis
    The TPTP Problem Library. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:252-266 [Conf]
  20. Eric Domenjoud, Francis Klay, Christophe Ringeissen
    Combination Techniques for Non-Disjoint Equational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:267-281 [Conf]
  21. Gernot Salzer
    Primal Grammars and Unification Modulo a Binary Clause. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:282-295 [Conf]
  22. Koji Iwanuma
    Conservative Query Normalization on Parallel Circumscription. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:296-310 [Conf]
  23. Laurent Fribourg, Marcos Veloso Peixoto
    Bottom-up Evaluation of Datalog Programs with Arithmetic Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:311-325 [Conf]
  24. Véronique Royer, Joachim Quantz
    On Intuitionistic Query Answering in Description Bases. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:326-340 [Conf]
  25. Mark E. Stickel, Richard J. Waldinger, Michael R. Lowry, Thomas Pressburger, Ian Underwood
    Deductive Composition of Astronomical Software from Subroutine Libraries. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:341-355 [Conf]
  26. William M. Farmer, Joshua D. Guttman, Mark E. Nadel, F. Javier Thayer
    Proof Script Pragmatics in IMPS. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:356-370 [Conf]
  27. Manfred Kerber, Michael Kohlhase
    A Mechanization of Strong Kleene Logic for Partial Functions. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:371-385 [Conf]
  28. Dongming Wang
    Algebraic Factoring and Geometry Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:386-400 [Conf]
  29. Nicholas Freitag McPhee, Shang-Ching Chou, Xiao-Shan Gao
    Mechanically Proving Geometry Theorems Using a Combination of Wu's Method and Collins' Method. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:401-415 [Conf]
  30. Larry M. Hines
    Str+ve and Integers. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:416-430 [Conf]
  31. Richard Platek
    What is a Proof? (Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:431- [Conf]
  32. Ursula Martin
    Termination, Geometry and Invariants. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:432-434 [Conf]
  33. Leo Bachmair, Harald Ganzinger
    Ordered Chaining for Total Orderings. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:435-450 [Conf]
  34. Aart Middeldorp, Hans Zantema
    Simple Termination Revisited. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:451-465 [Conf]
  35. David A. Basin, Toby Walsh
    Termination Orderings for Rippling. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:466-483 [Conf]
  36. David B. Sturgill, Alberto Maria Segre
    A Novel Asynchronous Parallelism Scheme for First-Order Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:484-498 [Conf]
  37. Jean Goubault
    Proving with BDDs and Control of Information. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:499-513 [Conf]
  38. Peter Graf
    Extended Path-Indexing. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:514-528 [Conf]
  39. Robert L. Constable
    Exporting and Refecting Abstract Metamathematics. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:529- [Conf]
  40. Laurent Vigneron
    Associative-Commutative Deduction with Constraints. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:530-544 [Conf]
  41. Robert Nieuwenhuis, Albert Rubio
    AC-Superposition with Constraints: No AC-Unifiers Needed. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:545-559 [Conf]
  42. Miki Hermann, Phokion G. Kolaitis
    The Complexity of Counting Problems in Equational Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:560-574 [Conf]
  43. Penny Anderson
    Representing Proof Transformations for Program Optimizations. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:575-589 [Conf]
  44. Paul Jackson
    Exploring Abstract Algebra in Constructive Type Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:590-604 [Conf]
  45. Amy P. Felty, Douglas J. Howe
    Tactic Theorem Proving with Refinement-Tree Proofs and Metavariables. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:605-619 [Conf]
  46. Patricia Johann, Michael Kohlhase
    Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:620-634 [Conf]
  47. Christian Prehofer
    Decidable Higher-Order Unification Problems. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:635-649 [Conf]
  48. Olaf Müller, Franz Weber
    Theory and Practice of Minimal Modular Higher-Order E-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:650-664 [Conf]
  49. Rolf Socher-Ambrosius
    A Refined Version of General E-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:665-677 [Conf]
  50. Bernhard Beckert
    A Completion-Based Method for Mixed Universal and Rigid E-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:678-692 [Conf]
  51. Reinhard Bündgen
    On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:693-707 [Conf]
  52. Stefan Klingenbeck, Reiner Hähnle
    Semantic Tableaux with Ordering Restrictions. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:708-722 [Conf]
  53. Fabio Massacci
    Strongly Analytic Tableaux for Normal Modal Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:723-737 [Conf]
  54. Xiaorong Huang
    Reconstruction Proofs at the Assertion Level. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:738-752 [Conf]
  55. Jian Zhang
    Problems on the Generation of Finite Models. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:753-757 [Conf]
  56. Edmund M. Clarke, Xudong Zhao
    Combining Symbolic Computation and Theorem Proving: Some Problems of Ramanujan. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:758-763 [Conf]
  57. John K. Slaney, Ewing L. Lusk, William McCune
    SCOTT: Semantically Constrained Otter System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:764-768 [Conf]
  58. Peter Baumgartner, Ulrich Furbach
    PROTEIN: A PROver with a Theory Extension INterface. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:769-773 [Conf]
  59. Johann Schumann
    DELTA - A Bottom-up Preprocessor for Top-Down Theorem Provers - System Abstract. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:774-777 [Conf]
  60. Christoph Goller, Reinhold Letz, Klaus Mayr, Johann Schumann
    SETHEO V3.2: Recent Developments - System Abstract. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:778-782 [Conf]
  61. Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath
    KoMeT. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:783-787 [Conf]
  62. Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, Jörg H. Siekmann
    Omega-MKRP: A Proof Development Environment. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:788-792 [Conf]
  63. Bernhard Beckert, Joachim Posegga
    leanTAP: Lean Tableau-Based Theorem Proving (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:793-797 [Conf]
  64. John K. Slaney
    FINDER: Finite Domain Enumerator - System Description. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:798-801 [Conf]
  65. Frederic D. Portoraro
    Symlog: Automated Advice in Fitch-style Proof Construction. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:802-806 [Conf]
  66. Xiaorong Huang, Manfred Kerber, Michael Kohlhase, Erica Melis, Dan Nesmith, Jörn Richts, Jörg H. Siekmann
    KEIM: A Toolkit for Automated Deduction. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:807-810 [Conf]
  67. Frank Pfenning
    Elf: A Meta-Language for Deductive Systems (System Descrition). [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:811-815 [Conf]
  68. Takeshi Ohtani, Hajime Sawamura, Toshiro Minami
    EUODHILOS-II on Top of GNU Epoch. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:816-820 [Conf]
  69. Lars-Henrik Eriksson
    Pi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:821-825 [Conf]
  70. Bradley L. Richards, Ina Kraan, Alan Smaill, Geraint A. Wiggins
    Mollusc: A General Proof-Development Shell for Sequent-Based Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:826-830 [Conf]
  71. Tie-Cheng Wang, Allen Goldberg
    KITP-93: An Automated Inference System for Program Analysis. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:831-835 [Conf]
  72. Adel Bouhoula
    SPIKE: a System for Sufficient Completeness and Parameterized Inductive Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:836-840 [Conf]
  73. Maria Paola Bonacina, William McCune
    Distributed Theorem Proving by Peers. [Citation Graph (0, 0)][DBLP]
    CADE, 1994, pp:841-845 [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