A Guide to Snark

Abstract : Snark, SRI's New Automated Reasoning Kit, is a theorem prover intended for applications in artificial intelligence and software engineering. Snark is geared toward dealing with large sets of assertions; it can be specialized with strategic controls that tune its performance; and it has facilities for integrating special-purpose reasoning procedures with general-purpose inference. Snark has been used as the reasoning component of SRI's High Performance Knowledge Base (HPKB) system, which deduces answers to questions based on large repositories of information. It constitutes the deductive core of the NASA Amphion system, which composes software from components to meet users' specifications, e. g., to perform computations in planetary astronomy. Snark has also been connected to Kestrel's specware environment for software development.

[1]  Richard C. T. Lee,et al.  Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[2]  M. R. Genesereth,et al.  Knowledge Interchange Format Version 3.0 Reference Manual , 1992, LICS 1992.

[3]  James F. Allen.  Time and time again: The many ways to represent time , 1991, Int. J. Intell. Syst..

[4]  Paul Graham.  ANSI Common Lisp , 1995 .

[5]  Zohar Manna,et al.  Fundamentals of Deductive Program Synthesis , 1992, IEEE Trans. Software Eng..

[6]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

[8]  Hans-Jürgen Bürckert,et al.  A Resolution Principle for a Logic with Restricted Quantifiers , 1991, Lecture Notes in Computer Science.

[9]  Peter D. Karp,et al.  OKBC: A Programmatic Foundation for Knowledge Base Interoperability , 1998, AAAI/IAAI.