Matthew L. Ginsberg
Matthew Ginsberg is the chief executive officer of On Time Systems, which he and David Etherington
co-founded in 1998. On Time Systems focuses on
applying optimization technology to practical problems.
Ginsberg received his doctorate in mathematics from Oxford in 1980 at the age of 24.
He remained on the faculty at Oxford until 1983, doing research in
mathematical physics and computer science. During this period, he
wrote a program that was used successfully to trade stock and stock
options on Wall Street.
Ginsberg's continuing interest in artificial intelligence brought him
to Stanford in late 1983,
where he remained for nine years before founding CIRL, which he
directed until July, 1996. Ginsberg's present interests include search,
constraint satisfaction, and
partition search. He is the author of numerous publications in
these areas, the editor of "Readings in Nonmonotonic Reasoning", and
the author of "Essentials of Artificial Intelligence", both published
by Morgan Kaufmann.
Ginsberg is also the author of
GIB, the world's first expert-level bridge-playing program.
Additional information is in Ginsberg's
- The idea here is to incorporate a variety of recent theoretical
ideas into state-of-the-art satisfiability engines, extending their
range of applicability substantially. Specific areas of interest:
- The incorporation of dynamic backtracking, also known as
relevance-bounded learning. This is a specific scheme whereby lessons
can be learned from failures in the search tree without overwhelming
- An extension from Boolean to pseudo-Boolean constraints.
Pseudo-Boolean constraints provide more efficient descriptions of certain
of axioms, such as those saying that a function has a unique value.
Pseudo-Boolean inference can also lead to exponential improvements in
efficiency when compared to its Boolean counterpart.
- Lifting ground theorem provers to deal directly with quantified
axiomatizations. Conventional wisdom is that quantification introduces
unacceptable constant factor costs into the carefully tuned performance
of modern search engines, but recent theoretical results show that the
reverse is true: Quantified systems can be substantially more efficient
than their ground versions.
- Partition search is a technique that can be used to incorporate
ideas from reason maintenance into adversary search. It has been used
to build GIB, the world's first
expert-level computer bridge player.
available on line
(Read me first)
Matthew L. Ginsberg
( ginsberg /at/ cirl.uoregon.edu )