On weak positive predicates over a finite set
Keyword(s):
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.
2019 ◽
Vol 29
(1)
◽
pp. 49-58
◽
Keyword(s):
1994 ◽
Vol 05
(03n04)
◽
pp. 293-302
◽
2010 ◽
Vol 20
(08)
◽
pp. 1001-1020
◽
1993 ◽
Vol 14
(2)
◽
pp. 99-109
◽
2007 ◽
pp. 272-284
◽
2021 ◽
pp. 1-20
Keyword(s):
2012 ◽
Vol 2012
◽
pp. 1-19
◽