On Generalization and Subsumption for Ordered Clauses
From MaRDI portal
Recommendations
Cites work
- Conjunctive query containment revisited
- Database Support for Data Mining Applications
- Foundations of inductive logic programming
- scientific article; zbMATH DE number 3872640 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1015105 (Why is no real title available?)
- scientific article; zbMATH DE number 3349328 (Why is no real title available?)
- scientific article; zbMATH DE number 3349329 (Why is no real title available?)
- Removing redundancy from a clause
Cited in
(7)- Generalized subsumption and its applications to induction and redundancy
- The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause
- The subsumption lattice and query learning
- scientific article; zbMATH DE number 1149427 (Why is no real title available?)
- Algorithmic Learning Theory
- On condensation of a clause.
- Generalization of clauses relative to a theory
This page was built for publication: On Generalization and Subsumption for Ordered Clauses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3617035)