Partially adaptive code trees

DOI10.1007/3-540-40006-0_15MaRDI QIDQ4536327zbMATH OpenFDO

Authors Alexandre Riazanov, Andrei Voronkov

Publication date 25 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-40006-0_15

zbMATH Keywords

automated theorem provingcode treesmatchingsubsumptionterm indexing

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35)

Recommendations

• Codes Over Trees
• An improvement of the tree code construction
• scientific article; zbMATH DE number 475410
• The coding of binary trees
• A New Coding Algorithm for Trees
• Adaptive Design and Analysis Via Partitioning Trees for Emulation of a Complex Computer Code
• Self-adjusting binary search trees
• Tree approximation for hp-adaptivity
• On Adaptive Tree Polling Algorithms

Cited in

(6)

• Fast term indexing with coded context trees
• An efficient subsumption test pipeline for BS(LRA) clauses
• Efficient instance retrieval with standard and relational path indexing
• Context trees
• Term ordering diagrams
• Partial redundancy in saturation

Describes a project that uses

Uses Software

• VAMPIRE

This page was built for publication: Partially adaptive code trees

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