Author:
Bulatov Andrei A.,Krokhin Andrei A.,Jeavons Peter
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. W. Bibel. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence, 35, 1988, 401–413.
2. A. Bulatov, A. Krokhin, P. Jeavons. Constraint satisfaction problems and finite algebras. Oxford University Computing Lab. Technical Report, PRG-TR-4-99.
3. T. Feder, M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. Computing, 28(1), 1998, 57–104.
4. M. Garey, D.S. Johnson. Computers and Intractabilty: A Guide to the Theory of NP-Completeness. Freeman, San-Fransisco, CA, 1979.
5. M. Gyssens, P. Jeavons, D. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1), 1994, 57–89.
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献