Reductions and saturation reductions of (abstract) knowledge bases
From MaRDI portal
Publication:276409
DOI10.1016/J.ENTCS.2014.01.012zbMATH Open1337.68248OpenAlexW2094012026WikidataQ113317911 ScholiaQ113317911MaRDI QIDQ276409FDOQ276409
Publication date: 3 May 2016
Full work available at URL: https://doi.org/10.1016/j.entcs.2014.01.012
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
Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)
Cites Work
- Rough sets
- Reduction and axiomization of covering generalized rough sets.
- Title not available (Why is that?)
- Continuous Lattices and Domains
- Verification of knowledge bases based on containment checking
- Knowledge reduction based on the equivalence relations defined on attribute set and its power set
- Comparative study of alternative types of knowledge reduction in inconsistent systems
- Rudiments of rough sets
Cited In (3)
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)