论文信息 - Expressibility of First Order Logic with a Nondeterministic Inductive Operator - 字舞流文

Expressibility of First Order Logic with a Nondeterministic Inductive Operator

Vikraman Arvind | Somenath Biswas

[1] Yuri Gurevich,et al. Toward logic tailored for computational complexity , 1984 .

[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3] Jeffrey D. Ullman,et al. Principles of Database Systems , 1980 .

[4] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5] Ashok K. Chandra. Programming primitives for database languages , 1981, POPL '81.

[6] Neil Immerman,et al. Relational queries computable in polynomial time (Extended Abstract) , 1982, STOC '82.

[7] David Harel,et al. Horn clauses and the fixpoint query hierarchy , 1982, PODS.

[8] Neil Immerman. Languages Which Capture Complexity Classes (Preliminary Report) , 1983, STOC 1983.

[9] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.