Europe
Combining Uncertainty and Description Logic Rule-Based Reasoning in Situation-Aware Robots
Krieger, Hans-Ulrich (DFKI GmbH, German Research Center For Artificial Intelligence) | Kruijff, Geert-Jan M. (DFKI GmbH, German Research Center For Artificial Intelligence)
The paper addresses how a robot can maintain a state representation of all that it knows about the environment over time and space, given its observations and its domain knowledge. The advantage in combining domain knowledge and observations is that the robot can in this way project from the past into the future, and reason from observations to more general statements to help guide how it plans to act and interact. The difficulty lies in the fact that observations are typically uncertain and logical inference for completion against a knowledge base is computationally hard.
Modeling Deliberation in Teamwork
Dunin-Kęplicz, Barbara (Warsaw University) | Strachocka, Alina (Warsaw University) | Verbrugge, Rineke (University of Groningen)
Cooperation in multiagent systems essentially hinges on appropriate communication. This paper shows how to model communication in teamwork within TeamLog, the first multi-modal framework wholly capturing a methodology for working together. Taking off from the dialogue theory of Walton and Krabbe, the paper focuses on deliberation, the main type of dialogue during team planning. We provide a four-stage schema of deliberation dialogue along with semantics of adequate speech acts, filling the gap in logical modeling of communication during planning.
Augmenting Weight Constraints with Complex Preferences
Costantini, Stefania (Universita`) | Formisano, Andrea (di L'Aquila)
Preference-based reasoning is a form of commonsense reasoning that makes many problems easier to express and sometimes more likely to have a solution. We present an approach to introduce preferences in the weight constraint construct, which is a very useful programming construct widely adopted in Answer Set Programming (ASP). We show the usefulness of the proposed extension, and we outline how to accordingly extend the ASP semantics.
The Jobs Puzzle: A Challenge for Logical Expressibility and Automated Reasoning
Shapiro, Stuart C. (State University New York at Buffalo)
The Jobs Puzzle, introduced in a book about automated reasoning, is a logic puzzle solvable by some "intelligent sixth graders," but the formalization of the puzzle by the authors was, according to them, "sometimes difficult and sometimes tedious." The puzzle thus presents a triple challenge: 1) formalize it in a non-difficult, non-tedious way; 2) formalize it in a way that adheres closely to the English statement of the puzzle; 3) have an automated general-purpose commonsense reasoner that can accept that formalization and solve the puzzle quickly. In this paper, I present and discuss three formalizations that are less difficult and less tedious than the original. However, none satisfy all three requirements as well as might be desired, and there are a significant number of automated reasoners that cannot solve the puzzle using any of the formalizations. So the Jobs Puzzle remains an interesting challenge.
Choice of Plausible Alternatives: An Evaluation of Commonsense Causal Reasoning
Roemmele, Melissa (University of Indiana) | Bejan, Cosmin Adrian (University of Southern California) | Gordon, Andrew S. (University of Southern California)
Research in open-domain commonsense reasoning has been hindered by the lack of evaluation metrics for judging progress and comparing alternative approaches. Taking inspiration from large-scale question sets used in natural language processing research, we authored one thousand English-language questions that directly assess commonsense causal reasoning, called the Choice Of Plausible Alternatives (COPA) evaluation. Using a forced-choice format, each question gives a premise and two plausible causes or effects, where the correct choice is the alternative that is more plausible than the other. This paper describes the authoring methodology that we used to develop a validated question set with sufficient breadth to advance open-domain commonsense reasoning research. We discuss the design decisions made during the authoring process, and explain how these decisions will affect the design of high-scoring systems. We also present the performance of multiple baseline approaches that use statistical natural language processing techniques, establishing initial benchmarks for future systems.
A Unified Argumentation-Based Framework for Knowledge Qualification
Michael, Loizos (Open University of Cyprus) | Kakas, Antonis (University of Cyprus)
Among the issues faced by an intelligent agent, central is that of reconciling the, often contradictory, pieces of knowledge — be those given, learned, or sensed — at its disposal. This problem, known as knowledge qualification, requires that pieces of knowledge deemed reliable in some context be given preference over the others. These preferences are typically viewed as encodings of reasoning patterns; so, the frame axiom can be encoded as a preference of persistence over spontaneous change. Qualification, then, results by the principled application of these preferences. We illustrate how this can be naturally done through argumentation, by uniformly treating object-level knowledge and reasoning patterns alike as arguments that can be defeated by other stronger ones. We formulate an argumentation framework for Reasoning about Actions and Change that gives a semantics for Action Theories that include a State Default Theory. Due to their explicit encoding as preferences, reasoning patterns can be adapted, when and if needed, by a domain designer to suit a specific application domain. Furthermore, the reasoning patterns can be defeated in lieu of stronger external evidence, allowing, for instance, the frame axiom to be overridden when unexpected sensory information suggests that spontaneous change may have broken persistence in a particular situation.
The Winograd Schema Challenge
Levesque, Hector J. (University of Toronto)
In this paper, we present an alternative to the Turing Test that has some conceptual and practical advantages. Like the original, it involves responding to typed English sentences, and English-speaking adults will have no difficulty with it. Unlike the original, the subject is not required to engage in a conversation and fool an interrogator into believing she is dealing with a person. Moreover, the test is arranged in such a way that having full access to a large corpus of English text might not help much. Finally, the interrogator or a third party will be able to decide unambiguously after a few minutes whether or not a subject has passed the test.
Toward a Computational Model of "Context"
Reich, Wendelin (Swedish Collegium for Advanced Study)
Virtual and robotic agents must be able to understand "communicative acts" (utterances, gestures, controlled facial expressions etc.) if they are to interact and collaborate with humans. For researchers in AI, HCI, HRI and related fields, automatic comprehension of communicative acts has turned out to be a very tough nut to crack. Drawing on recent research from cognitive science and evolutionary psychology, the paper argues that an insufficient conceptualization of "context" is at the heart of this problem, and that we should focus on very simple, non-linguistic communicative acts (pointing gestures etc.) in order to investigate how agents can comprehend communicative acts in realistic contexts. I propose a tripartite model of context which is informed by experimental research on how humans recognize objects (via "affordances"), causal relations among objects, and the collaborative activities of fellow-humans. The model is not a formal one, but detailed enough to help in the development of comprehension algorithms in future research.