Abstract
Abstract
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.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference20 articles.
1. “Classifying the complexity of constraints using finite algebras”;SIAM J. Comput.,2005
2. “Tractable constraints on ordered domains”;Artificial Intelligence,1995
3. “From local to global consistency”;Artificial Intelligence,1992
4. “Closure properties of constraints”;J. ACM,1997
5. “Complexity of satisfiability problems”;Proc. of the 10th ACM Symp. Theory of Computing,1978
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On properties of multiaffine predicates on a finite set;Discrete Mathematics and Applications;2023-08-01
2. On weak positive predicates over a finite set;Discrete Mathematics and Applications;2020-06-25