Key (critical) relations preserved by a weak near-unanimity function
暂无分享,去创建一个
[1] Dmitriy Zhuk. The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic , 2011, 2011 41st IEEE International Symposium on Multiple-Valued Logic.
[2] M. Maróti,et al. Existence theorems for weakly symmetric operations , 2008 .
[3] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[4] V. A. Taimanov. On Cartesian Powers of P2 , 1987, FCT.
[5] Emil L. Post. The two-valued iterative systems of mathematical logic , 1942 .
[6] Andrei A. Bulatov,et al. Recent Results on the Algebraic Approach to the CSP , 2008, Complexity of Constraints.
[7] Dietlinde Lau. Bestimmung der Ordnung Maximaler Klassen von Funktionen der k-Wertigen Logik , 1978, Math. Log. Q..
[8] Keith A. Kearnes,et al. Clones of Algebras with Parallelogram Terms , 2012, Int. J. Algebra Comput..
[9] Tomás Feder,et al. The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory , 1999, SIAM J. Comput..
[10] Dmitriy Zhuk. The predicate method to construct the Post lattice , 2011 .
[11] Dmitriy Zhuk. The cardinality of the set of all clones containing a given minimal clone on three elements , 2012 .
[12] Martin C. Cooper,et al. Constraints, Consistency and Closure , 1998, Artif. Intell..