1. The Design and Analysis of Computer Algorithms;Aho,1974
2. Satisfiability, branch-width and Tseitin tautologies;Alekhnovich,2002
3. (de)Composition of situation calculus theories;Amir,2000
4. E. Amir, Dividing and conquering logic, Ph.D. Thesis, Department of Computer Science, Stanford University, 2001.
5. E. Amir, Efficient approximation for triangulation of minimum treewidth, in: Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers Inc., 2001, pp. 7–15.