Abstract

This paper addresses three closely related optimization problems: the set cover problem, the decision rule length minimization problem, and the maximum rule length minimization problem within a complete system of decision rules. New algorithms for the set cover problem are proposed and applied to the decision rules domain.

Recommended Citation

Zielosko, B., Jabloński, K., Ostonov, A. & Moshkov, M.(2026). From the set cover problem to the decision: minimizing patterns for knowledge representation in information systems. In M. Valenta, B. Mannová, R. Pergl, A. Przybylek, M. Lang, H. Linger, C. Schneider, N. Iivari, & E. Insfran (Eds.), Making ISD Sustainable: Reloaded with AI and Automation (ISD2026 Proceedings). Prague, Czech Republic: Czech Technical University in Prague. ISBN: 978-80-01-07585-2. https://doi.org/10.62036/ISD.2026.67

Paper Type

Poster

DOI

10.62036/ISD.2026.67

Download

Share

COinS
 

From the set cover problem to the decision: minimizing patterns for knowledge representation in information systems

This paper addresses three closely related optimization problems: the set cover problem, the decision rule length minimization problem, and the maximum rule length minimization problem within a complete system of decision rules. New algorithms for the set cover problem are proposed and applied to the decision rules domain.