Artificial intelligence and mathematical theory of computation : papers in honor of John McCarthy
Author(s)
Bibliographic Information
Artificial intelligence and mathematical theory of computation : papers in honor of John McCarthy
Academic Press, c1991
Available at 24 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
C||Artificial-691069030
Note
Includes bibliographical references and index
Description and Table of Contents
Description
A book intended for researchers in computer science, in particular, artificial intelligence, theoretical computing, and programming languages. This volume honours John Mccarthy for his fundamental contributions to the field of computer science. The papers, written by leading computer science researchers, range from historical overviews to technical reports on the key areas of computer science in which McCarthy has worked - LSP, programming languages, symbolic computation, mathematical theory of computation, and artificial intelligence.
Table of Contents
- A short sketch of the life and career of John McCarthy, D. Israel
- functional instantiation in first order logic, R. Boyer et al
- lambada - the ultimate combinator, R. Cartwright
- termination proofs and the "91" function, S. Feferman
- robots with common sense?, J. Feldman
- ascribing artificial intelligence to (simpler) machines, or when AI meets the world, R. Filman
- the design of parallel programming languages, R. Gabriel
- metaprogramming at work in automated manufacturing, C. Goad
- LISP + calculus = identities, W. Gosper
- model checking vs theorem proving - a manifesto, J. Halpern and M. Vardi
- algebraic computation - the quiet revolution, A. Hearn
- lisp and parallelism, T. Ito
- an application of amalgamated logic to multi-agent belief, J. Kim and R. Kowalski
- text-book examples of recursion, D. Knuth
- belief and introspection, H. Levesque
- monotonicity properties in automated deduction, Z. Manna, et al
- circumscription and disjunctive logic programming, J. Minkler, et al
- on the equivalence of data representations, J. Mitchell
- caution! robot vehicle!, H. Moravec
- circumscription and authority, P. Rathman and G. Wiederhold
- the frame problem in the situation calculus - a simple solution to the frame problem (sometimes) and a completeness result for goal regression, R. Reiter
- abstraction mechanism for symbolic expressions, M. Sato
- varieties of context, Y. Shoham
- the inventor and his object - the programming language LISP, H. Stoyan
- binding structures - abstract syntax generalized to binding and binding contexts, C. Talcott
- logicism in AI and common sense in philosophy - John McCarthy's programme in philosophical perspective, R. Thomason
- the incorrectness of the bisection algorithm, R. Weyhrauch.
by "Nielsen BookData"