"Knowledge is a specific type of information that can improve the efficiency of problem solving. During automated problem solving it may happen that knowl-edge that is known at the user level is lost in formalization. Hence, it seems useful to re-discover this knowledge to improve the efficiency of problem solving. This paper describes a method for identifying equivalent nodes in the precedence graph with alternative branches. Such graphs are useful for modeling manufacturing (and other) processes. Unfortunately, the formal model (which uses the precedence graph with alternatives) loses information about logical dependencies between some nodes while this information can be useful for efficient problem solving. The paper shows that identifying equivalent nodes is an NP-hard problem. It also presents an algorithm that can discover some equivalence groups that appear frequently in real-life problems." . . "Ostrava" . "Ostrava" . . . . . "RIV/00216208:11320/07:00004951" . . "Vysok\u00E1 \u0161kola b\u00E1\u0148sk\u00E1 - Technick\u00E1 univerzita Ostrava" . "\u010Cl\u00E1nek ukazuje, \u017Ee identifikovat ekvivalentn\u00ED uzly v preceden\u010Dn\u00EDch s\u00EDt\u00ED s alternativami je NP t\u011B\u017Ek\u00FD probl\u00E9m a popisuje heuristick\u00FD algoritmus pro hled\u00E1n\u00ED ekvivalenc\u00ED."@cs . . "Knowledge is a specific type of information that can improve the efficiency of problem solving. During automated problem solving it may happen that knowl-edge that is known at the user level is lost in formalization. Hence, it seems useful to re-discover this knowledge to improve the efficiency of problem solving. This paper describes a method for identifying equivalent nodes in the precedence graph with alternative branches. Such graphs are useful for modeling manufacturing (and other) processes. Unfortunately, the formal model (which uses the precedence graph with alternatives) loses information about logical dependencies between some nodes while this information can be useful for efficient problem solving. The paper shows that identifying equivalent nodes is an NP-hard problem. It also presents an algorithm that can discover some equivalence groups that appear frequently in real-life problems."@en . . "Hled\u00E1n\u00ED t\u0159\u00EDd ekvivalence v preceden\u010Dn\u00EDch grafech"@cs . "Hled\u00E1n\u00ED t\u0159\u00EDd ekvivalence v preceden\u010Dn\u00EDch grafech"@cs . "Discovering Equivalence Classes in Precedence Graphs"@en . "Znalosti 2007" . "Discovering Equivalence Classes in Precedence Graphs" . "3"^^ . "Bart\u00E1k, Roman" . "17;28" . "3"^^ . "[FE82B919837E]" . . "RIV/00216208:11320/07:00004951!RIV08-MSM-11320___" . "978-80-248-1279-3" . "Discovering; Equivalence; Classes; Precedence; Graphs"@en . . . "11320" . . "417481" . . . . "Discovering Equivalence Classes in Precedence Graphs"@en . "P(1M0545), P(GA201/07/0205), Z(MSM0021620838)" . . . . . . "Discovering Equivalence Classes in Precedence Graphs" . "2007-01-01+01:00"^^ . . . . "Surynek, Pavel" . "12"^^ . "\u010Cepek, Ond\u0159ej" .