next up previous
Next: Computer Science Education Faculty Up: Department of Computer Science Previous: Fractal Basins of Attraction

Artificial Intelligence Faculty

A.I. is concerned with computational models of the human mind and the synthesis of methods to accomplish human mental tasks. Areas of study range from subconscious mental activities to conscious ones and include image interpretation, speech recognition, language understanding, game playing, expert advice-giving, and theorem proving. Core mental activities such as knowledge representation, reasoning, learning, and planning are under intense investigation for use in robotics, intelligent information retrieval, robust and reliable diagnosis automata, and other high impact applications. An estimated 10,000 expert systems that give expert-level advice in various highly constrained areas have been developed using methods developed in the A.I. field. A.I. research has also given rise to widely used high-level programming languages for symbolic computation, such as LISP and Prolog.

Current A.I. research in our Department includes natural language understanding and dialog modeling, automated reasoning, planning, statistical models and more powerful programming languages for A.I. and other systems development. Research in neural networks and genetic algorithms is done by joint faculty in the Departments of Physics and Electrical and Computer Engineering. The group has a strong analytical focus, but has also implemented important leading-edge systems in each of the areas mentioned above. We also have experience in components of other A.I. subfields such as program synthesis, robotics, machine learning, expert systems, search analysis, and game playing.

The faculty in the A.I. group are listed below. More detailed information appears on subsequent pages.



Alan W. Biermann


PROFESSOR OF COMPUTER SCIENCE

B.E.E., The Ohio State University, 1961
M.S., The Ohio State University, 1961
Ph.D., University of California-Berkeley, 1968

Research Focus: Computational linguistics, automatic programming, learning and inference.




\psfig {figure=pictures/awb.eps,height=2.25in}



In the area of natural language processing systems, we seek to develop a class of task-oriented natural language processors that enable a human and machine to collaborate efficiently in problem solving. We emphasize the importance of fast, convenient communication with many interactions per minute using multimode input (voice, typing, and touch screen) and output (synthesized voice and video screen). Our work primarily concentrates on the development of theories of semantics appropriate for such systems with particular emphasis on mechanisms for handling complex noun-phrase resolution, focusing mechanisms, dialogue comprehension, and user models.

In order to test theories, we continuously build natural language interactive systems and study their performance in typical problem-solving situations with human subjects. This experimental work provides examples of human-machine dialogue for study and yields data related to the achieved level of efficiency.

As a second area of research, we seek theories for the extraction of meaning from natural language text. Here we study algorithms that can scan text at high speed and compile meaning structures to answer specific queries.


Selected Publications


A. W. Biermann, ``Computer science for the many,'' IEEE Computer, 27(2), February, 1994, 62-73.

R. W. Smith, D. R. Hipp, and A. W. Biermann, ``An architecture for voice dialog systems based on Prolog-style theorem proving,'' Computational Linguistics, 21, 1995.

A. W. Biermann and P. M. Long, ``The composition of messages in speech-graphics interactive systems,'' Proceedings of the 1996 International Symposium on Spoken Language Dialogue, Philadelphia, 1996.

A. W. Biermann, Great Ideas in Computer Science, Second Edition, MIT Press. 1997.

A. W. Biermann et al., More Than Screen Deep: Toward Every-Citizen Interfaces to the Nation's Information Infrastructure, National Academy Press. 1997.

A. Bagga and A. W. Biermann, ``Analyzing the Performance of Message Understanding Systems,'' Computational Linguistics and Chinese Language Processing, A3(1) February 1998, 1-26.

Y. Chai, A. W. Biermann, and C. I. Guinn, ``Two Dimensional Generalization in Information Extraction,'' Proceedings of the Sixteenth National Conference on Artificial Intelligence, Orlando Florida, July 1999, 18-22.



Michael L. Littman


ASSISTANT PROFESSOR OF COMPUTER SCIENCE

B.S. (with exceptional distinction in Computer Science), Yale University, 1988
M.S., Yale University, 1988
Ph.D., Brown University, 1996

Research Focus: Artificial intelligence, machine learning, planning under uncertainty, statistical natural language processing, algorithms and complexity, information retrieval




\psfig {figure=pictures/mlittman.eps,height=2.25in}



In a nutshell, I study ways of using probability and statistics to make computers better at solving problems. There are two primary reasons that I think probability and statistics are an important topic in artificial intelligence. First, human beings routinely reason about the likelihood of uncertain events and computer programs that can't are often brittle and unreliable. Second, people reason extremely poorly about probability and statistics, so there are many applications for creating software that can do a better job at this than humans.

My recent work examines algorithms for efficiently making optimal decisions under uncertainty in sequential domains. Potential applications of this work include robot navigation and automatic network monitoring and control. Of particular interest to me is the problem of how an autonomous system should best act to gain information; although this problem is solved in principle, its computational complexity makes it necessary to derive special-case solutions for particular instances of the problem.

I have also worked on projects in machine learning (making a machine learn from its mistakes), reinforcement learning (improving performance in sequential tasks such as games via weak feedback), statistical natural language processing (finding relationships between words via statistical analysis of texts), multilingual information retrieval (finding relationships between words in different languages), information visualization (presenting relationships between objects using 3-D graphics), user interface design/evaluation, and parallel computer languages.


Selected Publications


L. P. Kaelbling and M. L. Littman and A. W. Moore, ``Reinforcement learning: A survey,'' Journal of Artificial Intelligence Research, 4, 1996, 237-285.

E. Charniak, G. Carroll, J. Adcock, A. Cassandra, Y. Gotoh, J. Katz, M. L. Littman, and J. McCann, ``Taggers for Parsers,'' Artificial Intelligence, 85, No. 1, August 1996, 45-57.

S. Singh, T. Jaakkola, M. L. Littman, and C. Szepesvári, ``Convergence Results for Single-Step On-policy Reinforcement-Learning Algorithms,'' Machine Learning, To appear 1998.

M. L. Littman, J. Goldsmith, and M. Mundhenk, ``The computational complexity of probabilistic plan existence and evaluation,'' Journal of Artificial Intelligence Research, 9, 1998, 1-36.

L. P. Kaebling, M. L. Littman, and A. R. Cassandra, ``Planning and acting in partially observable stochastic domains,'' Artificial Intelligence, 101(1), 1998, 99-134.



Donald W. Loveland


PROFESSOR OF COMPUTER SCIENCE

A.B., Oberlin College, 1956
S.M., Massachusetts Institute of Technology, 1958
Ph.D., New York University, 1964

Research Focus: Automated theorem proving, logic programming, knowledge evaluation, expert systems, test-and-treatment problem.




\psfig {figure=pictures/dwl.eps,height=2.25in}



In the area of automated theorem proving we are interested in the use of computers to discover the truth of proposed theorems. Although standard areas of mathematics are of special interest, proving theorems in any theory that can be formally defined is also of great interest. Currently, we are studying the Model Elimination procedure, a proof procedure for first-order logic that uses the implementation techniques of the logic programming language Prolog. The implementation is impressively fast but computes much redundant information. We seek to reduce this redundancy and add an automated lemma capability.

We have recently explored an extension to Prolog that permits an honest negation but offers much of the computational speed of Prolog potentially. The extension appears to be particularly effective when the input is nearly in Horn clause form, the latter being the format for Prolog.

We have also had an interest in the problem of updating knowledge bases where the new information being added may well interact with the existing information. Subtle interactions can occur because many facts or conjectures are inferred and not explicit in the knowledge base. This is part of our general interest in expert systems.

We have studied algorithms for determining near-optimal test procedures and test-and-treatment procedures. Algorithms for optimal results are too computationally expensive, so approximate algorithms are sought.


Selected Publications


D. W. Loveland, Automated theorem proving: A logical basis, North-Holland, Amsterdam, 1978.

D. W. Loveland, ``Performance bounds for binary testing with arbitrary weights,'' Acta Informatica, 22, 1985, 101-114.

D. W. Loveland, ``Near-Horn Prolog and beyond,'' Journal of Automated Reasoning, 7(1), 1991, 1-26.

D. W. Reed and D. W. Loveland, ``Near-Horn Prolog and the ancestry family of procedures,'' Annals of Mathematics and Artificial Intelligence, 14, 1995, 225-249.

D. W. Loveland, D. W. Reed, and D. S. Wilson, ``SATCHMORE: SATCHMO with RElevancy,'' Journal of Automated Reasoning, 14(2), 1995, 325-351.

O. L. Astrachan and D. W. Loveland, ``The use of lemmas in the Model Elimination procedure,'' Journal of Automated Reasoning, 19(1), 1997, 117-141.



Richard G. Palmer


PROFESSOR OF PHYSICS AND OF COMPUTER SCIENCE

B.A., Cambridge University, 1970
Ph.D., Cambridge University, 1973

Research Focus: Theory and modeling of complex systems including glasses, neural networks, genetic algorithms, and economic markets.






\psfig {figure=pictures/palmer.eps,height=2.25in}



My research revolves around various types of complex systems and complex adaptive systems, using methods of statistical mechanics, stochastic processes, dynamical systems theory, graph theory, and computer simulation.

From my perspective, complex systems are systems with significant internal structure and memory, so that the external conditions do not adequately specify the internal state; this is natural in computer science but not (until recently) in statistical physics. My main interest under this heading concerns glasses, where I construct general models of highly constrained dynamical systems. The mathematical and computational problems chiefly concern diffusion on large random graphs and eigenanalysis of large random matrices.

Complex adaptive systems are complex systems that learn or adapt to their environment. I'm particularly interested in neural networks and genetic algorithms, and am currently working on a theory of genetic algorithms (and coevolution in general) based on statistical mechanics. I also apply learning algorithms to interacting-agent simulations of economic markets. More generally, I'm trying to construct mathematical theories of interacting- agent systems.


Selected Publications


R. G. Palmer, ``Broken ergodicity,'' Advances in Physics, 31, 1982, 669-735.

J. J. Hopfield, D. I. Feinstein, and R. G. Palmer, ``Unlearning has a stabilizing effect in collective memories,'' Nature, 304, 1983, 158-159.

R. G. Palmer, ``Statistical mechanics approaches to complex optimization problems,'' in The Economy as an Evolving Complex System, Addison-Wesley, Reading, 1988.

J. A. Hertz, A. S. Krogh, and R. G. Palmer, Introduction to the Theory of Neural Computation, Addison-Wesley, Redwood City, 1991.

R. G. Palmer, W. B. Arthur, J. H. Holland, B. LeBaron, and P. J. Tayler, ``Artificial economic life in a stockmarket model,'' Physica D, 75, 1994, 264-274.

W. B. Arthur, J. H. Holland, B. LeBaron, R. G. Palmer, and P. J. Tayler, ``Asset pricing under eindogenous expectations in an artificial stock market,'' The Economy As An Evolving Complex System II, Addison-Wesley, Redwood City, 1997.


next up previous
Next: Computer Science Education Faculty Up: Department of Computer Science Previous: Fractal Basins of Attraction
Diane M. Riggs
5/24/1999