Some Notes on Pseudo-closed Sets

DOI10.1007/978-3-540-70901-5_10zbMath1187.68593OpenAlexW1591313437MaRDI QIDQ3590984

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)

Related Items (4)

On the complexity of enumerating pseudo-intents ⋮ ON THE NON-REDUNDANT REPRESENTATION OF THE MINIMAX BASIS OF STRONG ASSOCIATIONS ⋮ Succinctness and tractability of closure operator representations ⋮ Fast algorithms for implication bases and attribute exploration using proper premises

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