Two new homomorphism dualities and lattice operations
Two new homomorphism dualities and lattice operations
复制标题
两个新的同态对偶性和晶格运算
DOI:
10.1093/logcom/exq030
复制
发表时间:
2010
影响因子:
0.7
通讯作者:
Carvalho C
中科院分区:
文献类型:
--
作者:
Carvalho C
The study of constraint satisfaction problems (CSPs) definable in various fragments of Datalog has recently gained considerable importance.We consider CSPs that are definable in the smallest natural recursive fragment of Datalog—monadic linear Datalog with at most one EDB (extensional database predicates) per rule, and also in the smallest nonlinear extension of this fragment. We give combinatorial and algebraic characterizations of such problems, in terms of homomorphism dualities and lattice operations, respectively.We then apply our results to study graph H-colouring problems.
登录
查看更多内容
DOI:
10.1142/s0218196797000253
发表时间:
1997
期刊:
Int. J. Algebra Comput.
影响因子:
--
作者:
L. Zádori
通讯作者:
L. Zádori
DOI:
--
发表时间:
1999
期刊:
International Conference on Principles and Practice of Constraint Programming
影响因子:
--
作者:
V. Dalmau;J. Pearson
通讯作者:
J. Pearson
DOI:
10.1016/j.ejc.2007.11.004
发表时间:
2005
期刊:
20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
影响因子:
--
作者:
Albert Atserias
通讯作者:
Albert Atserias
DOI:
10.1137/s0895480104445630
发表时间:
2005
期刊:
SIAM J. Discret. Math.
影响因子:
--
作者:
J. Nesetril;Claude Tardif
通讯作者:
Claude Tardif
DOI:
10.1016/j.ejc.2007.11.007
发表时间:
2008
期刊:
Eur. J. Comb.
影响因子:
--
作者:
C. Loten;Claude Tardif
通讯作者:
Claude Tardif