. "2009-12-31+01:00"^^ . . . . "90"^^ . . "0"^^ . "0"^^ . . "0"^^ . . "Constraint satisfaction problem"@en . "Hlavn\u00EDm c\u00EDlem spolupr\u00E1ce je umo\u017Enit \u010Desk\u00FDm a polsk\u00FDm \u0159e\u0161itel\u016Fm sd\u00EDlet zku\u0161enosti a my\u0161lenky t\u00FDkaj\u00EDc\u00ED se probl\u00E9mu splnitelnosti omezuj\u00EDc\u00EDch podm\u00EDnek (CSP), zejm\u00E9na ot\u00E1zky dichotomie. Spolupr\u00E1ce ji\u017E zapo\u010Dala \u010Detn\u00FDmi n\u00E1v\u0161t\u011Bvami polsk\u00FDch \u00FA\u010Dastn\u00EDk\u016F v \u010Cesk\u00E9 Republice, kter\u00E9 vedly k v\u00FDznamn\u00FDm p\u0159\u00EDsp\u011Bvk\u016Fm v dan\u00E9 oblasti. Spolupr\u00E1ce se zam\u011B\u0159\u00ED na algebraick\u00FD p\u0159\u00EDstup k probl\u00E9mu CSP, kter\u00FD se uk\u00E1zal b\u00FDt velmi plodn\u00FDm. V pr\u016Fb\u011Bhu \u0159e\u0161en\u00ED chceme roz\u0161\u00ED\u0159it t\u0159\u00EDdu probl\u00E9m\u016F, pro kter\u00E9 je dichotomie zn\u00E1ma, zejm\u00E9na se zam\u011B\u0159\u00EDme na t\u0159\u00EDdy orientovan\u00FDch graf\u016F. To povede k rozvoji teorie nutn\u00E9 k d\u016Fkazu (nebo vyvr\u00E1cen\u00ED) dichotomick\u00E9 domn\u011Bky. Prvn\u00EDm krokem je aplikovat algebraick\u00E9 n\u00E1stroje pro t\u0159\u00EDdy, pro n\u011B\u017E je dichotomie zn\u00E1ma: orientovan\u00E9 cesty, orientovan\u00E9 kru\u017Enice, turnaje a mnoho dal\u0161\u00EDch. Tento v\u00FDzkum poskytne v\u00FDchodisko k d\u016Fkazu dichotomie pro \u0161ir\u0161\u00ED t\u0159\u00EDdu digraf\u016F a jin\u00FDch rela\u010Dn\u00EDch struktur. Velmi d\u016Fle\u017Eit\u00E9 je uzp\u016Fsobit algebraick\u00E9 n\u00E1stroje, kter\u00E9 se ji\u017E uk\u00E1zali b\u00FDt velmi u\u017Eite\u010Dn\u00E9. Zkoum\u00E1n\u00ED malcevsk\u00FDch podm\u00EDnek ve s"@cs . "0"^^ . "1"^^ . "An Algebraic Approach to the Constraint Satisfaction Problem"@en . . . "The main goal of the cooperation is to provide an opportunity for Czech and Polish researchers to share their experience and exchange the ideas concerning the Constraint Satisfaction Problem, namely the dichotomy question. The cooperation has already been initiated with a number of visits of polish members in Czech Republic which resulted in a significant contribution to the development of the subject. The specific goals of the cooperation are designed in order to fully utilize the potential of an algebraic approach -- a potential already proved by the previous achievement of the authors of this application~(in a cooperation with Todd Niven). During the cooperation we want to enrich the collection of classes for which the dichotomy is known, concentrating on directed graphs, and thus developing the theory towards proving~(or disproving) the CSP dichotomy conjecture. The first step is to apply the algebraic tools for classes of digraphs with known dichotomies: oriented paths, oriented cycles, or"@en . . . "85"^^ . "Algebraick\u00FD p\u0159\u00EDstup k probl\u00E9mu splnitelnosti omezuj\u00EDc\u00EDch podm\u00EDnek"@cs . "2008-01-01+01:00"^^ .