Some Notes on Pseudo-closed Sets

DOI10.1007/978-3-540-70901-5_10MaRDI QIDQ3590984zbMATH OpenOpenAlexFDO

Authors Sebastian Rudolph

Publication date 3 September 2007

Published in Formal Concept Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-70901-5_10

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• On a generalization of closed sets
• Some remarks on multiplicatively closed sets
• On nearly closed sets
• scientific article; zbMATH DE number 811702
• scientific article; zbMATH DE number 1036742
• A note on pseudocompactifications
• scientific article; zbMATH DE number 4034626
• scientific article; zbMATH DE number 2124085
• scientific article; zbMATH DE number 4064983
• scientific article; zbMATH DE number 219487

Cited in

(10)

• Hardness of enumerating pseudo-intents in the lectic order
• Fast algorithms for implication bases and attribute exploration using proper premises
• ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS
• Some Computational Problems Related to Pseudo-intents
• Note on \(IR\)-closed and \(A_{IR}\)-sets
• Some complexity results about essential closed sets
• Succinctness and tractability of closure operator representations
• On the complexity of enumerating pseudo-intents
• Some remarks on multiplicatively closed sets
• A note on P-selective sets and closeness

This page was built for publication: Some Notes on Pseudo-closed Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3590984)