Reductions and saturation reductions of (abstract) knowledge bases
From MaRDI portal
Publication:276409
Recommendations
- \(\ast\)-reductions in a knowledge base
- Knowledge Reduction in Concept Lattices Based on Irreducible Elements
- Rules reduction for knowledge representation systems
- Verifying Context-Dependent Reduction Relations for Knowledge Specifications
- \(\overline{F}\)-knowledge and its \(F\)-reduction theorems
- ``Reducing classic to practice: Knowledge representation theory meets reality
- On relative reduction of knowledges in covering decision systems
- Reduction of knowledge via minimal approximation space and graphs
Cites work
- scientific article; zbMATH DE number 3581219 (Why is no real title available?)
- Comparative study of alternative types of knowledge reduction in inconsistent systems
- Continuous Lattices and Domains
- Knowledge reduction based on the equivalence relations defined on attribute set and its power set
- Reduction and axiomization of covering generalized rough sets.
- Rough sets
- Rudiments of rough sets
- Verification of knowledge bases based on containment checking
Cited in
(4)
This page was built for publication: Reductions and saturation reductions of (abstract) knowledge bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q276409)