Optimization problems on posets with regard to formal concept analysis

DOI10.1016/j.ijar.2021.12.005OpenAlexW4200533965MaRDI QIDQ2076983

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

posetpacking problemformal concept analysisblocking setcover problem

Mathematics Subject Classification ID

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

Cites Work

• Tensorial decomposition of concept lattices
• Varieties generated by lattices of breadth two
• Packing problems, dimensions and the tensor product of complete lattices
• An Algorithm for the Vertex Packing Problem
• Blocking sets in PG(2, p) for small p, and partial spreads in PG(3,7)
• Independence numbers of product graphs
• Unnamed Item
• Unnamed Item

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