Partially adaptive code trees

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 1919, Issue , 2000, Pages 209-223

  Riazanov, Alexandre ^a   Voronkov, Andrei ^a  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Automated theorem proving; Code trees; Matching; Subsumption; Term indexing

Indexed keywords

ARTIFICIAL INTELLIGENCE; CODES (SYMBOLS); FORESTRY; INDEXING (OF INFORMATION);

ADAPTIVE VERSIONS; AUTOMATED THEOREM PROVING; CODE TREES; INDEXING TECHNIQUES; MATCHING; QUERY TERMS; SUBSUMPTION; THEOREM PROVERS;

THEOREM PROVING;

EID: 84943155194     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/3-540-40006-0_15     Document Type: Conference Paper

References (8)

1. J.Christian.Flatterms, discrimination nets, and fast term rewriting.Journal of Automated Reasoning, 10(1):95-113, February 1993.
2. P.Graf.Substitution tree indexing.In J.Hsiang, editor, Rewriting Techniques and Applications, volume 914 of Lecture Notes in Computer Science, pages 117-131, 1995.
3. William W.McCune.Experiments with discrimination-tree indexing and path indexing for term retrieval.Journal of Automated Reasoning, 9(2):147-167, 1992.
4. I.V.Ramakrishnan, R.Sekar, and A.Voronkov.Term indexing.In A.Robinson and A.Voronkov, editors, Handbook of Automated Reasoning.Elsevier Science and MIT Press, 2000.To appear.
5. A.Riazanov and A.Voronkov.Vampire.In H.Ganzinger, editor, Automated Deduction-CADE-16.16th International Conference on Automated Deduction, Lecture Notes in Artificial Intelligence, pages 292-296, Trento, Italy, July 1999.
6. J.M.A.Rivero.Data Structures and Algorithms for Automated Deduction with Equality.Phd thesis, Universitat Politècnica de Catalunya, Barcelona, May 2000.
7. G.Sutcliffe.The CADE-16 ATP system competition.Journal of Automated Reasoning, 2000.To appear.
8. A.Voronkov.The anatomy of Vampire: Implementing bottom-up procedures with code trees.Journal of Automated Reasoning, 15(2):237-265, 1995.