Reference9 articles.
1. Chandra, A., (1981) Programming Primitives for Database Languages, 8th Symposium on Principles of Programming Languages, ACM, pp 50–62.
2. Chandra, A. and Harel, D., (1982) Structure and Complexity of Computable Queries, Journal of Comp. and System Sciences, 25, pp 99–128.
3. Chandra, A. and Harel, D., (1982) Horn Clauses and the Fixpoint Query Hierarchy, Proc. ACM Symp. on Principles of Database Systems.
4. Garey, M.R. and Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman.
5. Gurevich, Y., (1984) Toward Logic Tailored for Computational Complexity, Proc. Logic Colloq. Aachen 1983, Lecture Notes in Mathematics, Vol. 1104, pp 175–216, Springer-Verlag.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Computation on Structures;Logic, Computation and Rigorous Methods;2021
2. A Fixed-Point Logic with Symmetric Choice;Computer Science Logic;2003
3. Choice Construct and Lindström Logics;Computer Science Logic;1999