Alexei Lisitsa: Papers available by FTP

• Alexei P. Lisitsa, On the model checking complexity of circumscription, in Proceedings of Workshop on ALGORITHMS, COMPLEXITY AND COMMONSENCE REASONING'94, held in conjunction with ECAI'94, Amsterdam, August 1994.
• Alexei P. Lisitsa, On model checking complexity of circumscription, accepted to be presented at Fourth International Symposium on ARTIFICIAL INTELLIGENCE AND MATHEMATICS, January 3-5, 1996, Fort Lauderdale Marina Marriott, Florida (appeared ? in pre-proceedings)
• A. P. Lisitsa and V.Yu.Sazonov, Delta-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science (175) 1 (1997), pp. 183--222. (tcs.ps is slightly different from the published version.)
• A.Lisitsa and V.Yu.Sazonov, On linear ordering finitely-branching graphs and non-well-founded sets , DIMACS technical Report 97-05, Rutgers University, February 1997. Published also in Proc. of the 4th International Symp. "Logical Foundations of Computer Science", Springer LNCS No1234, pp. 178--188. (Abstract).
• A.Lisitsa and V.Yu.Sazonov, Bounded Hyperset Theory and Web-like Data Bases, Bounded Hyperset Theory and Web-like Data Bases. DIMACS technical Report 97-21, Rutgers University, June 1997. To appear in Proc. of Kurt G/"odel Colloquium'97 (Springer LNCS) (Abstract).