Sergei Vorobyov et Andrie Voronkov, Proceedings of the Seventeenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS '98), New York, NY, USA, ACM, , 244–253 p. (ISBN0-89791-996-3, DOI10.1145/275487.275515), « Complexity of Nonrecursive Logic Programs with Complex Values ».
(en) Sergei Vorobyov, Automated Deduction — Cade-13 : 13th International Conference on Automated Deduction New Brunswick, NJ, USA, July 30 – August 3, 1996, Proceedings, vol. 1104, Springer, coll. « Lecture Notes in Computer Science », , 275–287 p. (DOI10.1007/3-540-61511-3_91), « An improved lower bound for the elementary theories of trees ».
mit.edu
people.csail.mit.edu
(en) Larry J. Stockmeyer, The Complexity of Decision Problems in Automata Theory and Logic, Massachusetts Institute of Technology, coll. « Ph.D. dissertation », (lire en ligne).