Author:
Atserias Albert,Weyer Mark
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Ajtai, M., Fagin, R., Stockmeyer, L.J.: The closure of monadic NP. In: 30th Symp. on the Theory of Computing (1998)
2. Atserias, A., Bulatov, A.A., Dalmau, V.: On the power of k-consistency. In: 34th Intl. Colloq. on Automata, Languages and Programming, pp. 279–290 (2007)
3. Barto, L., Kozik, M., Maroti, M., Niven, T.: CSP dichotomy for special triads. Proc. Amer. Math. Soc. (to appear, 2009)
4. Barto, L., Kozik, M., Niven, T.: The CSP dichotomy holds for digraphs with no sources and no sinks. SIAM Journal on Computing 38(5), 1782–1802 (2009)
5. Bessiere, C., Debruyne, R.: Theoretical analysis of singleton arc consistency and its extensions. Artificial Intelligence 172(1), 29–41 (2008)
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Monotonic Determinacy and Rewritability for Recursive Queries and Views;ACM Transactions on Computational Logic;2023-03-17
2. One Hierarchy Spawns Another;ACM Transactions on Computational Logic;2017-12-19
3. On Ramsey properties of classes with forbidden trees;Logical Methods in Computer Science;2014-08-21
4. One hierarchy spawns another;Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS);2014-07-14
5. Background;Cognitive Technologies;2012