• Publications
  • Influence
Limited Discrepancy Search
TLDR
This paper develops a search procedure that is more likely to find a solution in any given time limit than existing methods such as chronological backtracking and iterative sampling and shows formally and experimentally that limited discrepancy search can be expected to outperform existing approaches. Expand
Symmetry-Breaking Predicates for Search Problems
TLDR
This work presents a general scheme whereby symmetries are exploited by adding \symmetry-breaking" predicates to the theory, and discusses methods for generating partial symmetry-breaking predicates, and shows that in several speciic cases asymmetries can be broken either fully or partially using a polynomial number of predicates. Expand
Dynamic Backtracking
  • M. Ginsberg
  • Computer Science
  • J. Artif. Intell. Res.
  • 31 July 1993
TLDR
The technique developed is a variant of dependency-directed backtracking that uses only polynomial space while still providing useful control information and retaining the completeness guarantees provided by earlier approaches. Expand
Multivalued logics: a uniform approach to reasoning in artificial intelligence
  • M. Ginsberg
  • Mathematics, Computer Science
  • Comput. Intell.
  • 1 September 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,Expand
GIB: Imperfect Information in a Computationally Challenging Game
  • M. Ginsberg
  • Computer Science
  • J. Artif. Intell. Res.
  • 3 June 2011
TLDR
GIB, the program being described, involves five separate technical advances: partition search, the practical application of Monte Carlo techniques to realistic problems, a focus on achievable sets to solve problems inherent in the Monte Carlo approach, an extension of alpha-beta pruning from total orders to arbitrary distributive lattices, and the use of squeaky wheel optimization to find approximately optimal solutions to cardplay problems. Expand
GIB: Steps Toward an Expert-Level Bridge-Playing Program
TLDR
GIB, the first bridge-playing program to approach the level of a human expert, is described and the results of experiments comparing GIB to both human opponents and other programs are presented. Expand
Reasoning About Action I: A Possible Worlds Approach
TLDR
This paper provides a solution to the frame problem, and to the related problem that it is not always reasonable to explicitly specify all of the consequences of actions, by keeping a single model of the world that is updated when actions are performed. Expand
Inference methods for a pseudo-boolean satisfiability solver
TLDR
Experimental results showing that the pseudo-Boolean version of RELSAT outperforms its clausal counterpart on problems from the planning domain. Expand
Readings in Nonmonotonic Reasoning
Cooperation without Communication
TLDR
The definition and analysis of basic rationality is defined; various assumptions about independence are considered; and the advantages of extending the definition of rationality from individual actions to decision procedures are demonstrated. Expand
...
1
2
3
4
5
...