Inference systems for logical algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3821 LNCS, Issue , 2005, Pages 60-78

  Shankar, Natarajan ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTATIONAL GEOMETRY; COMPUTER SCIENCE; COMPUTER SYSTEMS; INFORMATION TECHNOLOGY;

DAVIS-PUTNAM-LOGEMANN-LOVELAND PROCEDURE; INFERENCE SYSTEMS; LOGICAL ALGORITHMS;

ALGORITHMS;

EID: 33744946297     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11590156_4     Document Type: Conference Paper

References (39)

1. [Ble77] W. W. Bledsoe. Non-resolution theorem proving, Artificial Intelligence, 9:1-36, 1977.
2. [BM79] R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, Now York, NY, 1979.
3. [BTV03] Leo Bachmair, Ashish Tiwari, and Laurent Vigneron, Abstract congruence closure. Journal of Automated Reasoning, 31(2):129-168, 2003.
4. [Buc76] B. Buchberger. A theoretical basis for the reduction of polynomials to canonical forms. ACM SIGSAM Bulletin, 10(3):19-29, 1976.
5. +86] R. L. Constable, S. F. Allen, H. M. Bromley, W. R. Cleaveland, J. F. Cremer, R. W. Harper, D. J. Howe, T. B. Knoblock, N. P. Mendler, P. Panangaden, J. T. Sasaki, and S. F. Smith. Implementing Mathematics with the Nuprl Proof Development System. Prentice Hall, Englewood Cliffs, NJ, 1986.
6. [Coh88] Jacques Cohen. A view of the origins and development of prolog. Communications of the ACM, 31(1):26-36, 1988.
7. [Dav57] M. Davis. A computer program for Presburger's algorithm. In Summaries of Talks Presented at the Summer Institute for Symbolic Logic, 1957. Reprinted in Siekmann and Wrightson [SW83], pages 41-48.
8. [dB80] N. G. de Bruijn. A survey of the project Automath. In To H. B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pages 589-606. Academic Press, 1980.
9. [DLL62] M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394-397, July 1962. Reprinted in Siekmann and Wrightson [SW83], pages 267-270, 1983.
10. [dMRS04] Leonardo de Moura, Harald Rueß, and Natarajan Shankar. Justifying equality. In Proceedings of PDPAR '04, 2004.
11. [DP60a] M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
12. [DP60b] M. Davis and H. Putnam. A computing procedure for quantification theory. JACM, 7(3):201-215, 1960.
13. [DST80] P. J. Downey, R. Sethi, and R. E. Tarjan. Variations on the common subex-pressions problem. Journal of the ACM, 27(4):758-771, October 1980.
14. [GM93] M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge, UK, 1993.
15. [GMW79] M. Gordon, R. Milner, and C. Wadsworth. Edinburgh LCF: A Mechanized Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
16. [GRS04] H. Ganzinger, H. Rueß, and N. Shankar. Modularity and refinement in inference systems. Technical Report CSL-SRI-04-02, SRI International, Computer Science Laboratory, 333 Ravenswood Ave, Menlo Park, CA, 94025, January 2004. Revised, August 2004.
17. [Har96] John Harrison. HOL Light: A tutorial introduction. In Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD'96), volume 1166 of Lecture Notes in Computer Science, pages 265-269. Springer-Verlag, 1996.
18. [Kap97] Deepak Kapur. Shostak's congruence closure as completion. In H. Comon, editor, International Conference on Rewriting Techniques and Applications, RTA '97, number 1232 in Lecture Notes in Computer Science, pages 23-37, Berlin, 1997. Springer-Verlag.
19. [KB70] D. E. Knuth and P. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebras, pages 263-297. Pergamon Press, Oxford, 1970.
20. [Kle52] S. C. Kleene. Introduction to Metamathematics. North-Holland, Amsterdam, 1952.
21. [KMM00] Matt Kaufmann, Panagiotis Manolios, and J Strother Moore. Computer-Aided Reasoning: An Approach, volume 3 of Advances in Formal Methods. Kluwer, 2000.
22. [Koz77] Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164-177, Boulder, Colorado, 2-4 May 1977.
23. [LP92] Z. Luo and R. Pollack. The LEGO proof development system: A user's manual. Technical Report ECS-LFCS-92-211, University of Edinburgh, 1992.
24. [McC62] J. McCarthy. Computer programs for checking mathematical proofs. In Recursive Function Theory, Proceedings of a Symposium in Pure Mathematics, volume V, pages 219-227, Providence, Rhode Island, 1962. American Mathematical Society.
25. [McC97] W. W. McCiine. Solution of the Robbina problem. Available from ftp://info.mcs.anl.gov/pub/Otter/www-misc/robbins-jar-submitted.ps.gz, 1997.
26. [NO79] G. Nelson and D. C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245-257, 1979.
27. [NO05] Robert Nieuwenhuis and Albert Oliveras. Proof-Producing Congruence Closure. In Jürgen Giesl, editor, Proceedings of the 16th International Conference on Term Rewriting and Applications, RTA '05 (Nara, Japan), volume 3467 of Lecture Notes in Computer Science, pages 453-468. Springer, 2005.
28. [NSS57] A. Newell, J. C. Shaw, and H. A. Simon, Empirical explorations with the logic theory machine: A case, study in heuristics. In Proc. West. Joint Comp. Conf., pages 218-239, 1957. Reprinted in Siekmann and Wrightson [SW83], pages 49-73, 1983.
29. [Pau94] Lawrence C. Paulson. Isabelle: A Generic Theorem Prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994.
30. [Rob65a] J. A. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23-41, 1965.
31. [Rob65b] J.A. Robinson. Automatic deduction with hyper-resolution. International Journal of Computational Mathematics, 1:227-234, 1965.
32. [RV01] A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science, 2001.
33. [Sho78] Robert E. Shostak. An algorithm for reasoning about equality, Communications of the ACM, 21(7):583-585, July 1978.
34. [Sho79] Robert E. Shostak. A practical decision procedure for arithmetic with function symbols. Journal of the ACM, 26(2):351-360, April 1979.
35. [Sho84] Robert E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1-12, January 1984.
36. [SS98] G. Sutcliffe and C.B. Suttner. The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning, 21(2):177-203, 1998.
37. [SW83] J. Siekmann and G. Wrightson, editors. Automation of Reasoning: Classical Papers on Computational Logic, Volumes 1 & 2. Springer-Verlag, 1983.
38. [Tea05] Coq Development Team. The Coq proof assistant reference manual, version 8.0. Technical report, INRIA, Rocquencourt, France, January 2005.
39. [WRC65] L. Wos, G.A. Robinson, and D. Carson. Efficiency and completeness of the set of support strategy in theorem proving. Journal of the ACM, 12(4):536-541, 1965.