Algebraic pairs of isometries (2009)
Agler, Jim, McCarthy, John, Knese, Greg
We consider pairs of commuting isometries that are annihilated by a polynomial. We show that the polynomial must be inner toral, which is a geometric condition on its zero set. We show that cyclic...
What Hilbert spaces can tell us about bounded functions on the bidisk (2009)
We discuss various theorems about bounded analytic functions on the bidisk that were proved using operator theory.
Twins of different color (2008)
Will Fitzgerald, Will Fitzgerald, John Mccarthy, Marvin Minsky, Nathaniel Rochester, Claude Shannon
their beginnings in the mid-1950s, with no discernable interaction. The early AI researchers pursued a research programme that has led to a strong emphasis on rational action and cognition. As a...
TURING AWARD LECTURE GENERALITY IN ARTIFICIAL INTELLIGENCE (2008)
ity in Artificial Intelligence. ” The topic turned out to approach to AI, lack of generality shows up in that the have been overambitious in that I discovered I was axioms we devise to express...
Associate Investigators (2008)
John Mccarthy, Zohar Manna, Ian Mason, Amir Pnueli, Carolyn Talcott, Richard Waldinger
sections of text summarizing the results for the two subtasks respectively. 1 Open Architectures for Formal Reasoning The objective of this project is to develop an open architecture for formal...
1 –Day Workshop proposal: Space, Place and Experience in Human-Computer Interaction (2008)
Peter Wright, John Mccarthy, Mark Blythe, Richard Coyne, Kirsten Boehner
The Internet, ubiquitous, mobile, pervasive and wireless computing have led to a vision of a technological future that can be characterised as anytime, anywhere computing. As Coyne and others have...
Time, Place and Technology in Museums: A Dialogical Approach to the Experience (2008)
In this paper we argue that design in museums should be informed by an understanding of people’s experience. We suggest that experience is best understood in terms of the dialogical relations...
TURING AWARD LECTURE GENERALITY IN ARTIFICIAL INTELLIGENCE (2008)
ity in Artificial Intelligence. ” The topic turned out to approach to AI, lack of generality shows up in that the have been overambitious in that I discovered I was axioms we devise to express...
Remarks on “Artificial Intelligence, Logic and Formalizing Common Sense,” (2008)
John Mccarthy, Richmond H. Thomason
[McCarthy, 1989] appeared in a volume of papers on philosophical logic and artificial intelligence that I edited in 1989. The purpose of that volume was to make philosophers better acquainted with...
Richard P. Gabriel, John Mccarthy
Multiprocessing programming languages must support the styles of programming that are natural to the programmer, and they must be able to express all of the forms of concurrency that exist. Qlisp, a...
Phenomenal data mining: from data to phenomena (2008)
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash register data does...
Phenomenal data mining: from data to phenomena (2008)
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash register data does...
Percentage-Based versus Power-Based Vote Tabulation Statistical Audits (2008)
McCarthy, John, Stanislevic, Howard, Lindeman, Mark, Ash, Arlene S, Addona, Vittorio, Batcher, Mary
An audit model is presented to address inefficient percentage-based election audits. Presented to state and local election officials and legislators.
in collaboration with Daniel Bobrow (2007)
Michael R. Genesereth, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, ...
Version 3.0
Progress in Logic-Based AI (2007)
Hubert Dreyfus Claims, John Mccarthy
he collection [Ginsberg, 1987]. It has continued to develop, see e.g. [Lifschitz, 1993]. Minsky [Minsky, 1975] mentioned the need for something like nonmonotonic reasoning, but used this fact as...
Syllabus For 1997 Winter (2007)
John Mccarthy Computer, John Mccarthy
CS323 covers primarily logical AI with emphasis on the epistemology (often called ontology these days) and nonmonotonic reasoning. I'm not sure how rigorously I will follow this syllabus. There...
m4 - trying the MCP NMR retail - ver.4 (2007)
this paper), since we vary result. Of course we neglected to mention the rest of the framework of the circumscription, and the next sub-section deals with that. Putting the last equivalence in an...
CS323 covers primarily logical AI with emphasis on the epistemology (often called ontology these days) and nonmonotonic reasoning. I'm not sure how rigorously I will follow this syllabus. There...
The development of these ideas has benefitted from discussions with Johan van Benthem, (2007)
John Mccarthy, Saa Buv, Tom Costello, Richard Fikes, Mike Genesereth, Fausto Giunchiglia
These notes discuss formalizing contexts as first class objects. The basic relations are ist(c, p) meaning that the proposition p is true in the context c, and value(c, e) designating the value of...
1 WHAT IS ARTIFICIAL INTELLIGENCE? (2007)
Extinguished philosophies lie about the cradle of every science as the strangled snakes beside that of Hercules.- adapted from T. H. Huxley
Assessment of advanced coal gasification processes (2006)
McCarthy, John, Ferrall, Joseph, Charng, Thomas, Houseman, John
A technical assessment of the following advanced coal gasification processes: AVCO High Throughput Gasification (HTG) Process; Bell Single-Stage High Mass Flux (HMF) Process; Cities Service/Rockwell...
• Remarks and references (2006)
John Mccarthy, Nonmonotonic Reasoning
The goal of artificial intelligence research is human-level AI. Logical AI is an approach. It requires mathematical logic with human-level expressiveness both in the formulas it can include and in...
Toral Algebraic Sets and Function Theory on Polydisks (2005)
Agler, Jim, McCarthy, John, Stankus, Mark
A toral algebraic set $A$ is an algebraic set in $\C^n$ whose intersection with $\T^n$ is sufficiently large to determine the holomorphic functions on $A$. We develop the theory of these sets, and...
Distinguished Varieties (2005)
A distinguished variety is a variety that exits the bidisk through the distinguished boundary. We show that Ando's inequality for commuting matrix contractions can be sharpened to looking at the...
The reluctant city: Milwaukee's fragmented metropolis, 1920--1960 (2005)
This is a study of urbanization and suburbanization in twentieth century America, using Milwaukee as its focus. Originally, I intended to examine how Milwaukee's political leaders responded to urban...
STANFORD ARTIFICIAL INTELLIGENCE PROJECT. (2005)
McCarthy,John, Felgenbaum,Edward, Lederberg,Joshua
Current research is reviewed in artificial intelligence and related areas, including representation theory, mathematical theory of computation, models of cognitive processes, speech recognition, and...
SOME PHILOSOPHICAL PROBLEMS FROM THE STANDPOINT OF ARTIFICIAL INTELLIGENCE, (2005)
A computer program capable of acting intelligently in the world must have a general representation of the world in terms of which its inputs are interpreted. Designing such a program requires...
PROJECT TECHNICAL REPORT, (2005)
McCarthy,John, Feigenbaum,Edward, Samuel,Arthur
Recent work of the Stanford Artificial Intelligence Project is summarized in several areas: Scientific hypothesis formation; Symbolic computation; Hand-eye systems; Computer recognition of speech;...
LISP 1.5 PROGRAMMER'S MANUAL, (2005)
McCarthy,John, Abrahams,Paul W., Edwards,Daniel J., Hart,Timothy P., Levin,Michael I.
In cooperation with Computation Center, Mass. Inst. of Tech., Cambridge.
Loránd University and the Hungarian Academy of Sciences. Thanks to those audiences, and (2005)
Curt Rice, Ove Lorentz, John Mccarthy, Bruce Morén, Péter Rebrus
This article develops a treatment of phonologically motivated gaps in paradigms within Optimal Paradigms theory (McCarthy 2005). The gaps are instances of absolute ungrammaticality, i.e. situations...
Curt Rice, Helene Andreassen, Michael Becker, Sylvia Blaho, Patrik Bye, Maghiel Van, ...
The paper discusses phonologically motivated gaps in inflectional paradigms. A model is offered in which the appearance of gaps is based on a tension between markedness constraints, faithfulness...
The reluctant city : Milwaukee's fragmented metropolis, 1920-1960 / (2005)
Thesis (Ph. D.)--Marquette University, 2005.
1 WHAT IS ARTIFICIAL INTELLIGENCE? (2004)
Extinguished philosophies lie about the cradle of every science as the strangled snakes beside that of Hercules.- adapted from T. H. Huxley
These are two quite different books about two quite different aspects of Australia's involvement in the air war of 1939–45. Andrew McMillan, in "Catalina Dreaming", describes in an effective,...
These are two quite different books about two quite different aspects of Australia's involvement in the air war of 1939–45. Andrew McMillan, in "Catalina Dreaming", describes in an effective,...
Recent Research in Computer Science. (2002)
McCarthy,John, Binford,Thomas, Green,Cordell, Luckham,David, Manna,Zohar
This report summarizes recent accomplishments in six related areas: basic AI research and formal reasoning, image understanding, mathematical theory of computation, program verification, natural...
Three Reviews of J. Weizenbaum's Computer Power and Human Reason. (2002)
Buchanan,Bruce G., Lederberg,Joshua, McCarthy,John
Three reviews of J. Weizenbaum's Computer Power and Human Reason (W. H. Freeman and Co., San Francisco, 1976) are reprinted from other sources. A reply by Weizenbaum to McCarthy's review is also...
On the Model Theory of Knowledge. (2002)
McCarthy,John, Sato,Masahiko, Hayashi,Takeshi, Igarashi,Shigeru
Another language for expressing 'knowing that' is given together with axioms and rules of inference and a Kripke type semantics. The formalism is extended to time-dependent knowledge. Completeness...
Recent Research in Artificial Intelligence and Foundations of Programming. (2002)
McCarthy,John, Binford,Tom, Green,Cordell, Luckham,David, Manna,Zohar
This report summarizes recent research in the following areas: artificial intelligence and formal reasoning, mathematical theory of computation and program synthesis, program verification, image...
Recursive Programs as Functions in a First Order Theory. (2002)
Cartwright,Robert, McCarthy,John
Pure Lisp style recursive function programs are represented in a new way by sentences and schemata of first order logic. This permits easy and natural proofs of extensional properties of such...
Circumscription - A Form of Non-Monotonic Reasoning. (2002)
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
Basic Research in Artificial Intelligence and Foundations of Programming. (2002)
McCarthy,John, Binford,Thomas, Luckham,David, Manna,Zohar, Weyhrauch,Richard
This report describes recent research in several related areas. Basic research in artificial intelligence and formal reasoning addresses fundamental problems in the representation of knowledge and...
These are two quite different books about two quite different aspects of Australia's involvement in the air war of 1939–45. Andrew McMillan, in "Catalina Dreaming", describes in an effective,...
These are two quite different books about two quite different aspects of Australia's involvement in the air war of 1939–45. Andrew McMillan, in "Catalina Dreaming", describes in an effective,...
AND THE COMMITTEE ON GRADUATE STUDIES (2002)
John Mccarthy, Michael R. Genesereth, Sheila A. Mcilraith, Leora Morgenstern
ii
Actions And Other Events In Situation Calculus (2002)
John Mccarthy Computer, John Mccarthy
This article presents a situation calculus formalism featuring events as primary and the usual actions as a special case. Events that are not actions are called internal events and actions are called...
These are two quite different books about two quite different aspects of Australia's involvement in the air war of 1939–45. Andrew McMillan, in "Catalina Dreaming", describes in an effective,...
SIMPLE DETERMINISTIC FREE WILL (2002)
A common feature of free will is that a person has choices among alternative actions and chooses the action with the apparently most preferred consequences. In a determinist theory, the mechanism...
Bellini, Vincenzo (música), Pepoli, Carlo (libreto), Allan, Richard Van (voz), Plishka, Paul (voz), Gedda, Nicolai (voz), Cassinelli, Riccardo (voz), ...
Basado en: Têtes rondes et cavaliers, de François d'Ancelot y Boniface Xavier Saintine
Treating classroom learning as a community process of transforming participation in social practices has provided a useful corrective to predominantly abstract, mentalistic conceptualizations of...
Phenomenal Data Mining: From Data To Phenomena (2000)
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash register data does...
Situation Calculus With Concurrent Events And Narrative (2000)
Concurrent events are treated merely by not forbidding them. Narrative is treated as a collection of situations and events and relations among them. Narrative is easier than planning, because it does...
Free will - even for robots (2000)
I can, but I won’t. 1 Human free will is a product of evolution and contributes to the success of the human animal. Useful robots will also require free will of a similar kind, and we will have to...
Approximate objects and approximate theories (2000)
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among different...
Logical AI involves representing knowledge of an agent’s world, its goals and the current situation by sentences in logic. The agent decides what to do by inferring that a certain action or course...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
LISP—NOTES ON ITS PAST AND FUTURE—1980 (1999)
LISP has survived for 21 years because it is an approximate local optimum in the space of programming languages. However, it has accumulated some barnacles that should be scraped off, and some...
Tom Costello, John Mccarthy, John Mccarthy
This URL will also contain a link to the authors ' home pages. The publishers will keep this article on-line on the Internet (or its possible replacement network in the future) for a period of...
Free Will - Even For Robots (1999)
John McCarthy, I Can, But I Won't
Human free will is a product of evolution and contributes to the success of the human animal. Useful robots will also require free will of a similar kind, and we will have to design it into them....
Logical Theories With Approximate Concepts (1999)
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we propose new representation and reasoning...
The Common Business Communication Language (1999)
This paper, written in 1975, published in 1982 [McC82] in the proceedings of a conference whose title was in German, seems to be worth reviving in 1998, because some of its ideas are new in 1998...
The Well-Designed Child (1999)
The innate mental structure that equips a child to interact succesfully with the world includes more than universal grammar. The world itself has structures, and nature has evolved brains with ways...
A formalism is elaboration tolerant to the extent that it is convenient to modify a set of facts expressed in the formalism to take into account new phenomena or changed circumstances....
Creative Solutions To Problems (1999)
The idea is to chip a piece out of the problem of creativity by defining a creative solution to a problem relative to the functions and predicates used in posing the problem. The simplification comes...
Lisp - notes On Its Past And Future - 1980 (1999)
LISP has survived for 21 years because it is an approximate local optimum in the space of programming languages. However, it has accumulated some barnacles that should be scraped o, and some...
Formatted using étendu style Recommended citation: (1999)
Tom Costello, John Mccarthy, John Mccarthy
Typeset by the authors using L ATEX
Creative solutions to problems (1999)
The idea is to chip a piece out of the problem of creativity by defining a creative solution to a problem relative to the functions and predicates used in posing the problem. The simplification comes...
LISP—NOTES ON ITS PAST AND FUTURE—1980 (1999)
LISP has survived for 21 years because it is an approximate local optimum in the space of programming languages. However, it has accumulated some barnacles that should be scraped off, and some...
[Introduction]: In a context where the notion of adat is so contested, there is a need for more nuanced accounts of the role of these local institutional arrangements in the management of natural...
CORRECTNESS OF A COMPILER FOR ARITHMETIC EXPRESSIONS. (1998)
The paper contains a proof of the correctness of a simple compiling algorithm for compiling arithmetic expressions into machine language.
PROPERTIES OF PROGRAMS AND PARTIAL FUNCTION LOGIC, (1998)
Recursive definitions are considered which consist of Algol-like conditional expressions. By specifying a computation rule for evaluating such recursive definition, it determines a partial function....
Project Technical Report, (1998)
McCarthy,John, Samuel,Arthur, Feigenbaum,Edward, Lederberg,Joshua
An overview is presented of current research at Standford in artificial intelligence and heuristic programming. This report is largely the text of a proposal to the Advanced Research Projects Agency...
Formal Description of the Game of Pang-Ke, (1998)
The game of Pang-Ke is formulated in a first-order-logic in order to provide grist for the Advice-Taker mill.
QLISP for Parallel Processors. (1998)
The goal of the Qlisp project at Stanford is to gain experience with the shared-memory, queue-based approach to parallel Lisp, by implementing the Qlisp language on an actual multiprocessor, and by...
QLISP for Parallel Processors. (1998)
Stanford University has completed the initial phase of the Qlisp project for research on parallel Lisp programming. The research made use of the Qlisp implementation on the Alliant FX/8 delivered by...
Common Prototyping Language. (1998)
Prototyping is the process of writing programs for the purpose of obtaining information prior to constructing a production version. Prototyping is used to increase the probability that the first...
Open Architecture for Formal Reasoning. (1998)
This task represents an initial part of a long term project aimed at making both theoretical and practical advances in the field of formal reasoning. The main goal is to provide a framework for...
Mathematical Theory of Computation. (1998)
This project was concerned with the development of correct and reusable software through the use of higher order abstractions (function, control, assignment, process) and reflection. A semantic...
A Statistical Characterization of Denver-Area Microbursts. (1998)
Elmore, Kimberly L., McCarthy, John
This document describes statistical characteristics of microbursts that occurred in the Denver area during the summers of 1982 and 1984. The Joint Airport Weather Studies (JAWS) Project, conducted...
A Statistical Characterization of Denver-Area Microbursts. Revision. (1998)
Elmore, Kimberly L., McCarthy, John
This document describes statistical characteristics of microbursts that occurred in the Denver area during the summers of 1982 and 1984. The Joint Airport Weather Studies (JAWS) Project, conducted...
Basic Research in Knowledge Representation (1998)
McCarthy, John, Talcott, Carolyn
This project concerned developing new logical formalisms for representing information. New formalisms allow us to represent information that we previously could not capture. New reasoning methods...
Combination and Interoperation of Logical Systems Research in Formal Interoperability (1998)
McCarthy, John, Talcott, Carolyn
This project involved investigation of both interpretations of the phrase formal interoperability: (1) formal semantics of the interoperation of components and their combination into complex systems;...
What is Artificial Intelligence? (1998)
This article for the layman answers basic questions about artificial intelligence.
What is Artificial Intelligence? (1998)
This article for the layman answers basic questions about artificial intelligence.
What is Artificial Intelligence? (1998)
This article for the layman answers basic questions about artificial intelligence.
Partial Formalizations And The Lemmings Game (1998)
The computer game Lemmings can serve as a new Drosophila for AI research connecting logical formalizations with information that is incompletely formalizable in practice. In this article we discuss...
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conjunctive changes are...
Joe Pater, Bruce Derwing, Laura Downing, Elan Dresher, Edward Flemming, ...
this paper, I demonstrate that this is indeed the case. Section 1 provides an account of the regular patterns of pretonic stress, a necessary prerequisite to the analysis of stem stress preservation...
A theory is elaboration tolerant to the extent that new information can be incorporated with only simple changes. The simplest change is conjoining new information, and only conjunctive changes are...
A formalism is elaboration tolerant to the extent that it is convenient to modify a set of facts expressed in the formalism to take into account new phenomena or changed circumstances....
Formalizing context (expanded notes (1998)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c,p). It asserts that the pro-position ρ is true in the context c. The most important formulas relate the...
MARTENSON, HENRY, MCCARTHY, JOHN
The United Kingdom has introduced the ‘safe country of origin’ concept in its asylum law, joining that group of states which restrict the rights of some nationalities seeking refuge in their...
Formalizing Context (Expanded Notes) (1997)
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c,p) meaning that the proposition p is true in the context c, and value(c,p) designating the value of...
The Well-Designed Child (1997)
The innate mental structure that equips a child to interact succesfully with the world includes more than universal grammar. The world itself has structures, and nature has evolved brains with ways...
Formalizing Context (Expanded Notes) (1997)
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c,p) meaning that the proposition p is true in the context c, and value(c,p) designating the value of...
The Well-Designed Child (1997)
The innate mental structure that equips a child to interact succesfully with the world includes more than universal grammar. The world itself has structures, and nature has evolved brains with ways...
Formalizing Context (Expanded Notes) (1997)
These notes discuss formalizing contexts as first class objects. The basic relationships are: ist(c,p) meaning that the proposition p is true in the context c, and value(c,p) designating the value of...
The Well-Designed Child (1997)
The innate mental structure that equips a child to interact succesfully with the world includes more than universal grammar. The world itself has structures, and nature has evolved brains with ways...
Formalizing Context (Expanded Notes) (1997)
John McCarthy, Sasa Buvac, Tom Costello, Richard Fikes, Mike Genesereth, Fausto Giunchiglia
this article was going through many versions as the ideas developed, and the mutual influences cannot be specified. This work was partly supported by DARPA contract NAG2-703 and ARPA/ONR grant...
Modality, Si! Modal Logic, No! (1997)
This article is oriented toward the use of modality in artificial intelligence (AI). An agent must reason about what it or other agents know, believe, want, intend or owe. Referentially opaque...
Basic Topics In Experimental Computer Science (1997)
Computer science has an experimental scientific aspect---like every other science. Experiments are made with suitable computer programs in order to discover facts. The programs are usually not...
From the AI point of view, consciousness must be regarded as a collection of interacting processes rather than the unitary object of much philosophical speculation. We ask what kinds of propositions...
The Visual Sphere Of Teichmüller Space And A Theorem Of Masur-Wolf (1997)
John McCarthy, ATHANASE PAPADOPOULOS
. In [M-W ],Masur and W olfproved thattheTeichm uller spaceofgenus g > 1 surfaceswiththeTeichm ullermetricisnot a Gromov hyperbolicspace.Inthispaper,weprovideanalternativeproof basedupon a...
A formalism is elaboration tolerant to the extent that it is convenient to modify a set of facts expressed in the formalism to take into account new phenomena or changed circumstances....
Phenomenal Data Mining: From Observations To Phenomena (1997)
Phenomenal data mining finds relations between the data and the phenomena that give rise to data rather than just relations among the data. For example, suppose supermarket cash register data does...
Modality, si! modal logic, no (1997)
This article is oriented toward the use of modality in artificial intelligence (AI). An agent must reason about what it or other agents know, believe, want, intend or owe. Referentially opaque...
A Logical Approach to Context (1996)
Logical AI develops computer programs that represent what they know about the world primarily by logical formulas and decide what to do primarily by logical reasoning--including nonmonotonic logical...
A Logical Approach to Context (1996)
Logical AI develops computer programs that represent what they know about the world primarily by logical formulas and decide what to do primarily by logical reasoning--including nonmonotonic logical...
A Logical Approach to Context (1996)
Logical AI develops computer programs that represent what they know about the world primarily by logical formulas and decide what to do primarily by logical reasoning--including nonmonotonic logical...
Semantic Foundations for Composition and Interoperation of Open Systems (1996)
John McCarthy, Carolyn Talcott
actor structures characterizes the minimal semantic requirements for an actor language and allows for components to be defined using multiple languages. It also provides a framework for high-level,...
Combining Planning Contexts (1996)
It is often necessary to combine objects that were not designed to work together. These objects may be databases of facts, programs, hardware or plans. Even if the objects were intended to be used...
Fundamental Domains In Teichmüller Space (1996)
John McCarthy, Athanase Papadopoulos, A Thanasepapadopoulos
.W e introducea naturalconstructionoffundamentaldomainsforactionsofsubgroupsofthemappingclassgroupon Teichm ullerspaceand investigatetheirproperties.These...
A Logical AI Approach to Context (1996)
Logical AI develops computer programs that represent what they know about the world primarily by logical formulas and decide what to do primarily by logical reasoning---including nonmonotonic logical...
Fundamental Domains In Teichmüller Space (1996)
Scientiarum Fennicae, John McCarthy, Athanase Papadopoulos
. We introduce a natural construction of fundamental domains for actions of subgroups of the mapping class group on Teichmuller space and investigate their properties. These domains are analogous to...
m4 - trying the MCP NMR retail - ver.3 (1996)
John McCarthy, Eyal Amir, Bank Banks
this paper), since we vary result. Of course we neglected to mention the rest of the framework of the circumscription, and the next sub-section deals with that. Putting the last equivalence in an...
From here to human-level AI (1996)
It is not surprising that reaching human-level AI has proved to be difficult and progress has been slow— though there has been important progress. The slowness and the demand to exploit what has...
Artificial Intelligence and Philosophy (1995)
AI needs many ideas that have hitherto been studied only by philosophers. This is because a robot, if it is to have human level intelligence and ability to learn from its experience, needs a general...
Making Robots Conscious of their Mental States (1995)
In AI, consciousness of self consists in a program having certain kinds of facts about its own mental processes and state of mind. We discuss what consciousness of its own mental structures a robot...
From the AI point of view, consciousness must be regarded as a collection of interacting processes rather than the unitary object of much philosophical speculation. We ask what kinds of propositions...
Artificial Intelligence and Philosophy (1995)
AI needs many ideas that have hitherto been studied only by philosophers. This is because a robot, if it is to have human level intelligence and ability to learn from its experience, needs a general...
Making Robots Conscious of their Mental States (1995)
In AI, consciousness of self consists in a program having certain kinds of facts about its own mental processes and state of mind. We discuss what consciousness of its own mental structures a robot...
From the AI point of view, consciousness must be regarded as a collection of interacting processes rather than the unitary object of much philosophical speculation. We ask what kinds of propositions...
Artificial Intelligence and Philosophy (1995)
AI needs many ideas that have hitherto been studied only by philosophers. This is because a robot, if it is to have human level intelligence and ability to learn from its experience, needs a general...
Making Robots Conscious of their Mental States (1995)
In AI, consciousness of self consists in a program having certain kinds of facts about its own mental processes and state of mind. We discuss what consciousness of its own mental structures a robot...
From the AI point of view, consciousness must be regarded as a collection of interacting processes rather than the unitary object of much philosophical speculation. We ask what kinds of propositions...
First Order Theories Of Individual Concepts And Propositions (1995)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
Making Robots Conscious of their Mental States (1995)
In AI, consciousness of self consists in a program having certain kinds of facts about its own mental processes and state of mind. We discuss what consciousness of its own mental structures a robot...
A Model for Materials Databases (1995)
Gio Wiederhold, Laie Caindec, John Mccarthy, Ken Reifsnider
We present a model for materials data, using terminology and concepts from the database community, to define the complexity and needs which materials data impose on database technology. Many terms...
Situation calculus with concurrent events and narrative (1995)
If this version is relevant, you may cite it. Concurrent events are treated merely by not forbidding them. Narrative is treated as a collection of situations and events and relations among them....
What has AI in common with philosophy (1995)
AI needs many ideas that have hitherto been studied only by philosophers. This is because a robot, if it is to have human level intelligence and ability to learn from its experience, needs a general...
A logical AI approach to context (1995)
Logical AI develops computer programs that represent what they know about the world primarily by logical formulas and decide what to do primarily by logical reasoning—including nonmonotonic logical...
From the AI point of view, consciousness must be regarded as a collection of interacting processes rather than the unitary object of much philosophical speculation. We ask what kinds of propositions...
What has AI in common with philosophy (1995)
AI needs many ideas that have hitherto been studied only by philosophers. This is because a robot, if it is to have human level intelligence and ability to learn from its experience, needs a general...
Requirements Analysis for Distributed Cooperative Work Systems (1994)
an implicit single-user single-system model of interaction. Most metrics for the evaluation of usability and workload also make such an assumption. Yet, increasingly there is a need to represent and...
Notes on Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c,p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
Amor y restos humanos = Love and Human Remains (1993)
Arcand, Denys (realización), Fraser, Brad (guión), Sarossy, Paul (fotografía), Baril, Alain (montaje), McCarthy, John (música), Gibson, Thomas (actuación), ...
Basado en: Unidentified Human Remains and the True Nature of Love, de Bras Fraser
París, Francia = Paris, France (1993)
Ciccoritti, Jerry, Walmsley, Tom (guión), Stone, Barry (fotografía), McCarthy, John (música), Hope, Leslie (actuación), Outerbridge, Peter (actuación), ...
Se basa en la novela de Tom Walmsley
Amor y restos humanos = Love and Human Remains / Realización de D. Arcand. (1993)
Arcand, Denys (realización), Fraser, Brad (guión), Sarossy, Paul (fotografía), Baril, Alain (montaje), McCarthy, John (música), Gibson, Thomas (actuación), ...
Basado en: Unidentified Human Remains and the True Nature of Love, de Bras Fraser
París, Francia = Paris, France / J. Ciccoritti. (1993)
Ciccoritti, Jerry, Walmsley, Tom (guión), Stone, Barry (fotografía), McCarthy, John (música), Hope, Leslie (actuación), Outerbridge, Peter (actuación), ...
Se basa en la novela de Tom Walmsley
Notes on Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c,p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
Notes on Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c,p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
Haendel, Georg Friedrich (música), Congreve, William (libreto), Battle, Kathleen (voz), McNair, Sylvia (voz), Horne, Marilyn (voz), Aler, John (voz), ...
Nacido en Halle en 1685 y muerto en Londres en 1759, el alemán Georg Friedrich Haendel en realidad creó la mayor parte de su música en Inglaterra, luego de un intento previo para establecerse en...
History of circumscription (1993)
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The...
Notes on Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
Notes On Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c; p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
History of circumscription (1993)
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The...
Notes on Formalizing Context (1993)
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important formulas relate the...
Michael R. Genesereth, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, ...
Version 3.0
Knowledge Interchange Format Version 3.0 Reference Manual (1992)
Michael Genesereth Richard, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, ...
: Knowledge Interchange Format (KIF) is a computer-oriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the...
Open Mechanized Reasoning Systems (1992)
John McCarthy, Fausto Giunchiglia, Carolyn Talcott
Contents Project Summary . . . . . . . . . . . . . . . . . Introduction . . . . . . . . . . . . . . . . . . . Our previous work in mechanized reasoning systems . . . . . . . Existing reasoning...
Knowledge Interchange Format Version 3.0 Reference Manual (1992)
Michael Genesereth, Richard E. Fikes, Ronald Brachman, Thomas Gruber, Patrick Hayes, Reed Letsinger, ...
: Knowledge Interchange Format (KIF) is a computer-oriented language for the interchange of knowledge among disparate programs. It has declarative semantics (i.e. the meaning of expressions in the...
Prosodic Circumscription in Choctaw Morphology* (1991)
Linda Lombardi John, John Mccarthy
this article, we will show that one Muskogean gradation process, the so-called y-grade of Choctaw, calls upon prosodic circumscription as well. The Choctaw y-grade displays a complex system of...
Elephant 2000 - A programming language based on speech acts (1990)
Elephant 2000 is a proposed programming language good for writing and verifying programs that interact with people (eg. transaction processing) or interact with programs belonging to other...
Elephant 2000 - A programming language based on speech acts (1990)
Elephant 2000 is a proposed programming language good for writing and verifying programs that interact with people (eg. transaction processing) or interact with programs belonging to other...
Elephant 2000 - A programming language based on speech acts (1990)
Elephant 2000 is a proposed programming language good for writing and verifying programs that interact with people (eg. transaction processing) or interact with programs belonging to other...
Elephant 2000: A Programming Language Based on Speech Acts (1990)
I meant what I said, and I said what I meant. An elephant's faithful, one hundred percent! moreover, An elephant never forgets! Elephant 2000 is a proposed programming language good for writing...
This paper describes a formal system and uses it to express the puzzle of the three wise men and the puzzle of Mr. S and Mr. P. Four innovations in the axiomatization of knowledge were required: the...
Artificial Intelligence, Logic And Formalizing Common Sense (1990)
This article discusses the problems and difficulties, the results so far, and some improvements in logic and logical languages that may be required to formalize common sense. Fundamental conceptual...
Coloring Maps and the Kowalski Doctrine (1990)
It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming...
Formalization of Two Puzzles Involving Knowledge (1990)
This paper describes a formal system and uses it to express the puzzle of the three wise men and the puzzle of Mr. S and Mr. P. Four innovations in the axiomatization of knowledge were required: the...
Elephant 2000: A Programming Language Based on Speech Acts (1990)
I meant what I said, and I said what I meant. An elephant’s faithful, one hundred percent! moreover, An elephant never forgets! Abstract: Elephant 2000 is a vehicle for some ideas about programming...
Abstract : p. 4.
Artificial intelligence, logic and formalizing common sense (1989)
This is a position paper about the relations among artificial intelligence (AI), mathematical logic and the formalization of common-sense knowledge and reasoning. It also treats other problems of...
Jim Des Rivi~res, Hector J. Levesque, John Mccarthy
The relative expressive power of a sentential operator U]o ~ is compared to that of a syntactical predicate L('c~') in the setting of first-order logics. Despite results by Montague and by...
Generality in Artificial Intelligence (1987)
My 1971 Turing Award Lecture was entitled ``Generality in Artificial Intelligence''. The topic turned out to have been overambitious in that I discovered that I was unable to put my thoughts on the...
Formalization of two Puzzles Involving Knowledge (1987)
This paper describes a formal system and uses it to express the puzzle of the three wise men and the puzzle of Mr. S and Mr. P. Four innovations in the axiomatization of knowledge were required: the...
Generality in Artificial Intelligence (1987)
My 1971 Turing Award Lecture was entitled ``Generality in Artificial Intelligence''. The topic turned out to have been overambitious in that I discovered that I was unable to put my thoughts on the...
Formalization of two Puzzles Involving Knowledge (1987)
This paper describes a formal system and uses it to express the puzzle of the three wise men and the puzzle of Mr. S and Mr. P. Four innovations in the axiomatization of knowledge were required: the...
Generality in Artificial Intelligence (1987)
My 1971 Turing Award Lecture was entitled ``Generality in Artificial Intelligence''. The topic turned out to have been overambitious in that I discovered that I was unable to put my thoughts on the...
Formalization of two Puzzles Involving Knowledge (1987)
This paper describes a formal system and uses it to express the puzzle of the three wise men and the puzzle of Mr. S and Mr. P. Four innovations in the axiomatization of knowledge were required: the...
Generality In Artificial Intelligence (1987)
My 1971 Turing Award Lecture was entitled "Generality in Artificial Intelligence ". The topic turned out to have been overambitious in that I discovered that I was unable to put my thoughts...
Applications of Circumscription to Formalizing Common Sense Knowledge (1986)
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The...
Applications of Circumscription to Formalizing Common Sense Knowledge (1986)
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The...
Applications of Circumscription to Formalizing Common Sense Knowledge (1986)
We present a new and more symmetric version of the circumscription method of nonmonotonic reasoning first described in (McCarthy 1980) and some applications to formalizing common sense knowledge. The...
An expert system is a computer program intended to embody the knowledge and ability of an expert in a certain domain. The ideas behind them and several examples have been described in other lectures...
Some Expert Systems Need Common Sense (1984)
An expert system is a computer program intended to embody the knowledge and ability of an expert in a certain domain. The ideas behind them and several examples have been described in other lectures...
Coloring Maps and the Kowalski Doctrine (1982)
It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming...
Coloring Maps and the Kowalski Doctrine (1982)
It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming...
Coloring Maps and the Kowalski Doctrine (1982)
It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming...
Coloring Maps And The Kowalski Doctrine (1982)
It is attractive to regard an algorithm as composed of the logic determining what the results are and the control determining how the result is obtained. Logic programmers like to regard programming...
The Common Business Communication Language (1982)
This paper, written in 1975, published in 1982 [McC82] in the proceedings of a conference whose title was in German, seems to be worth reviving in 1998, because some of its ideas are new in 1998...
The evolution of the literary image of education in nineteenth century Britain / (1981)
Thèse (Ph. D.)--Université de Montréal, 1982.
The evolution of the literary image of education in nineteenth century Britain [microforme] / (1981)
Thèse (Ph. D.)--Université de Montréal, 1982.
Circumscription - A Form of Non-Monotonic Reasoning (1980)
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
Circumscription - A Form of Non-Monotonic Reasoning (1980)
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
Circumscription - A Form of Non-Monotonic Reasoning (1980)
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
Ascribing Mental Qualities to Machines (1979)
Ascribing mental qualities like beliefs, intentions and wants to a machine is sometimes correct if done conservatively and is sometimes necessary to express what is known about its state. We propose...
Ascribing Mental Qualities to Machines (1979)
Ascribing mental qualities like beliefs, intentions and wants to a machine is sometimes correct if done conservatively and is sometimes necessary to express what is known about its state. We propose...
Ascribing Mental Qualities to Machines (1979)
Ascribing mental qualities like beliefs, intentions and wants to a machine is sometimes correct if done conservatively and is sometimes necessary to express what is known about its state. We propose...
First Order Theories of Individual Concepts and Propositions (1979)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
First Order Theories of Individual Concepts and Propositions (1979)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
First Order Theories of Individual Concepts and Propositions (1979)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
First Order Theories of Individual Concepts and Propositions (1979)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
Ascribing mental qualities like beliefs, intentions and wants to a machine is sometimes correct if done conservatively and is sometimes necessary to express what is known about its state. We propose...
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
Humans and intelligent computer programs must often jump to the conclusion that the objects they can determine to have certain properties or relations are the only objects that do. Circumscription...
First Order Theories of Individual Concepts and Propositions (1979)
We discuss first order theories in which individual concepts are admitted as mathematical objects along with the things that reify them. This allows very straightforward formalizations of knowledge,...
Ascribing mental qualities to machines (1979)
Ascribing mental qualities like beliefs, intentions and wants to a machine is sometimes correct if done conservatively and is sometimes necessary to express what is known about its state. We propose...
This draft gives insufficient mention to many people who helped implement LISP and who contributed ideas. Suggestions for improvements in that directions are particularly welcome. Facts about the...
The roots of political instability in contemporary India /--by John McCarthy. (1975)
Microfilm of typescript. Ann Arbor, Mich. : Xerox University Microfilms, 1975. -- 1 reel ; 35 mm.
The concept of the will of God in the thought of Karl Rahner /--by John McCarthy. (1974)
Thesis (S.T.M.)--St. Mary's Seminary & University, 1974.
Economic and political change in rural India / (1973)
Thesis (M.A.)--University of North Carolina at Chapel Hill, 1973.
Some Philosophical Problems from the Standpoint of Artificial Intelligence (1969)
John Mccarthy, Patrick J. Hayes
A computer program capable of acting intelligently in the world must have a general representation of the world in terms of which its inputs are interpreted. Designing such a program requires...
Thesis (M.S.)--University of Oklahoma, 1967.
Correctness Of A Compiler For Arithmetic Expressions (1967)
John Mccarthy And, John Mccarthy, James Painter
This paper contains a proof of the correctness of a simple compiling algorithm for compiling arithmetic expressions into machine language.
Correctness of a compiler for arithmetic expressions (1967)
This paper contains a proof of the correctness of a simple compiling algorithm for compiling arithmetic expressions into machine language. The definition of correctness, the formalism used to express...
Automata studies / W.R.Asbhy ... [et al.] (1965)
Shannon, Claude E, McCarthy, John, Ashby, William Ross
Incluye bibliografía
A Tough Nut for Proof Procedures (1964)
It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which...
A Tough Nut for Proof Procedures (1964)
It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which...
A Tough Nut for Proof Procedures (1964)
It is well known to be impossible to tile with dominoes a checkerboard with two opposite corners deleted. This fact is readily stated in the first order predicate calculus, but the usual proof which...
A Basis For A Mathematical Theory Of Computation (1963)
This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and...
A Basis for a Mathematical Theory of Computation (1963)
edited by P. Braffort and D. Hirshberg and published by North-Holland.
A Basis for a Mathematical Theory of Computation (1962)
This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and...
A Basis for a Mathematical Theory of Computation (1962)
This paper is a corrected version of the paper of the same title given at the Western Joint Computer Conference, May 1961. A tenth section discussing the relations between mathematical logic and...
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I (1960)
this paper in L a T E Xpartly supported by ARPA (ONR) grant N00014-94-1-0775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April...
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I (1960)
this paper in L
Programs with common sense (1959)
Interesting work is being done in programming computers to solve problems which require a high degree of intelligence in humans. However. certain elementary verbal reasoning processes so simple that...
Programs with common sense (1959)
Interesting work is being done in programming computers to solve problems which require a high degree of intelligence in humans. However, certain elementary verbal reasoning processes so simple that...
The article focuses on cognitive modeling for games and animation The article deals with the issue of phenomenal data mining, the essence of data mining with commonsense knowledge....
Promoting Image and Identity in 'Cultural Quarters’: the Case of Dundee
Many cities in recent decades have encouraged the arts and cultural sectors as a means of achieving regeneration outcomes. Such strategies have been followed particularly by cities with perceived...
Failure of Chemical Antibody Suppression to Prevent Fatal Anaphylactic Shock*
Kritzman, Julius, McCarthy, John
Partial suppression of humoral antibody synthesis in guinea-pigs was achieved by treatment with varying doses of methotrexate. The possible physiological and therapeutic significance of such...
Percentage-Based versus Statistical-Power-Based Vote Tabulation Audits
McCarthy, John, Stanislevic, Howard, Lindeman, Mark, Ash, Arlene S., Addona, Vittorio, Batcher, Mary
The article focuses on cognitive modeling for games and animation The article deals with the issue of phenomenal data mining, the essence of data mining with commonsense knowledge....
A Backward Induction Experiment
Binmore, Ken, McCarthy, John, Ponti, Giovanni, Samuelson, Larry, Shaked, Avner
Leverage: securitizing community development construction loans
Community development ; Housing - Finance
Strategies for selling smaller pools of loans
Proceedings of the Conference on the Secondary Market for Community Development Loans