Материалы VI Международной молодежной научной конференции "Математическое и программное обеспечение информационных, технических и экономических систем", Томск, 24-26 мая 2018 г.

Сборник содержит материалы VI Всероссийской молодёжной научной конференции «Математическое и программное обеспечение информационных, технических и экономических систем», проводившейся 24–26 мая 2018 г. на базе Института прикладной математики и компьютерных наук Томского государственного университета. Материалы сгруппированы в соответствии с работавшими на конференции секциями

Horn Minimization by Iterative Decomposition

... this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a "shorter" CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations

Horn Minimization by Iterative Decomposition

. The problem of Horn minimization can be stated as follows: given a Horn CNF representing a Boolean function f , find a CNF representation of f which consists of a minimum possible number of clauses. This problem is the formalization of the problem of knowledge compression for speeding up queries to propositional Horn expert systems, and it is known to be NP-hard. In this paper we present a linear time algorithm which takes a Horn CNF as an input, and through a series of decompositions reduces the minimization of the input CNF to the minimization problem on a "shorter" CNF. The correctness of this decomposition algorithm rests on several interesting properties of Horn functions which, as we prove here, turn out to be independent of the particular CNF representations. Acknowledgements: The authors gratefully acknowledge the partial support by the Office of Naval Research (grants N00014-92-J1375 and N00014-92-J4083). The first author also grateful for the partial support by NSF (grant I..