Affiliation:
1. Lomonosov Moscow State University, Moscow, Russia
Abstract
AbstractPredicates that are preserved by a semi-lattice function are considered. These predicates are called weak positive. A representation of these predicates are proposed in the form of generalized conjunctive normal forms (GCNFs). Properties of GCNFs of these predicates are obtained. Based on the properties obtained, more efficient polynomial-time algorithms are proposed for solving the generalized satisfiability problem in the case when all initial predicates are preserved by a certain semi-lattice function.
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference24 articles.
1. “An algorithm for constraint satisfaction problem”;Proc. IEEE 47th Int. Symp. Multiple-Valued Logic,2017
2. “The property of being polynomial for Mal’tsev constraint satisfaction problems”;Algebra and Logic,2006
3. “Closure properties of constraints”;J. ACM,1997
4. “Complexity of satisfiability problems”;Proc. 10th ACM Symp. Theory of Computing,1978
5. “Tractable constraints on ordered domains”;Artificial Intelligence,1995
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献