WorldCat Identities

Ginsberg, Matthew L. 1955-

Overview
Works: 15 works in 28 publications in 1 language and 706 library holdings
Genres: Conference proceedings  Textbooks 
Classifications: Q335, 006.3
Publication Timeline
Key
Publications about  Matthew L Ginsberg Publications about Matthew L Ginsberg
Publications by  Matthew L Ginsberg Publications by Matthew L Ginsberg
Most widely held works by Matthew L Ginsberg
Essentials of artificial intelligence by Matthew L Ginsberg ( Book )
6 editions published in 1993 in English and held by 449 WorldCat member libraries worldwide
Since its publication, Essentials of Artificial Intelligence has been adopted at numerous universities and colleges offering introductory AI courses at the graduate and undergraduate levels. Based on the author's course at Stanford University, the book is an integrated, cohesive introduction to the field. The author has a fresh, entertaining writing style that combines clear presentations with humor and AI anecdotes. At the same time, as an active AI researcher, he presents the material authoritatively and with insight that reflects a contemporary, first hand understanding of the field. Pedagogically designed, this book offers a range of exercises and examples
Readings in nonmonotonic reasoning ( Book )
6 editions published in 1987 in English and held by 236 WorldCat member libraries worldwide
Counterfactuals by Matthew L Ginsberg ( Book )
2 editions published in 1984 in English and held by 6 WorldCat member libraries worldwide
Counterfactuals are a form of commonsense non-monotonic inference that has been of long-term interest to philosophers. This paper begins by describing some of the impact counterfactuals can be expected to have in artificial intelligence, and by reviewing briefly some of the philosophical conclusions which have been drawn about them. Philosophers have noted that the content of any particular counterfactual is in part context-dependent; we present a formal description of counterfactuals that allows us to encode this context-dependent information clearly in the choice of a sublanguage of the logical language in which we are working. Having made this choice, we show that our description of counterfactuals is formally identical to the accepted possible worlds interpretation due to David Lewis. Finally, we examine the application of our ideas in the domain of automated diagnosis of hardware faults. Additional keywords: operators(mathematics); mathematical logic; semantics; artificial intelligence. (Author)
Plan debugging using approximate domain theories by Matthew L Ginsberg ( Book )
1 edition published in 1995 in English and held by 2 WorldCat member libraries worldwide
Artificial intelligence applications in hardware disgnosis by Matthew L Ginsberg ( Book )
1 edition published in 1988 in English and held by 2 WorldCat member libraries worldwide
Logic programming by Michael R Genesereth ( Book )
2 editions published in 1985 in English and held by 2 WorldCat member libraries worldwide
Non-monotonic reasoning using Dempster's rule by Matthew L Ginsberg ( Book )
1 edition published in 1985 in English and held by 1 WorldCat member library worldwide
Dynamic backtracking by Matthew L Ginsberg ( Book )
1 edition published in 1997 in English and held by 1 WorldCat member library worldwide
The goal of this project was to turn the intuitions behind dynamic backtracking into a series of formally verified algorithms, implement the algorithms, and test the results on realistic problems. These goals have been met and exceeded. Dynamic backtracking has been generalized to partial-order dynamic backtracking, and has been formalized, tested on academic benchmarks, and applied (by one of CTRL's industrial partners) to real industrial scheduling problems. Of equal importance, the search for novel search algorithms for scheduling problems has led beyond dynamic backtracking to include new techniques, such as limited discrepancy search and doubleback optimization, that are currently the best known techniques for benchmark scheduling problems of realistic size and character
Multivalued Logics by Matthew L Ginsberg ( Book )
1 edition published in 1988 in English and held by 1 WorldCat member library worldwide
Decision procedures by Matthew L Ginsberg ( Book )
1 edition published in 1985 in English and held by 1 WorldCat member library worldwide
Distributed artificial intelligence is the study of how a group of individual intelligent agents can combine to solve a difficult global problem; the usual approach is to split the original problem into simpler ones and to attack each to these independently. This paper discusses in very general terms the problems which arise if the subproblems are not independent, but instead interrelate in some way. We are led to a single assumption, which we call common rationality, that is provably optimal (in a formal sense) and which enables us to characterize precisely the communication needs of the participants in multi-agent interactions. An example of a distributed computation using these ideas is presented
Controlling recursive inference by David F Smith ( Book )
1 edition published in 1985 in English and held by 1 WorldCat member library worldwide
Loosely speaking, recursive inference is when an inference procedure generates an infinite sequence of similar subgoals. In general the control of recursive inference involves demonstrating that recursive portions of a search space will not contribute any new answers to the problem beyond a certain level. We first review a well known syntactic method for controlling repeating inference (inference where the conjuncts processed are instances of the ancestors), provide a proof that it is correct, and discuss the conditions under which the strategy is optimal. We also derive more powerful pruning theorems for cases involving transitivity axioms and cases involving subsumed subgoals. The treatment of repeating inference is followed by consideration of the more difficult problem of recursive inference that does not repeat. Here we show how knowledge of the properties of the relations involved and knowledge about the contents of the system's database can be used to prove that portions of a search space will not contribute any new answers
Solving the Prisoner's dilemma by Michael R Genesereth ( Book )
2 editions published in 1984 in English and held by 1 WorldCat member library worldwide
A framework is proposed for analyzing various types of rational interaction. We consider a variety of restrictions on participants' moves; each leads to a different characterization of rational behavior. Under an assumption of common rationality, it is proven that participants will cooperate, rather than defect, in the Prisoner's Dilemma. We will follow the usual convention of representing a game as a payoff matrix. This is a unified framework for considering various types of interactions that occur without communication. Using assumptions about what types of moves other agents will make, a participant is able to reason about what constitutes rational behavior on its own part. Several of the characterizations of rationality have parallels in existing game theory literature, and lead to familiar results such as case analysis and iterated case analysis
Analysing incomplete information by Matthew L Ginsberg ( Book )
1 edition published in 1984 in English and held by 1 WorldCat member library worldwide
A circumscriptive theorem prover by Matthew L Ginsberg ( Book )
1 edition published in 1987 in English and held by 1 WorldCat member library worldwide
Does probability have a place in non-monotonic reasoning? by Matthew L Ginsberg ( Book )
1 edition published in 1985 in English and held by 1 WorldCat member library worldwide
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.69 (from 0.00 for Dynamic ba ... to 0.84 for Decision p ...)
Alternative Names
Ginsberg, Matt, 1955-
Languages
English (28)
Covers