KENNETH McALOON Department of Computer and Information Science Brooklyn College CUNY Brooklyn NY 11210 TEL: 718-951-5521 FAX: 718-951-4842 E-mail: mcaloon@sci.brooklyn.cuny.edu

1994 - Broeklundian Professor, Brooklyn College CUNY 1980 - Professor, Department of Computer and Information Science, Brooklyn College CUNY, Chairman 1983-84 Ph.D. Programs in Computer Science, Mathematics and Philosophy, CUNY Graduate Center 1986-87 Visiting scientist, IBM T.J. Watson Research Center, AI Languages 1969-80 Research professor, Department of Mathematics and Computer Science, University of Paris VII and the Centre National de la Recherche Scientifique 1980 Visiting professor, University of Bruxelles, Department of Mathematics and Computer Science 1976 Visiting professor, Rockefeller University, Logic Group 1967-69 Instructor, Princeton University, Department of Mathematics

Fordham University B.A. Summa Cum Laude 1962 NSF Fellowship Woodrow Wilson Fellowship University of California at Berkeley Ph.D. Mathematics 1966 NATO Post-Doctoral Fellowship

Award from the Department of Energy for innovation in computational science education, September, 1994

Editor: Journal of Logic Programming, Methods of Logic in Computer Science Associate Editor: Annals of Mathematics and Artificial Intelligence Special Edition on Functional Methods ACCLAIM Workshop, Pisa 1995 Program Committee for the First International Conference on Principles and Practice of Constraint Programming, 1995 Talk at the Ecole Nationale Superieure, Paris, May 1995 Talk at Laguardia Community College, June 1995 Tutorial on Optimization and Constraint Programming at CSTS in Dallas, 1996.

Computer Science Tools for Computationally Demanding Applications, $2,000,000, Department of Defense, 6/96-6/01. Disjunctive Goal Programming, $3,519, PSC-CUNY grant, 7/95-12/96. Logic and Optimization, $3,481, PSC-CUNY grant, 7/94-12/95. Constraint Methods and Inference Engines for Expert Systems(with C. Tretkoff) $22,884,NSF, US-Korea Cooperative Research, 9/94-8/96. Logic and Optimization, (with C. Tretkoff), $303,203, Office of Naval Research, 10/93-9/96. Teaching Tools for Decision Support Software, (with C. Tretkoff) $22,500, CUNY, Campus Partnership Program, 1/93-6/93. Highly Parallel Constraint Logic Programming for AI and MIP Applications, (with C. Tretkoff) $134,000, NSF, Division of Numeric and Symbolic Compu- tation, 7/92-6/94. Highly Parallel Constraint Logic Programming for AI and MIP Applications, (with C. Tretkoff) $2,743, FRAP, 7/92-6/93. Parallel Subrecursive Constraint Logic Programming, (with C. Tretkoff) $3,000 FRAP, 7/91-6/92. Constraints, Logic Programming and Rule-Based Systems, (with C. Tretkoff) $180,000, NSF, Division of Informtion, Intelligent Systems and Robotics, 7/89-6/91. Constraints, Logic Programming and Rule-Based Systems, (with C. Tretkoff) $10,000, FRAP, 7/89-6/90. Applied Constraint Logic Programming, $17,000, (with C. Tretkoff) US-Japan Collaborative Research, 4/89-6/92 Logic, Computational Complexity and Rule-Based Systems, $150,000, NSF, Division of Computer and Computation Research, 7/87-6/90.

Optimization and Computational Logic, with C. Tretkoff, J. Wiley and Sons, in production Model Theory and Arithmetic, editor with C. Berline and J. P. Ressayre, Springer Lecture Notes in Mathematics 890 (1981) 306 pp. Logic Colloquium `78, editor with M. Boffa and D. van Dalen, North-Holland (1979) 434 pp. Théorie des ensembles: Séminaire GMS, editor with S. Grigorieff and J. Stern Publications de l'U.E.R. de Mathémattique et Informatique de l'Universit mattique et Informatique de l'Université Paris VII (1979) 228 pp. Calculo, Publicaciones Cultural S. A., Mexico, Spanish language edition of Calculus (1976) 874 pp. Calculo de Una Variable, Publicaciones Cultural S. A., Mexico, Spanish language edition of Calculus of One Variable (1975) 576 pp. Calculus, with A. Tromba, Harcourt Brace Javonovich (1972) 879 pp. Calculus of One Variable, with A. Tromba, Harcourt Brace Javonovich (1972) 492 pp.

Séminaire GMS: Théorie Descriptive des Ensembles 1976-77, editor with S. Grigorieff and J. Stern, U.E.R. de Mathématique et Informatique, Unverité Paris VII (1978). Séminaire GMS: Théorie Descriptive des Ensembles 1975-76, editor with S. Grigorieff and J. Stern, U.E.R. de Mathématique et Informatique, Université Paris VII (1976). Séminaire GMS: Théorie Descriptive des Ensembles 1974-75, editor with S. Grigorieff and J. Stern, U.E.R. de Mathématique et Informatique, Université Paris VII (1975).

2LP: Linear programming and logic programming (with C. Tretkoff), Principles and Practice of Constraint Programming, edited by P. van Hentenryck and V. Saraswat, MIT Press, 1995, pp 99-114.. Parallel integer goal programming(with D. Arnow and C. Tretkoff), Proceedings of the 1995 ACM Computer Science conference, February, 1995, pp 42-47 Parallel integer goal programming (with David Arnow and Carol Tretkoff), Proceedings of the Workshop on Parallelism, International Conference on Logic Programming, November, 1994. Disjunctive programming and distributed programming, (with D. Arnow and C. Tretkoff), Sixth IASTED-ISMM Conference on Parallel and Distributed Computing and Systems, Washington DC, October, 1994. Simplification and elimination of redundant linear arithmetic constraints (with J.L. Lassez, and T. Huynh), Constraint Logic Programming:, edited by F. Benhamou and A. Colmerauer, MIT Press, 1993, pp 73-88. Decision procedures for constraint based extensions of Datalog,(with J. Cox). Constraint Logic Programming, edited by F. Benhamou and A. Colmerauer, MIT Press. 1993, pp 17-32. A constraint sequent calculus,(with J.-L. Lassez). Constraint Logic Programm- ing, edited by F. Benhamou and A. Colmerauer, MIT Press. 1993, pp 33-44. 2LP: a highly parallel constraint logic programming language, (with C. Atay and C. Tretkoff), Sixth SIAM Confer- ence on Parallel Processing for Scientific Computation, March 1993. Parallelism in 2LP (with C. Atay and C. Tretkoff). Proceedings of the ICLP Workshop on Constraint Logic Program- ming, November 1992. Constraint solving in CLP languages (with Geun-Sik Jo). Proceedings of the 2nd Pacific Rim International Confer- ence on Artificial Intelligence, September1992, pp 758-763. Computational complexity and constraint logic programming (with J. Cox and C. Tretkoff), Annals of Mathematics and Artificial Intelligence, 5 (1992) 163-190. Constraint logic programming for AI and MIP applications (with C. Tretkoff), Proceedings of the NACLP 1991 Workshop on Expert Systems, AI and Software Engineering Applications. Subrecursive constraint logic programming (with C. Tretkoff), Proceedings of the 1990 NACLP Workshop on Logic Programming Architectures and Implementations, J. Mills editor, pp 36-43. Computational complexity and constraint logic programming, Extended Abstract (with J. Cox and C. Tretkoff), Pro- ceedings of the 1990 North American Conference on Logic Programming, MIT Press (1990) 401-415. A canonical form for generalized linear constraints (with J.-L. Lassez), Journal of Symbolic Computation, 13 (1992) pp 1-24 Constraint Sequent Calculus (with J.-L. Lassez), Proceedings of Logic in Computer Science 90, Philadelphia, pp 51- 61. Simplifications and elimination of redundant linear arithmetic constraints (with T. Huynh and J.L. Lassez), Proceed- ings of the 1989 North American Conference on Logic Programming, L. Sterling editor, MIT Press. Stratification and knowledge-base management (with C. Lassez and G. Port), Journal of Symbolic Computation, Vol. 7, No. 5, May 1989, pp 509-522. Independence of negative constraints (with J.L. Lassez), Proceedings of the Advanced Seminar on Foundations of Innovative Software Development, TAPSOFT 89, Lecture Notes in Computer Science 351, Springer-Verlag, pp 19- 27. Hierarchy and separation results for MIXED-TIME, Logic and Computation, W. Sieg, editor, Contemporary Mathe- matics 106, pp. 213-220. Applications of a canonical form for generalized linear constraints (with J. L. Lassez), Proceedings of the 1988 Inter- national Conference on Fifth Generation Computing Systems, Tokyo 1988 Efficient parallel algorithms for antiunification and relative complement (with G. Kuper, K. Palem and K. Perry), Proceeedings of Logic in Computer Science 88, Edinborough. Constraint logic programming and options trading, (with C. Lassez and R. Yap), IEEE Expert, Fall 1987, pp 41-50 . The complexity of logic programming with sets, (with G. Kuper, K. Palem,K. Perry), IBM Technical Report RC 12887. Stratification as a tool in interactive knowledge base management, (with C. Lassez and G. Port), extended abstract, Proceedings of the 1987 International Conference on Logic Programming, MIT Press, pp 136-151. Stratified interactive knowledge bases (with C. Lassez), in Proceedings of the 1987 International Symposium on Methodologies for Intelligent Systems, ed. Z. Ras and M. Zemankova, North-Holland 1987, pp. 408-415. Gödel incompleteness and finite combinatorics, (with A. Kanamori), Annals of Pure and Applied Logic 33 (1987) 23- 41. Separation results for bounded alternation, in Structure in Complexity Theory, Springer Lecture Notes in Computer Science 223, pp 265-272, ed. A. Selman, Springer Verlag 1986. Models of arithmetic and complexity theory, in Studies in Complexity Theory, pp 119-221, ed. R. Book, Pitman and John Wiley 1986. Paris-Harrington incompleteness and transfinite progressions of theories, in Proceedings of Symposia in Pure Mathe- matics 42, American Mathematical Society (1985) 447-460. Petri nets and large finite sets, Journal of Theoretical Computer Science 32 (1984) 173-183 Two further combinatorial statements equivalent to the 1-consistency of Peano arithmetic, (with P. Clote), Journal of Symbolic Logic 48 (1983) 1090-1104 Reducibilities among decision problems for HNN groups, vector addition systems and subsystems of Peano arith- metic, (with M. Anshel), Proceedings of the American Mathematical Society 89 (1983) 423-429. A finite combinatorial statement equivalent to the 1-consistency of predicative analysis, (with H. Friedman and S. Simpson), in Patras Logikon Symposion, editor G. Metiakides, North-Holland (1982) 197-230. Modèles récursivement saturés de l'addition et de la multiplication des entiers naturels, (with P. Cegielski and G. Wilmers), in Logic Colloquium `80, editor D. Van Dalen, North-Holland (1982) 23-31. On the complexity of models of arithmetic, Journal of Symbolic Logic 47 (1982) 403-415. Indicators, recursive saturation and expandability, with L.A.S. Kirby and R. Murawski, Fundamenta Mathematicae LXIV (1981) 127-139. Les méthods de Kirby-Paris et la théorie des ensembles, (with J. P. Ressayre), in Model Theory and Arithmetic, Springer Lecture Notes in Mathematics 890 (1981). Récursivité et effectivité, (with J. P. Ressayre), Encyclopédie Universalis, Gauthiers-Villars (1981). Les rapports entre la méthode des indicatrices et la méthode de Gödel pour obtenir des résultats d'indépendence, Modèles de l'Arithmétique, Astérisque 73, Société Mathématique de France (1980) 31-39. Progressions transfinies de théories axiomatiques, formes combinatoires du théorème d'incomplétude et fonctions récursives à croissance rapide, Modèles de l'Arithmétique, Astérisque No. 73, Société Mathématique de France (1980) 41-58. Les théorèmes de Martin et Harrington - applications et remarques, Théorie des Ensembles: Séminaire GMS, Publica- tions de l'U.E.R. de Mathématique et d'Informatique de l'Université Paris VII (1979) 253-277 Completeness theorems, incompleteness theorems and models of arithmetic, Transactions of the American Mathe- matical Society 239 (1978) 253-277. A combinatorial characterization of inaccessible cardinals, Higher Set Theory, editor Dana Scott, Springer Lecture Notes in Mathematics 669 (1978) 385-390. Diagonal methods and strong cuts in models of arithmetic, Logic Colloquium `77, North Holland (1978) 171-181. Formes combinatoires du théorème d'incomplétude, Séminaire Bourbaki 77-78, Springer Lecture Notes in Mathe- matics 710 (1978) 1-14. Consistency statements and number theories, Colloque International de Logique, Colloques C.N.R.S. No. 249 (1977) 199-207. Formules de Rosser pour ZF, Comptes Rendus de l'Académie des Sciences (1976) . Applications alternées de théorèmes de complétude et d'incomplétude, Comptes Rendus de l'Académie des Sciences (1975) 669-672. On the sequence of models HODn, Fundamenta Mathematicae LVII (1974) 85-93. Forcing and generalized quantifiers, (with J. L. Krivine), Annals of Mathematical Logic (1973) 1-95. Some true unprovable formulas for set theory, with J. L Krivine, Proceedings of the Bertrand Russell Memorial Logic Conference, Uldum (1973) 332-341. Consistency results about ordinal definability, Annals of Mathematical Logic (1971) 449-467. Work of mine on the Measure Problem and the Continuum Hypothesis is integrated into the following paper of R. M. Solovay: A model of set theory in which all sets are Lebesgue measurable, Annals of Mathematics (1970) 1-56. Les algèbres rigides et minimales, Comptes Rendus de l'Académie des Sciences (1970). Some applications of Cohen's Method, Thesis, Department of Mathematics, University of California at Berkeley (1966). KENNETH McALOON Department of Computer and Information Science Brooklyn College CUNY Brooklyn NY 11210 TEL: 718-951-5521 FAX: 914-738-5404 E-mail: mcaloon@sci.brooklyn.cuny.edu Recent Teaching Graduate Mathematics Linear and Integer Programming Mathematical Logic Computational Complexity Graduate Computer Science Artificial Intelligence Expert Systems Constraint Logic Programming Undergraduate Computer Science Programming Languages Theory of Computability C, C++, LISP, Prolog