Advertisement

The KLAUS automated deduction system

  • Mark E. Stickel
Extended Abstracts Of Current Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Keywords

Theorem Prover Defense Advance Research Project Agency Automate Deduction Empty Clause Theory Resolution 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    Brachman, R.J., V. Pigman Gilbert, and H.J. Levesque. An essential hybrid reasoning system: knowledge and symbol level accounts of Krypton. Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angles, California, August 1985, 532–539.Google Scholar
  2. [2]
    Stickel, M.E. A nonclausal connection-graph resolution theorem-proving program. Proceedings of the AAAI-82 National Conference on Artificial Intelligence, Pittsburgh, Pennsylvania, August 1982, 229–233.Google Scholar
  3. [3]
    Stickel, M.E. A case study of theorem proving by the Knuth-Bendix method: discovering that x 3=x implies ring commutativity. Proceedings of the 7th International Conference on Automated Deduction, Napa, California, May 1984, 248–258.Google Scholar
  4. [4]
    Stickel, M.E. Automated deduction by theory resolution. Journal of Automated Reasoning 1, 4 (1985), 333–355.CrossRefGoogle Scholar
  5. [5]
    Stickel, M.E. A Prolog technology theorem prove: implementation by an extended Prolog compiler. Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Mark E. Stickel
    • 1
  1. 1.Artificial Intelligence CenterSRI InternationalMenlo Park

Personalised recommendations