"Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing" . . . "[589F70064AB9]" . "11320" . . "Known; classes; generalized; formulae; polynomial; recognition; testing"@en . "0166-218X" . . "Discrete Applied Mathematics" . . "1" . "Zn\u00E1m\u00E9 a nov\u00E9 t\u0159\u00EDdy zobecn\u011Bn\u00FDch Hornovsk\u00FDch formul\u00ED s rozpozn\u00E1v\u00E1n\u00EDm a SATem v polynomi\u00E1ln\u00EDm \u010Dase"@cs . "1"^^ . . "NL - Nizozemsko" . . . . "2"^^ . . . "14;52" . "39"^^ . . . "Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing"@en . "Zn\u00E1m\u00E9 a nov\u00E9 t\u0159\u00EDdy zobecn\u011Bn\u00FDch Hornovsk\u00FDch formul\u00ED s rozpozn\u00E1v\u00E1n\u00EDm a SATem v polynomi\u00E1ln\u00EDm \u010Dase"@cs . . "Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing" . . . "P(GA201/04/1102), Z(MSM0021620838)" . "In this paper we study several classes of Boolean formulae which generalize Horn formulae while preserving one of their main properties, namely the fact that satisfiability is decidable in polynomial time. We compare the known classes with respect to inclusion and define a hierarchy of new classes, which properly contains some of the known classes."@en . "\u010Cepek, Ond\u0159ej" . "526885" . "RIV/00216208:11320/05:00001320" . "149" . . "RIV/00216208:11320/05:00001320!RIV06-MSM-11320___" . "V tomto \u010Dl\u00E1nku zkoum\u00E1me n\u011Bkolik t\u0159\u00EDd Booleovsk\u00FDch formul\u00ED, kter\u00E9 zobec\u0148uj\u00ED Hornovsk\u00E9 formule a p\u0159itom maj\u00ED tak\u00E9 tu vlastnost, \u017Ee je pro n\u011B SAT testovateln\u00FD v polynomi\u00E1ln\u00EDm \u010Dase. Zn\u00E1m\u00E9 t\u0159\u00EDdy jsou porovn\u00E1ny vzhledem k inkluzi a d\u00E1le je definov\u00E1na hierarchie nov\u00FDch t\u0159\u00EDd, kter\u00E1 obsahuje n\u011Bkter\u00E9 ze zn\u00E1m\u00FDch t\u0159\u00EDd jako vlastn\u00ED podmno\u017Einy."@cs . . . "In this paper we study several classes of Boolean formulae which generalize Horn formulae while preserving one of their main properties, namely the fact that satisfiability is decidable in polynomial time. We compare the known classes with respect to inclusion and define a hierarchy of new classes, which properly contains some of the known classes." . "Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing"@en . . .