Commutative idempotent groupoids and the constraint satisfaction problem
暂无分享,去创建一个
[1] R. Padmanabhan,et al. Subdirect decomposition of Płonka sums , 1972 .
[2] 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..
[3] M. Maróti,et al. Existence theorems for weakly symmetric operations , 2008 .
[4] Libor Barto,et al. Constraint Satisfaction Problems of Bounded Width , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[5] Peter Jeavons,et al. On the Algebraic Structure of Combinatorial Problems , 1998, Theor. Comput. Sci..
[6] P. Jeavons. Algebraic structures in combinatorial problems , 2001 .
[7] Jerzy Płonka,et al. On a method of construction of abstract algebras , 1967 .
[8] Thomas J. Schaefer,et al. The complexity of satisfiability problems , 1978, STOC.
[9] J. D. Phillips,et al. The varieties of quasigroups of Bol–Moufang type: An equational reasoning approach , 2005 .
[10] Kenneth Kunen,et al. Single axioms for odd exponent groups , 2004, Journal of Automated Reasoning.
[11] David Stanovský. Distributive groupoids are symmetric-by-medial: An elementary proof , 2008 .
[12] Peter Jeavons,et al. Classifying the Complexity of Constraints Using Finite Algebras , 2005, SIAM J. Comput..
[13] Petr Vojtěchovský,et al. The varieties of loops of Bol-Moufang type , 2005 .
[14] W. Taylor. Varieties Obeying Homotopy Laws , 1977, Canadian Journal of Mathematics.
[15] B. Larose,et al. Bounded width problems and algebras , 2007 .
[16] Stanley Burris,et al. A course in universal algebra , 1981, Graduate texts in mathematics.
[17] Reza Akhtar,et al. The varieties of Bol-Moufang quasigroups de ned by a single operation , 2010 .
[18] Anna B. Romanowska,et al. On regular and regularised varieties , 1986 .
[19] The lattice of varieties of commutative abelian distributive groupoids , 1975 .
[20] G. Birkhoff,et al. On the Structure of Abstract Algebras , 1935 .
[21] Alan K. Mackworth. Consistency in Networks of Relations , 1977, Artif. Intell..
[22] Víctor Dalmau,et al. Generalized majority-minority operations are tractable , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).
[23] C. Bergman,et al. Universal Algebra: Fundamentals and Selected Topics , 2011 .
[24] R. Quackenbush. Varieties Of Steiner Loops and Steiner Quasigroups , 1976, Canadian Journal of Mathematics.
[25] Kenneth Kunen,et al. Quasigroups, Loops, and Associative Laws , 1996 .
[26] A. Bulatov. Combinatorial problems raised from 2-semilattices , 2006 .
[27] Benoît Larose,et al. The Complexity of the Extendibility Problem for Finite Posets , 2003, SIAM J. Discret. Math..
[28] Pawel M. Idziak,et al. Tractability and learnability arising from algebras with few subpowers , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).
[29] A. I. Mal'tsev. Multiplication of classes of algebraic systems , 1967 .
[30] G. Birkhoff. Subdirect unions in universal algebra , 1944 .
[31] R. Willard,et al. Characterizations of several Maltsev conditions , 2015 .
[32] Marc Gyssens,et al. Closure properties of constraints , 1997, JACM.
[33] Andrei A. Bulatov,et al. A Simple Algorithm for Mal'tsev Constraints , 2006, SIAM J. Comput..
[34] Andrei A. Bulatov,et al. Recent Results on the Algebraic Approach to the CSP , 2008, Complexity of Constraints.
[35] Jerzy Płonka. On equational classes of abstract algebras defined by regular equations , 1969 .
[36] Keith A. Kearnes,et al. The Shape of Congruence Lattices , 2013 .