Funder
Russian Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference38 articles.
1. Afrati, F., Cosmadakis, S., Yannakakis, M.: On datalog vs polynomial time. J. Comput. Syst. Sci. 51(2), 177–196 (1995)
2. Ajtai, M.: Σ 1 1 ${{\Sigma }_{1}^{1}}$ -formulae on finite structures. Ann. Pure Appl. Logic 24(1), 1–48 (1983)
3. Alon, N., Boppana, R.: The monotone circuit complexity of Boolean functions. Combinatorica 7(1), 1–22 (1987)
4. Artale, A., Calvanese, D., Kontchakov, R., Zakharyaschev, M.: The DL-Lite family and relations. J. Artif. Intell. Res. 36, 1–69 (2009)
5. Baget, J.-F., Leclère, M., Mugnier, M.-L., Salvat, E.: Extending decidable cases for rules with existential variables. In: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (IJCAI 2009), pages 677–682. IJCAI (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献