Efficient instance retrieval with standard and relational path indexing

DOI10.1016/J.IC.2004.10.012zbMATH Open1081.68018OpenAlexW2057367693MaRDI QIDQ2486586FDOQ2486586

Authors: Alexandre Riazanov, Andrei Voronkov 

Publication date: 5 August 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2004.10.012

Recommendations

• Extended path-indexing
• Path indexing for AC-theories
• Substitution tree indexing
• Fingerprint indexing for paramodulation and rewriting
• scientific article; zbMATH DE number 1552512

zbMATH Keywords

Backward demodulationInstance retrievalPath indexing

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experiments with discrimination-tree indexing and path indexing for term retrieval
• Title not available (Why is that?)
• The anatomy of vampire. Implementing bottom-up procedures with code trees
• Paramodulation-based theorem proving
• Term indexing
• Title not available (Why is that?)
• Handbook of automated reasoning. In 2 vols
• Title not available (Why is that?)
• Title not available (Why is that?)
• Automata-driven indexing of prolog clauses
• Substitution tree indexing
• Title not available (Why is that?)

Cited In (2)

• Simple and Efficient Clause Subsumption with Feature Vector Indexing
• An efficient subsumption test pipeline for BS(LRA) clauses

Uses Software

• VAMPIRE
• TPTP
• E Theorem Prover
• Waldmeister

This page was built for publication: Efficient instance retrieval with standard and relational path indexing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2486586)