Vampire 1.1 (System Description)

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

Volumn 2083 LNAI, Issue , 2001, Pages 376-380

  Riazanov, Alexandre ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; THEOREM PROVING; SEMANTICS;

ALGORITHMS AND DATA STRUCTURES; GENERAL DESCRIPTION; INDEXING TERMS; PROOF SEARCH; SELECTION SCHEME; SIMPLIFICATION RULES; SYSTEM DESCRIPTION; THEOREM PROVERS;

DATA STRUCTURES; COMPUTATION THEORY;

EID: 84867820806     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_29     Document Type: Conference Paper

References (13)

1. J. Avenhaus, J. Denzinger, and M. Fuchs. DISCOUNT: a system for distributed equational deduction. In J. Hsiang, editor, Proceedings of the 6th International Conference on Rewriting Techniques and Applications (RTA-95), volume 914 of Lecture Notes in Computer Science, pages 397-402, Kaiserslautern, 1995.
2. F. Baader and T. Nipkow. Term Rewriting and and All That. Cambridge University press, Cambridge, 1998.
3. L. Bachmair and H. Ganzinger. Resolution theorem proving. In A. Robinson and A. Voronkov, editors, Handbook of Automated Reasoning. Elsevier Science and MIT Press, 2001. To appear.
4. A. Degtyarev and A. Voronkov. Stratified resolution. In D. McAllester, editor, 17th International Conference on Automated Deduction (CADE-17), volume 1831 of Lecture Notes in Artificial Intelligence, pages 365-384, Pittsburgh, 2000. Springer Verlag.
5. Th. Hillenbrand, A. Buch, R. Vogt, and B. Löchner. Waldmeister: Highperformance equational deduction. Journal of Automated Reasoning, 18(2):265-270, 1997.
6. W.W. McCune. OTTER 3.0 reference manual and guide. Technical Report ANL-94/6, Argonne National Laboratory, January 1994.
7. W. Pugh. Skip lists: A probabilistic alternative to balanced trees. Communications of the ACM, 33(6):668-676, 1990.
8. A. Riazanov and A. Voronkov. Limited resource strategy in resolution theorem proving. Preprint CSPP-7, Department of Computer Science, University of Manchester, October 2000.
9. A. Riazanov and A. Voronkov. Implementing backward subsumption and search for instances with path indexing and joins. 2001. To appear.
10. A. Riazanov and A. Voronkov. Splitting without backtracking. Preprint CSPP-10, Department of Computer Science, University of Manchester, January 2001. Accepted to IJCAI 2001.
11. S. Schulz. System abstract: E 0.3. In H. Ganzinger, editor, Automated Deduction - CADE-16. 16th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, pages 297-301, Trento, Italy, July 1999.
12. M. Stickel. The path indexing method for indexing terms. Technical Report 473, Artificial Intelligence Center, SRI International, Menlo Park, CA, October 1989.
13. C. Weidenbach, B. Afshordel, U. Brahm, C. Cohrs, T. Engel, E. Keen, C. Theobalt, and D. Topic. System description: Spass version 1.0.0. In H. Ganzinger, editor, Automated Deduction - CADE-16. 16th International Conference on Automated Deduction, volume 1632 of Lecture Notes in Artificial Intelligence, pages 378-382, Trento, Italy, July 1999.