Arrow Research search

Author name cluster

Ernest Davis

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

25 papers
2 author rows

Possible papers

25

AAAI Conference 2024 Conference Paper

The Defeat of the Winograd Schema Challenge (Abstract Reprint)

  • Vid Kocijan
  • Ernest Davis
  • Thomas Lukasiewicz
  • Gary Marcus
  • Leora Morgenstern

The Winograd Schema Challenge—a set of twin sentences involving pronoun reference disambiguation that seem to require the use of commonsense knowledge—was proposed by Hector Levesque in 2011. By 2019, a number of AI systems, based on large pre-trained transformer-based language models and fine-tuned on these kinds of problems, achieved better than 90% accuracy. In this paper, we review the history of the Winograd Schema Challenge and discuss the lasting contributions of the flurry of research that has taken place on the WSC in the last decade. We discuss the significance of various datasets developed for WSC, and the research community's deeper understanding of the role of surrogate tasks in assessing the intelligence of an AI system.

AIJ Journal 2023 Journal Article

The defeat of the Winograd Schema Challenge

  • Vid Kocijan
  • Ernest Davis
  • Thomas Lukasiewicz
  • Gary Marcus
  • Leora Morgenstern

The Winograd Schema Challenge—a set of twin sentences involving pronoun reference disambiguation that seem to require the use of commonsense knowledge—was proposed by Hector Levesque in 2011. By 2019, a number of AI systems, based on large pre-trained transformer-based language models and fine-tuned on these kinds of problems, achieved better than 90% accuracy. In this paper, we review the history of the Winograd Schema Challenge and discuss the lasting contributions of the flurry of research that has taken place on the WSC in the last decade. We discuss the significance of various datasets developed for WSC, and the research community's deeper understanding of the role of surrogate tasks in assessing the intelligence of an AI system.

AIJ Journal 2017 Journal Article

Commonsense reasoning about containers using radically incomplete information

  • Ernest Davis
  • Gary Marcus
  • Noah Frazier-Logue

In physical reasoning, humans are often able to carry out useful reasoning based on radically incomplete information. One physical domain that is ubiquitous both in everyday interactions and in many kinds of scientific applications, where reasoning from incomplete information is very common, is the interaction of containers and their contents. We have developed a preliminary knowledge base for qualitative reasoning about containers, expressed in a sorted first-order language of time, geometry, objects, histories, and actions. We have demonstrated that the knowledge suffices to justify a number of commonsense physical inferences, based on very incomplete knowledge.

JAIR Journal 2017 Journal Article

Logical Formalizations of Commonsense Reasoning: A Survey

  • Ernest Davis

Commonsense reasoning is in principle a central problem in artificial intelligence, but it is a very difficult one. One approach that has been pursued since the earliest days of the field has been to encode commonsense knowledge as statements in a logic-based representation language and to implement commonsense reasoning as some form of logical inference. This paper surveys the use of logic-based representations of commonsense knowledge in artificial intelligence research.

AIJ Journal 2016 Journal Article

The scope and limits of simulation in automated reasoning

  • Ernest Davis
  • Gary Marcus

In scientific computing and in realistic graphic animation, simulation – that is, step-by-step calculation of the complete trajectory of a physical system – is one of the most common and important modes of calculation. In this article, we address the scope and limits of the use of simulation, with respect to AI tasks that involve high-level physical reasoning. We argue that, in many cases, simulation can play at most a limited role. Simulation is most effective when the task is prediction, when complete information is available, when a reasonably high quality theory is available, and when the range of scales involved, both temporal and spatial, is not extreme. When these conditions do not hold, simulation is less effective or entirely inappropriate. We discuss twelve features of physical reasoning problems that pose challenges for simulation-based reasoning. We briefly survey alternative techniques for physical reasoning that do not rely on simulation.

AIJ Journal 2015 Journal Article

Ethical guidelines for a superintelligence

  • Ernest Davis

Nick Bostrom, in his new book SuperIntelligence, argues that the creation of an artificial intelligence with human-level intelligence will be followed fairly soon by the existence of an almost omnipotent superintelligence, with consequences that may well be disastrous for humanity. He considers that it is therefore a top priority for mankind to figure out how to imbue such a superintelligence with a sense of morality; however, he considers that this task is very difficult. I discuss a number of flaws in his analysis, particularly the viewpoint that implementing ethical behavior is an especially difficult problem in AI research.

KR Conference 2012 Conference Paper

The Winograd Schema Challenge

  • Hector Levesque
  • Ernest Davis
  • Leora Morgenstern

ing the presence of thinking (or understanding, or intelligence, or whatever appropriate mental attribute), we assume that typed English text, despite its limitations, will be a rich enough medium. In this paper, we present an alternative to the Turing Test that has some conceptual and practical advantages. A Winograd schema is a pair of sentences that differ only in one or two words and that contain a referential ambiguity that is resolved in opposite directions in the two sentences. We have compiled a collection of Winograd schemas, designed so that the correct answer is obvious to the human reader, but cannot easily be found using selectional restrictions or statistical techniques over text corpora. A contestant in the Winograd Schema Challenge is presented with a collection of one sentence from each pair, and required to achieve human-level accuracy in choosing the correct disambiguation. 1 2 The trouble with Turing The Turing Test does have some troubling aspects, however. First, note the central role of deception. Consider the case of a future intelligent machine trying to pass the test. It must converse with an interrogator and not just show its stuff, but fool her into thinking she is dealing with a person. This is just a game, of course, so it’s not really lying. But to imitate a person well without being evasive, the machine will need to assume a false identity (to answer “How tall are you? ” or “Tell me about your parents. ”). All other things being equal, we should much prefer a test that did not depend on chicanery of this sort. Or to put it differently, a machine should be able to show us that it is thinking without having to pretend to be somebody or to have some property (like being tall) that it does not have. We might also question whether a conversation in English is the right sort of test. Free-form conversations are no doubt the best way to get to know someone, to find out what they think about something, and therefore that they are thinking about something. But conversations are so adaptable and can be so wide-ranging that they facilitate deception and trickery. Consider, for example, ELIZA (Weizenbaum 1966), where a program (usually included as part of the normal Emacs distribution), using very simple means, was able to fool some people into believing they were conversing with a psychiatrist. The deception works at least in part because we are extremely forgiving in terms of what we will accept as legitimate conversation. A Rogerian psychiatrist may say very little except to encourage a patient to keep on talking, but it may be enough, at least for a while. Consider also the Loebner competition (Shieber 1994), a restricted version of the Turing Test that has attracted considerable publicity. In this case, we have a more balanced conversation taking place than with ELIZA. What is striking about transcripts of these conversations is the fluidity of the responses from the subjects: elaborate wordplay, puns, jokes, quotations, clever asides, emotional outbursts, points of order. Everything, it would seem, except clear and direct

AIJ Journal 2011 Journal Article

How does a box work? A study in the qualitative dynamics of solid objects

  • Ernest Davis

This paper is an in-depth study of qualitative physical reasoning about one particular scenario: using a box to carry a collection of objects from one place to another. Specifically we consider the plan, plan1 “Load objects uCargo into box oBox one by one; carry oBox from location l1 to location l2”. We present qualitative constraints on the shape, starting position, and material properties of uCargo and oBox and on the characteristics of the motion that suffice to make it virtually certain that plan1 can be successfully executed. We develop a theory, consisting mostly of first-order statements together with two default rules, that supports an inference of the form “If conditions XYZ hold, and the agent attempts to carry out plan1 then presumably he will succeed”. Our theory is elaboration tolerant in the sense that carrying out the analogous inference for carrying objects in boxes with lids, in boxes with small holes, or on trays can reuse much of the same knowledge. The theory integrates reasoning about continuous time, Euclidean space, commonsense dynamics of solid objects, and semantics of partially specified plans.

AAAI Conference 2010 Conference Paper

Ontologies and Representations of Matter

  • Ernest Davis

We carry out a comparative study of the expressive power of different ontologies of matter in terms of the ease with which simple physical knowledge can be represented. In particular, we consider five ontologies of models of matter: particle models, fields, two ontologies for continuous material, and a hybrid model. We evaluate these in terms of how easily eleven benchmark physical laws and scenarios can be represented.

AIJ Journal 2008 Journal Article

Pouring liquids: A study in commonsense physical reasoning

  • Ernest Davis

This paper presents a theory that supports commonsense, qualitative reasoning about the flow of liquid around slowly moving solid objects; specifically, inferring that liquid can be poured from one container to another, given only qualitative information about the shapes and motions of the containers. It shows how the theory and the problem specification can be expressed in a first-order language; and demonstrates that this inference and other similar inferences can be justified as deductive conclusions from the theory and the problem specification.

AIJ Journal 2005 Journal Article

Knowledge and communication: A first-order theory

  • Ernest Davis

This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of events, including other communicative acts; and the knowledge states of any agent—speaker, hearer, or third parties—any of these in the past, present, or future—and any logical combination of these, including formulas with quantifiers. We prove that this theory is consistent, and compatible with a wide range of physical theories. We examine how the theory avoids two potential paradoxes, and discuss how these paradoxes may pose a danger when this theory are extended.

AIJ Journal 2005 Journal Article

Processes and continuous change in a SAT-based planner

  • Ji-Ae Shin
  • Ernest Davis

The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; reusable resources, both numeric and interval-valued; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of Boolean combinations of propositional atoms and linear constraints over numeric variables. In the second stage, a SAT-based arithmetic constraint solver, such as LPSAT or MathSAT, is used to find a solution to the system of constraints. In the third stage, a correct plan is extracted from this solution. We discuss the structure of the planner and show how planning with time and metric quantities is compiled into a system of constraints. The proofs of soundness and completeness over a substantial subset of our extended version of PDDL+ are presented.

KR Conference 2004 Conference Paper

A First-Order Theory of Communicating First-Order Formulas

  • Ernest Davis

This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of events, including other communicative acts; and the knowledge states of any agent --- speaker, hearer, or third parties --- any of these in the past, present, or future --- and any logical combination of these, including formulas with quantifiers. We prove that the theory is consistent and compatible with a wide range of physical theories. We examine how the theory avoids two potential paradoxes, and discuss how these paradoxes may post a danger when this theory is extended.

AAAI Conference 2004 Conference Paper

Continuous Time in a SAT-Based Planner

  • Ji-Ae Shin
  • Ernest Davis

The TM-LPSAT planner can construct plans in domains containing atomic actions and durative actions; events and processes; discrete, real-valued, and interval-valued fluents; and continuous linear change to quantities. It works in three stages. In the first stage, a representation of the domain and problem in an extended version of PDDL+ is compiled into a system of propositional combinations of propositional variables and linear constraints over numeric variables. In the second stage, the LPSAT constraint engine (Wolfman & Weld 2000) is used to find a solution to the system of constraints. In the third stage, a correct parallel plan is extracted from this solution. We discuss the structure of the planner and show how a real-time temporal model is compiled into LPSAT constraints.

ICAPS Conference 1994 Conference Paper

Branching Continuous Time and the Semantics of Continuous Action

  • Ernest Davis

D. Suppose that: It is often useful to model the behavior of an autonomousintelligent creature in terms of continuous control and choice. For example, a robot whomoves i through space can be idealized as able to execute any continuous motion, subject to constraints on veii locity and accelleration; in such a model, the robot can %hoose = at any instant to change his accelleriv ation. Weshow how such models can be described using a continuous branching time structure. Wediscuss mathematical foundations of continuous branching structures, theories of continuous action in physical worlds, embeddingof discrete theories of action E. L h in a continuous structure, and physical and epistemic feasibility of plans with continuousac! ion. (n Continuous Plans bi

AIJ Journal 1987 Journal Article

Constraint propagation with interval labels

  • Ernest Davis

Constraint propagation is often used in AI systems to perform inference about quantities. This paper studies one particular kind of constraint propagation, where quantities are labelled with signs or with intervals, and these labels are propagated through recorded constraints. We review the uses of such inference schemes in AI systems of various kinds, and evaluate their strengths and weaknesses. In particular, we determine the completeness and running time of constraint propagation for various kinds of labels and constraints.

IJCAI Conference 1985 Conference Paper

A Representation for Complex Physical Domains

  • Sanjaya Addanki
  • Ernest Davis

We are exploring a system, called PROMPT, that will be capable of reasoning from first principles and high level knowledge in complex, physical domains. Such problem-solving calls for a representation that will support the different analyses techniques required (e. g. differential, asymptotic, perturbation etc.). Efficiency considerations require that the representation also support heuristic control of reasoning techniques. This paper lays the ground work for our effort by briefly describing the ontology and the representation scheme of PROMPT. Our ontology allows reasoning about multiple pasts and different happenings in the same space-time. The ontology provides important distinctions between materials, objects, bulk and distributed abstractions among physical entities. We organise world knowledge into "prototypes" that are used to focus the reasoning process. Problem-solving involves reasoning with and modifying prototypes.

AIJ Journal 1984 Journal Article

Planning routes through uncertain territory

  • Drew McDermott
  • Ernest Davis

Planning routes and executing them requires both topological and metric information. A natural implementation of a ‘cognitive map’ might therefore consist of an assertional data base for topological information and a ‘fuzzy map’ for the metric information. A fuzzy map captures facts about objects by recording their relative positions, orientations, and scales in convenient frames of reference. It is fuzzy in the sense that coordinates are specified to lie in a range rather than having fixed values. The fuzzy map allows easy retrieval of information. The same information is also represented in a discrimination tree, which allows an object to be retrieved given its location and other attributes. The problem of constructing a fuzzy map is more difficult; we present a partial solution, an algorithm that assimilates a fact first by imposing constraints on the fuzzy coordinates of the objects involved, then by rearranging or growing the tree of frames of reference. Route planning is modelled as a process of finding the overall direction and topology of the path, then filling in the details by deciding how to go around barriers. It uses the retrieval algorithms. Our program SPAM carries out all these processes.

v2026.09.13