Thomas Ellman

AIJ Journal 2005 Journal Article

Introduction to the Special Volume on Reformulation

• Thomas Ellman
• Fausto Giunchiglia

LOPSTR Conference 2003 Conference Paper

Specification and Synthesis of Hybrid Automata for Physics-Based Animation

• Thomas Ellman

Abstract Physics-based animation programs are useful in a variety of contexts, including science, engineering, education and entertainment. For example, in science, they are used to investigate the behavior of dynamical systems. In engineering, they are used to help design vehicles, machinery and other mechanical devices. In education, they are used to teach basic principles of physics. In entertainment, they are used in games involving cars, planes, spaceships and other moving objects. Such programs are usually constructed by hand, in conventional programming languages, such as C++, possibly augmented with a physics-based animation toolkit. Unfortunately, manual construction of physics-based animation programs is expensive, time-consuming and highly prone to error.

IJCAI Conference 1993 Conference Paper

Abstraction via Approximate Symmetry

• Thomas Ellman

AAAI Conference 1993 Conference Paper

Intelligent Model Selection for Hillclimbing Search in Computer-Aided Design

• Thomas Ellman

ICML Conference 1993 Conference Paper

Synthesis of Abstraction Hierarchies for Constraint Satisfaction by Clustering Approximately Equivalent Objects

• Thomas Ellman

AAAI Conference 1988 Conference Paper

Approximate Theory Formation: An Explanation-Based Approach

• Thomas Ellman

IJCAI Conference 1985 Conference Paper

Generalizing Logic Circuit Designs by Analyzing Proofs of Correctness

• Thomas Ellman

This paper presents a method of learning to solve design problems by generalizing examples. The technique has been developed in the domain of logic circuit design. It involves the use of domain knowledge to analyze examples and produce generalized circuit designs. The method utilizes proofs of design correctness to guide the process of generalization. Our approach is illustrated by showing it can generalize a rotational shift register into a schema describing devices capable of computing arbitrary permutations.