#### Filter Results:

- Full text PDF available (77)

#### Publication Year

1984

2015

- This year (0)
- Last 5 years (2)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- William D. Harvey, Matthew L. Ginsberg
- IJCAI
- 1995

Many problems of practical interest can be solved using tree search methods because carefully tuned successor ordering heuristics guide the search toward regions of the space that are likely to contain solutions. For some problems, the heuristics often lead directly to a solution— but not always. Limited discrepancy search addresses the problem of what to… (More)

- Matthew L. Ginsberg
- Computational Intelligence
- 1988

This paper describes a uniform formalization of much of the current work in artificial intelligence on inference systems. We show that many of these systems, including first-order theorem provers, assumption-based truth maintenance systems (ATMSS), and unimplemented formal systems such as default logic or circumscription, can be subsumed under a single… (More)

Many reasoning and optimization problems exhibit symmetries. Previous work has shown how special purpose algorithms can make use of these symmetries to simplify reasoning. We present a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory. Our approach can be used on any propo-sitional satissability problem,… (More)

- Matthew L. Ginsberg
- J. Artif. Intell. Res.
- 1993

Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of… (More)

- Matthew L. Ginsberg
- J. Artif. Intell. Res.
- 2001

This paper investigates the problems arising in the construction of a program to play the game of contract bridge. These problems include both the difficulty of solving the game’s perfect information variant, and techniques needed to address the fact that bridge is not, in fact, a perfect information game. Gib, the program being described, involves five… (More)

- Matthew L. Ginsberg
- IJCAI
- 1999

This paper describes GIB, the first bridgeplaying program to approach the level of a human expert. ( G I B finished twelf th in a handpicked field of thir ty-four experts at an invitat ional event at the 1998 Wor ld Bridge Championships.) We give a basic overview of the algorithms used, describe their strengths and weaknesses, and present the results of… (More)

- Matthew L. Ginsberg, David E. Smith
- Artif. Intell.
- 1988

Reasoning about change is an important aspect of commonsense reasoning and planning. In this paper we describe an approach to reasoning about change for rich domains where it is not possible to anticipate all situations that might occur. The approach provides a solution to the frame problem, and to the related problem that it is not always reasonable to… (More)

- Karmarkar, Richard M. Karp, +6 authors Matthew L. Ginsberg
- 1996

Limited discrepancy search is an eeective algorithm for problems where only part of a tree has to be searched to nd a solution, or the problem size prohibits an exhaustive search. We presented an improved version of the algorithm that reduces its time complexity from O(d+2 2 2 d) to O(2 d) for searching a complete binary tree of uniform depth d. In… (More)

- Matthew L. Ginsberg
- IJCAI
- 1985

Counterfactuals arc a form of commonsense non-monotonic inference that has been of long-term interest to philosophers. In this paper, we begin by describing some of the impact counterfactuals can be exported to have in artif icial intelligence, and by reviewing briefly some of the philosophical conclusions which have been drawn about them. Philosophers have… (More)

- Matthew L. Ginsberg, David A. McAllester
- PPCP
- 1994

There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as GSAT; the other contoi-~ systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new technique that combines these two approaches. The algorithm… (More)