Subsumption algorithms based on search trees

DOI10.1007/3-540-61064-2_34OpenAlexW1581406758MaRDI QIDQ5878906

Leo Bachmair, Ta Chen, I. V. Ramakrishnan, C. R. Ramakrishnan

Publication date: 23 February 2023

Published in: Trees in Algebra and Programming — CAAP '96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61064-2_34

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Uses Software

• OTTER
• TPTP

Cites Work

• Unnamed Item
• On the efficiency of subsumption algorithms
• The Concept of Weak Substitution in Theorem-Proving
• The TPTP problem library

This page was built for publication: Subsumption algorithms based on search trees