The SCEAS System
Navigation Menu

Conferences in DBLP

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

  1. Hantao Zhang, Deepak Kapur
    First-Order Theorem Proving Using Conditional Rewrite Rules. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:1-20 [Conf]
  2. Tie-Cheng Wang
    Elements of Z-Module Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:21-40 [Conf]
  3. Michael R. Donat, Lincoln A. Wallen
    Learning and Applying Generalised Solutions using Higher Order Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:41-60 [Conf]
  4. Amy P. Felty, Dale Miller
    Specifying Theorem Provers in a Higher-Order Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:61-80 [Conf]
  5. V. S. Subrahmanian
    Query Processing in Quantitative Logic Programming. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:81-100 [Conf]
  6. David A. Basin
    An Environment For Automated Reasoning About Partial Functions. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:101-110 [Conf]
  7. Alan Bundy
    The Use of Explicit Plans to Guide Inductive Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:111-120 [Conf]
  8. D. Duchier, Drew V. McDermott
    LOGICALC: An Environment for Interactive Proof Development. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:121-130 [Conf]
  9. Maritta Heisel, Wolfgang Reif, Werner Stephan
    Implementing Verification Strategies in the KIV-System. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:131-140 [Conf]
  10. Donald Simon
    Checking Natural Language Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:141-150 [Conf]
  11. Marc Bezem
    Consistency of Rule-based Expert System. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:151-161 [Conf]
  12. Hantao Zhang, Deepak Kapur, Mukkai S. Krishnamoorthy
    A Mechanizable Induction Principle for Equational Specifications. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:162-181 [Conf]
  13. Jean H. Gallier, Paliath Narendran, David A. Plaisted, Stan Raatz, Wayne Snyder
    Finding Canonical Rewriting Systems Equivalent to a Finite Set of Ground Equations in Polynomial Time. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:182-196 [Conf]
  14. Michael A. McRobbie, Robert K. Meyer, Paul B. Thistlewaite
    Towards Efficient "Knowledge-Based" Automated Theorem Proving for Non-Standard Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:197-217 [Conf]
  15. A. A. Aaby, K. T. Narayana
    Propositional Temporal Interval Logic is PSPACE Complete. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:218-237 [Conf]
  16. Douglas J. Howe
    Computational Metatheory in Nuprl. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:238-257 [Conf]
  17. H. Azzoune
    Type Inference in Prolog. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:258-277 [Conf]
  18. Jack Minker, Arcot Rajasekar
    Procedural Interpretation of Non-Horn Logic Programs. [Citation Graph (2, 0)][DBLP]
    CADE, 1988, pp:278-293 [Conf]
  19. Shan Chi, Lawrence J. Henschen
    Recursive Query Answering with Non-Horn Clauses. [Citation Graph (2, 0)][DBLP]
    CADE, 1988, pp:294-312 [Conf]
  20. Toshiro Wakayama, T. H. Payne
    Case Inference in Resolution-Based Languages. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:313-322 [Conf]
  21. Ralph Butler, Rasiah Loganantharaj, Robert Olsen
    Notes on Prolog Program Transformations, Prolog Style, and Efficient Compilation to The Warren Abstract Machine. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:323-332 [Conf]
  22. Ralph Butler, Nicholas T. Karonis
    Exploitation of Parallelism in Prototypical Deduction Problems. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:333-343 [Conf]
  23. Louise E. Moser
    A Decision Procedure for Unquantified Formulas of Graph Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:344-357 [Conf]
  24. Patrick Lincoln, Jim Christian
    Adventures in Associative-Commutative Unification (A Summary). [Citation Graph (1, 0)][DBLP]
    CADE, 1988, pp:358-367 [Conf]
  25. Wolfram Büttner
    Unification in Finite Algebras is Unitary (?). [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:368-377 [Conf]
  26. Manfred Schmidt-Schauß
    Unification in a Combination of Arbitrary Disjoint Equational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:378-396 [Conf]
  27. Karl-Hans Bläsius, Jörg H. Siekmann
    Partial Unification for Graph Based Equational Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:397-414 [Conf]
  28. Rainer Manthey, François Bry
    SATCHMO: A Theorem Prover Implemented in Prolog. [Citation Graph (8, 0)][DBLP]
    CADE, 1988, pp:415-434 [Conf]
  29. Richard C. Potter, David A. Plaisted
    Term Rewriting: Some Experimental Results. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:435-453 [Conf]
  30. Bishop Brock, Shaun Cooper, William Pierce
    Analogical Reasoning and Proof Discovery. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:454-468 [Conf]
  31. Larry M. Hines
    Hyper-Chaining and Knowledge-Based Theorem Proving. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:469-486 [Conf]
  32. Luis Fariñas del Cerro, Andreas Herzig
    Linear Modal Deductions. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:487-499 [Conf]
  33. Hans Jürgen Ohlbach
    A Resolution Calculus for Modal Logics. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:500-516 [Conf]
  34. Hans-Jürgen Bürckert
    Solving Disequations in Equational Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:517-526 [Conf]
  35. Emmanuel Kounalis, Michaël Rusinowitch
    On Word Problems in Horn Theories. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:527-537 [Conf]
  36. Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
    Canonical Conditional Rewrite Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:538-549 [Conf]
  37. Paul Jacquet
    Program Synthesis by Completion with Dependent Subtypes. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:550-562 [Conf]
  38. Thomas Käufl
    Reasoning about Systems of Linear Inequalities. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:563-572 [Conf]
  39. Rolf Socher
    A Subsumption Algorithm Based on Characteristic Matrices. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:573-581 [Conf]
  40. Arkady Rabinov
    A Restriction of Factoring in Binary Resolution. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:582-591 [Conf]
  41. Philippe Besnard, Pierre Siegel
    Supposition-Based Logic for Automated Nonmontonic Reasoning. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:592-601 [Conf]
  42. Christoph Walther
    Argument-Bounded Algorithms as a Basis for Automated Termination Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:602-621 [Conf]
  43. Leo Marcus, Timothy Redmond
    Two Automated Methods in Implementation Proofs. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:622-642 [Conf]
  44. Mark Franzen, Lawrence J. Henschen
    A New Approach to Universal Unification and Its Application to AC-Unification. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:643-657 [Conf]
  45. Neil V. Murray, Erik Rosenthal
    An Implementation of a Dissolution-Based System Employing Theory Links. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:658-674 [Conf]
  46. Ilkka Niemelä
    Decision Procedure for Autoepistemic Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:675-684 [Conf]
  47. Peter K. Malkin, Errol P. Martin
    Logical Matrix Generation and Testing. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:685-693 [Conf]
  48. Rakesh M. Verma, I. V. Ramakrishnan
    Optimal Time Bounds for Parallel Term Matching. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:694-703 [Conf]
  49. William McCune
    Challenge Equality Problems in Lattice Theory. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:704-709 [Conf]
  50. Frank Pfenning
    Single Axioms in the Implicational Propositional Calculus. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:710-713 [Conf]
  51. Larry Wos, William McCune
    Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:714-729 [Conf]
  52. Rick L. Stevens
    Challenge Problems from Nonassociative Rings for Theorem Provers. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:730-734 [Conf]
  53. Matt Kaufmann
    An Interactive Enhancement to the Boyer-Moore Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:735-736 [Conf]
  54. David A. Plaisted
    A Goal Directed Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:737- [Conf]
  55. Bill Pase, Sentot Kromodimoeljo
    m-NEVER System Summary. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:738-739 [Conf]
  56. Timothy Griffin
    EFS - An Interactive Environment for Formal Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:740-741 [Conf]
  57. David A. McAllester
    Ontic: A Knowledge Representation System for Mathematics. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:742-743 [Conf]
  58. Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
    Some Tools for an Inference Laboratory (ATINF). [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:744-745 [Conf]
  59. V. S. Subrahmanian, Zerksis D. Umrigar
    QUANTLOG: A System for Approximate Reasoning in Inconsistent Formal Systems. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:746-747 [Conf]
  60. Stephen J. Garland, John V. Guttag
    LP: The Larch Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:748-749 [Conf]
  61. Mark E. Stickel
    The KLAUS Automated Deduction System. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:750-751 [Conf]
  62. Mark E. Stickel
    A Prolog Technology Theorem Prover. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:752-753 [Conf]
  63. Amy P. Felty, Elsa L. Gunter, John Hannan, Dale Miller, Gopalan Nadathur, Andre Scedrov
    Lambda-Prolog: An Extended Logic Programming Language. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:754-755 [Conf]
  64. Frank M. Brown, Seung S. Park
    SYMEVAL: A Theorem Prover Based on the Experimental Logic. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:756-757 [Conf]
  65. Frank M. Brown, Seung S. Park, Jim Phelps
    ZPLAN: An Automatic Reasoning System for Situations. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:758-759 [Conf]
  66. Peter B. Andrews, Sunil Issar, Daniel Nesmith, Frank Pfenning
    The TPS Theorem Proving System. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:760-761 [Conf]
  67. Pierre Bieber, Luis Fariñas del Cerro, Andreas Herzig
    MOLOG: a Modal PROLOG. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:762-763 [Conf]
  68. P. E. Allen, Soumitra Bose, Edmund M. Clarke, Spiro Michaylov
    PARTHENON: A Parallel Theorem Prover for Non-Horn Clauses. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:764-765 [Conf]
  69. Bruce T. Smith, Donald W. Loveland
    An nH-Prolog Implementation. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:766-767 [Conf]
  70. Deepak Kapur, Hantao Zhang
    RRL: A Rewrite Rule Laboratory. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:768-769 [Conf]
  71. David Cyrluk, Richard M. Harris, Deepak Kapur
    GEOMETER: A Theorem Prover for Algebraic Geometry. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:770-771 [Conf]
  72. Lawrence C. Paulson
    Isabelle: The Next Seven Hundred Theorem Provers. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:772-773 [Conf]
  73. Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Alexander Herold
    The CHIP System: Constraint Handling In Prolog. [Citation Graph (0, 0)][DBLP]
    CADE, 1988, pp:774-775 [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