WorldCat Identities

McDermott, Drew V.

Works: 45 works in 173 publications in 5 languages and 3,353 library holdings
Genres: Conference papers and proceedings  Textbooks 
Roles: Author
Classifications: Q335, 001.535
Publication Timeline
Most widely held works about Drew V McDermott
Most widely held works by Drew V McDermott
Introduction to artificial intelligence by Eugene Charniak( Book )

36 editions published between 1984 and 1991 in 5 languages and held by 1,122 WorldCat member libraries worldwide

Artificial intelligence programming by Eugene Charniak( Book )

16 editions published between 1979 and 2014 in English and held by 604 WorldCat member libraries worldwide

Artificial intelligence research has thrived in the years since this best-selling AI classic was first published. The revision encompasses these advances by adapting its coding to Common Lisp, the well-documented language standard, and by bringing together even more useful programming tools. Today's programmers in AI will find this volume's superior coverage of programming techniques and easily applicable style anything but common
Mind and mechanism by Drew V McDermott( Book )

13 editions published in 2001 in English and held by 353 WorldCat member libraries worldwide

"In Mind and Mechanism, Drew McDermott takes a computational approach to the mind-body problem (how it is that a purely physical entity, the brain, can have experiences). He begins by demonstrating the falseness of dualist approaches, which separate the physical and mental realms. He then surveys what has been accomplished in artificial intelligence, clearly differentiating what we know how to build from what we can imagine building. McDermott then details a computational theory of consciousness - claiming that the mind can be modeled entirely in terms of computation - and deals with various possible objections. He also discusses cultural consequences of the theory, including its impact on religion and ethics."--Jacket
Assimilation of new information by a natural language-under-standing system by Drew V McDermott( Book )

8 editions published between 1973 and 1974 in English and held by 18 WorldCat member libraries worldwide

The report describes a program, called TOPLE, which uses a procedural model of the world to understand simple declarative sentences. It accepts sentences in a modified predicate calculus symbolism and uses plausible reasoning to visualize scenes, resolve ambiguous pronoun and noun phrase references, explain events, and make conditional predictions. Because it does plausible deduction, with tentative conclusions, it must contain a formalism for describing its reasons for its conclusions and what the alternatives are. When an inconsistency is detected in its world model, it uses its recorded information to resolve it, one way or another. It uses simulation techniques to make deductions about other creatures' motivation and behavior, assuming they are goal-oriented beings like itself. (Author)
The CONNIVER reference manual by Drew V McDermott( Book )

10 editions published between 1972 and 1974 in English and held by 15 WorldCat member libraries worldwide

The manual is an introduction and reference to the latest version of the Conniver programming language, an artificial intelligence language with general control and data-base structures. (Author)
Introduzione alla intelligenza artificiale by Eugene Charniak( Book )

2 editions published in 1988 in Italian and held by 15 WorldCat member libraries worldwide

Flexibility and efficiency in a computer program for design circuits by Drew V McDermott( Book )

6 editions published between 1976 and 1977 in English and held by 12 WorldCat member libraries worldwide

This report is concerned with the problem of achieving flexibility (additivity, modularity) and efficiency (performance, expertise) simultaneously in one AI program. It deals with the domain of elementary electronic circuit design. The proposed solution is to provide a deduction-driven problem solver with built-in control-structure concepts. This problem solver and its knowledge base in the application areas of design and electronics are described. The program embodying it is being used to explore the solution of some modest problems in circuit design. It is concluded that shallow reasoning about problem-solver plans is necessary for flexibility, and can be implemented with reasonable efficiency. (Author)
Why conniving is better than planning by Gerald Jay Sussman( Book )

5 editions published in 1972 in English and Undetermined and held by 10 WorldCat member libraries worldwide

Non-monotonic logic I by Drew V McDermott( Book )

7 editions published between 1978 and 1979 in English and Undetermined and held by 8 WorldCat member libraries worldwide

Non-monotonic logical systems are logics in which the introduction of new axioms can invalidate old theorems. Such logics are very important in modeling the beliefs of active processes which, acting in the presence of incomplete information, must make and subsequently revise predictions in light of new observations. The motivation and history of such logics are presented. Model and proof theories, a proof procedure, and applications for one important non-monotonic logic are developed. In particular, the completeness of the non-monotonic predicate calculus and the decidability of the non-monotonic sentential calculus are proven. Also discussed are characteristic properties of this logic and its relationship to stronger logics, logics of incomplete information, and truth maintenance systems
Special volume on planning and scheduling( Book )

4 editions published in 1995 in English and held by 7 WorldCat member libraries worldwide

Very large Planner-type data bases by Drew V McDermott( Book )

4 editions published in 1975 in English and Undetermined and held by 7 WorldCat member libraries worldwide

This paper describes the implementation of a typical data-base manager for an AI language like Planner, Conniver, or QA4, and some proposed extensions for applications involving greater quantities of data than usual. The extensions are concerned with data bases involving several active and potentially active sub-data bases, or 'contexts'. The major mechanisms discussed are the use of contexts as packets of data with free variables; and indexing data according to the contexts they appear in. The paper also defends the Planner approach to data representation against some more recent proposals. (Author)
The DUCK manual by Drew V McDermott( Book )

3 editions published in 1985 in English and held by 6 WorldCat member libraries worldwide

Duck is deductive database designed to work as an adjunct to Artificial-Intelligence application programs written in Lisp. It provides the following features: Backward chaining logic interpreter; Forward chaining; Data dependencies and reason maintenance; Integration of deduction with Lisp computation; Multiple databases; Syntax checking for deductive rules; Trace package; Interactive examination of successful and failed deductions; and Generation of quasi-English versions of rules. Additional keywords: DUCK programming language. (Author)
DARPA-sponsored planning research : report and prospectus by Drew V McDermott( Book )

3 editions published in 1987 in English and held by 5 WorldCat member libraries worldwide

Spatial inferences with ground, metric formulas on simple objects by Drew V McDermott( Book )

2 editions published in 1980 in English and held by 4 WorldCat member libraries worldwide

Temporal reasoning and default logics by S Hanks( Book )

4 editions published between 1985 and 1986 in English and held by 4 WorldCat member libraries worldwide

This document presents axioms to represent some simple concepts in temporal reasoning: events occuring at points in time, facts holding true over time, events causing facts to begin, facts causing contradictory facts to cease, and facts tending to remain true unless explicitly forced to cease. To express this last notion the authors couch the axioms in a default logic: they alternatively consider the logics of McDermott and Doyle, of Reiter, and of McCarthy. This document defines precisely (through a computer program and its formal description) the conclusions its authors intend be drawn from these axioms, given a particular temporal state of affairs. They prove, however, that these conclusions are not deductions licensed by any of the above default logics. Further analysis leads to the conclusion that these logics are inherently incapable of representing this particular kind of default reasoning. (Author)
Truth maintenance systems by David A McAllester( Book )

2 editions published between 1988 and 1998 in English and held by 4 WorldCat member libraries worldwide

A critique of pure reason by Drew V McDermott( Book )

3 editions published in 1986 in English and held by 4 WorldCat member libraries worldwide

Transformational planning of reactive behavior by Drew V McDermott( Book )

3 editions published in 1992 in English and held by 3 WorldCat member libraries worldwide

Reactive plans are plans that include steps for sensing the world and coping with the data so obtained. We investigate the application of Al planning techniques to plans of this sort in a simple simulated world. To achieve fast reaction times, we assume that the agent starts with a default reactive plan, while the planner attempts to improve it by applying plan transformations, thus searching through the space of transformed plans. When the planner has what it believes to be a better plan, it swaps the new plan into the agent's controller. The plans are written in a reactive language that allows for this kind of swapping. The language allows for concurrency, and hence, truly 'nonlinear' plans. The planner evaluates plans by projecting them, that is, generating scenarios for how execution might go. The resulting projections give estimates of plan values, but also provide clues to how the plan might be improved. These clues are unearthed by critics that go through the scenario sets, checking how the world state and the agent state evolved. The critics suggest plan transformations with associated estimates of how much they will improve the plan. Plan transformations must be able to edit code trees in such a way that the changes are orthogonal and reversible whenever possible. The system has been tested by comparing the performance of the agent with and without planning. Preliminary results allow us to conclude that the planner can be fast and directed enough to generate improved plans in a timely fashion, and that the controller can often cope with a sudden shift of plan
Quarterly Progress Report on Contract N00014-91-J-1577 (Yale University)( Book )

7 editions published between 1991 and 1993 in English and held by 1 WorldCat member library worldwide

During this period work continued along several fronts, all related to planning and perception. Prof. Drew McDermott and Michael Beetz, a graduate student, focused on transformational reactive plans, and especially the problem of inserting declarative goals into reactive plans. They were working on a paper summarizing their results, to be submitted to a conference. McDermott and Sean Engelson, a graduate student, worked on experimental testing of algorithms for map building in a mobile robot. The results are summarized in a paper submitted to the IEEE Robotics and Automation Conference. Prof. Gregory Hager implemented a first generation algorithm for computing whether two or more objects could be placed together in a confined space. The algorithm is correct and complete for a class of unstructured objects, and maintain correctness for unstructured objects. It has been tested in simulation and on contours computed from real images. The same idea is extendable to many more sensor-based decision making tacks. He also has been working on fitting and making decisions about composite objects using the same constraint-based ideas. We have also managed to parallelize the algorithm using Linda. At the same time Hager's group has implemented two visual tracking systems. The first is a feature-based tracker that follows high contrast boundaries. The second uses Michael Black's robust Horn & Schunk optic flow method to compute the motion of a small image patch
Final report for contract N00014-91-J-1577 (Yale University)( )

4 editions published in 1994 in English and held by 0 WorldCat member libraries worldwide

The object of the Yale Knowledge-Based Planning project is to find a unified theory of robot planning and sensing. We achieved several results in this direction, including the development of an architecture for a reactive planner, the implementation and testing of a theory of map making by a mobile robot, the development of an algorithm for reasoning about constraints on image hypotheses, and preliminary work on high-speed visual tracking. Our overall model of planning is this: An agent must be continuously executing plans in order to make progress on its goals. These plans are driven by sensors, and can normally cope with deviations from expected results without intervention from the planner. When intervention is required, the planner starts from scratch, generating plans and then revising them on the basis of their projected results. The projector contains a probabilistic model of the world that allows the planner to forecast probable errors. our work on sensing has focused on these areas: (1) Theoretical foundations for set-based decision-making algorithms; (2) Visual tracking and vision-based control of servo systems; and (3) Comparison of set-based and statistically-based estimation
moreShow More Titles
fewerShow Fewer Titles
Audience Level
Audience Level
  Kids General Special  
Audience level: 0.47 (from 0.07 for Mind and m ... to 1.00 for Quarterly ...)

Mind and mechanism
Alternative Names
Drew McDermott American computer scientist

Drew McDermott Amerikaans informaticus

Drew McDermott professeur d'informatique

Mac Dermott Drew V.

MacDermott Drew V.

MacDermott, Drew V. 1949-

Mc Dermott Drew V.

Mc Dermott, Drew V. 1949-

McDermott, D.

McDermott Drew

McDermott, Drew 1949-

McDermott, Drew V.

McDermott, Drew Vincent 1949-