Optimization problems on posets with regard to formal concept analysis

DOI10.1016/J.IJAR.2021.12.005MaRDI QIDQ2076983zbMATH OpenOpenAlexFDO

Authors Christian D. Jäkel, Stefan E. Schmidt

Publication date 22 February 2022

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ijar.2021.12.005

zbMATH Keywords

blocking setcover problemformal concept analysispacking problemposet

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Recommendations

• scientific article; zbMATH DE number 877297
• Packing problems, dimensions and the tensor product of complete lattices
• Completions of posets and formal concept analysis
• Mathematical aspects of concept analysis
• Lower and upper concept lattices

Cites work

• An Algorithm for the Vertex Packing Problem
• Blocking sets in PG(2, p) for small p, and partial spreads in PG(3,7)
• scientific article; zbMATH DE number 3523605 (Why is no real title available?)
• scientific article; zbMATH DE number 3523606 (Why is no real title available?)
• Independence numbers of product graphs
• Packing problems, dimensions and the tensor product of complete lattices
• Tensorial decomposition of concept lattices
• Varieties generated by lattices of breadth two

This page was built for publication: Optimization problems on posets with regard to formal concept analysis

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