Incremental Generation of Abductive Explanations for Tactical Behavior

Lecture notes in computer sciencePublished 1 January 2008

Thomas Wagner, Tjorben Bogon, Carsten Elfers

DOI10.1007/978-3-540-68847-1_41

Source URL

Citations2

SJR quartileQ2

SJR score0.35

SNIP0.55

TL;DR

This paper presents a qualitative, formal, abductive approach, based on a uniform representation of soccer tactics that allows to recognize/explain the tactical and strategical behavior of opponent teams based on past (usually incomplete) observations.

Abstract

According to the expert literature on (human) soccer, e.g., the tactical behavior of a soccer team should differ significantly with respect to the tactics and strategy of the opponent team. In the offensive phase the attacking team is usually able to actively select an appropriate tactic with limited regard to the opponent strategy. In contrast, in the defensive phase the more passive recognition of tactical patterns of the behavior of the opponent team is crucial for success. In this paper we present a qualitative, formal, abductive approach, based on a uniform representation of soccer tactics that allows to recognize/explain the tactical and strategical behavior of opponent teams based on past (usually incomplete) observations.

Keywords

Computer Science

NatureCollected Papers of Charles Sanders Peirce

4,625 Citations1935

View PDF

User Modeling and User-Adapted InteractionBayesian Models for Keyhole Plan Recognition in an Adventure Game

204 Citations1998David Albrecht, Ingrid Zukerman +1 more

An approach to keyhole plan recognition which uses a dynamic belief (Bayesian) network to represent features of the domain that are needed to identify users' plans and goals and shows promise for efficient goal prediction in domains which have similar features to those of this domain.

Computer Vision and Image UnderstandingRecognizing Planned, Multiperson Action

176 Citations2001Stephen Intille, Aaron Bobick

This paper demonstrates how highly structured, multiperson action can be recognized from noisy perceptual data using visually grounded goal-based primitives and low-order temporal relationships that are integrated in a probabilistic framework.

Fast and complete symbolic plan recognition

110 Citations2005Dorit Avrahami-Zilberbrand, Gal A. Kaminka

This work shows a novel application of machine-learning decision-tree to efficiently map multi-featured observations to matching plan steps and provides efficient lazy-commitment recognition algorithms that avoid enumerating hypotheses with every observation.

User Modeling and User-Adapted InteractionWeighted abduction for plan ascription

79 Citations1992Douglas E. Appelt, Martha E. Pollack

This work shows how the model of plan ascription developed by Konolige and Pollack can be recast in the framework of weighted abduction, and discusses the potential advantages and disadvantages of this encoding.

On the role of coherence in abductive explanation

61 Citations1990Hwee Tou Ng, Raymond J. Mooney

Some problems encountered using abduction to understand text are described, and some solutions to overcome these problems are presented, around the use of a different criterion, called explanatory coherence, as the primary measure to evaluate the quality of an explanation.

Lecture notes in computer scienceSequential Pattern Mining for Situation and Behavior Prediction in Simulated Robotic Soccer

56 Citations2006Andreas D. Lattner, Andrea Miene +2 more

This work presents an approach which applies unsupervised symbolic learning off-line to a qualitative abstraction in order to create frequent patterns in dynamic scenes which can be later applied during runtime inorder to predict future situations and behaviors.

National Conference on Artificial IntelligenceOn computing all abductive explanations

43 Citations2002Thomas Eiter, Kazuhisa Makino

This work considers the computation of all respectively a polynomial subset of the explanations of an abductive query from a Horn theory, and derives tractability results as well as intractability results, and furthermore also semi-tractable results in terms of solvability in quasi-polynomial time.

View PDF

Artificial IntelligenceSupport set selection for a bductive and default reasoning

39 Citations1996Bart Selman, Hector J. Levesque

This work explores abduction tasks similar to that of the ATMS, but which return relatively small answers, and establishes for the first time a strong connection between computing abductive explanations and computing extensions in default logic.

Coaching the 3-4-1-2 and 4-2-3-1

14 Citations2002Massimo Lucchesi