Geodesic
On bijunctive predicates over a~finite set
Diskretnaya Matematika, Tome 29 (2017) no. 4, pp. 130-142

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper is concerned with representations of predicates over a finite set in the form of generalized conjunctive normal forms (GCNF). Properties of predicates GCNF are found which are preserved by some majority function. Such predicates are called generalized bijunctive predicates. These properties are used to construct new faster polynomial algorithms for the generalized satisfiability problem in the case when some majority function preserves all the original predicates.
Keywords: predicate over a finite set, function over a finite set, majority function, bijunctive predicate, conjunctive normal form, generalized satisfiability problem (constraint satisfaction problems), polynomial problem. 
@article{DM_2017_29_4_a8,
     author = {S. N. Selezneva},
     title = {On bijunctive predicates over a~finite set},
     journal = {Diskretnaya Matematika},
     pages = {130--142},
     publisher = {mathdoc},
     volume = {29},
     number = {4},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DM_2017_29_4_a8/}
}
TY  - JOUR
AU  - S. N. Selezneva
TI  - On bijunctive predicates over a~finite set
JO  - Diskretnaya Matematika
PY  - 2017
SP  - 130
EP  - 142
VL  - 29
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DM_2017_29_4_a8/
LA  - ru
ID  - DM_2017_29_4_a8
ER  - 
%0 Journal Article
%A S. N. Selezneva
%T On bijunctive predicates over a~finite set
%J Diskretnaya Matematika
%D 2017
%P 130-142
%V 29
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DM_2017_29_4_a8/
%G ru
%F DM_2017_29_4_a8
S. N. Selezneva. On bijunctive predicates over a~finite set. Diskretnaya Matematika, Tome 29 (2017) no. 4, pp. 130-142. http://geodesic.mathdoc.fr/item/DM_2017_29_4_a8/