Subsumption algorithms based on search trees
From MaRDI portal
Recommendations
- On the efficiency of subsumption algorithms
- AI*IA 2003: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 3945370
- Algorithms on Subtree Filament Graphs
- An optimal algorithm for computing all subtree repeats in trees
- An optimal algorithm for computing all subtree repeats in trees
- A Common Subexpression Elimination Tree Algorithm
- INDUCTIVE ALGORITHMS ON FINITE TREES
- On tree search algorithms
- scientific article; zbMATH DE number 1173838
Cites work
Cited in
(16)- A new subsumption method in the connection graph proof procedure
- On subsumption in distributed derivations
- A disjunctive positive refinement of model elimination and its application to subsumption deletion
- On deciding subsumption problems
- scientific article; zbMATH DE number 3862479 (Why is no real title available?)
- On anti-subsumptive knowledge enforcement
- A restarted strategy for efficient subsumption testing
- scientific article; zbMATH DE number 3945370 (Why is no real title available?)
- On the efficiency of subsumption algorithms
- scientific article; zbMATH DE number 4072424 (Why is no real title available?)
- Subgoal alternation in model elimination
- Advanced indexing operations on substitution trees
- scientific article; zbMATH DE number 970722 (Why is no real title available?)
- On condensation of a clause.
- AI*IA 2003: Advances in Artificial Intelligence
- Fast subsumption checks using anti-links
This page was built for publication: Subsumption algorithms based on search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5878906)