Describing Plan Recognition as Nonmonotonic Reasoning and Belief Revision

  title={Describing Plan Recognition as Nonmonotonic Reasoning and Belief Revision},
  author={Pawel Jachowicz and Randy Goebel},
  booktitle={Australian Joint Conference on Artificial Intelligence},
We provide a characterization of plan recognition in terms of a general framework of belief revision and non-monotonic reasoning. We adopt a generalization of classical belief revision to describe a competence model of plan recognition which supports dynamic change to all aspects of a plan recognition knowledge base, including background knowledge, action descriptions and their relationship to named plans, and accumulating sets of observations on agent actions. 

Two Logical Theories of Plan Recognition

We present a logical approach to plan recognition that builds on Kautz’s theory of keyhole plan recognition, defined as the problem of inferring descriptions of high-le vel plans from a set of

Research of knowledge expression model for Non-monotonic reasoning based on uncertain inference

A new way of knowledge expression model is proposed in mean of extending credibility of TMS node and building evidence transfer mechanism, which ensures the system to inference forward and build hypothesis under the case of the node state is noncommittal.

The Case for Psychologism in Default and Inheritance Reasoning

It is argued that ordinary people so cleverly and effortlessly use default reasoning to solve interesting cognitive tasks that nonmonotonic formalisms were introduced into AI, and this is a form of psychologism, despite the fact that it is not usually recognized as such in AI.

Activity, context, and plan recognition with computational causal behaviour models

This thesis aims to answer the question “how to achieve efficient sensor-based reconstruction of causal structures of human behaviour in order to provide assistance” and introduces the concept of Computational Causal Behaviour Models (CCBMs), which are able to achieve good recognition rates.

A divide and conquer approach to using inductive logic programming for learning user models

It will be shown within this dissertation that the ideas encapsulated within Dilum enable construction of an accurate, usable, and understandable user-model, and that if the concept to be learnt is both vague and complex then even a greedy learning algorithm will require partitioning as a data pre-processing stage.

A Bibliography of Papers in Lecture Notes in Computer Science ( 1999 ) , Part 2 of 2

(111)7x7 [501]. (k − 1) [1300]. 0/1 [237]. 012 [248]. 1 [1300]. 128 [1102]. 2 [1402, 1750, 1755, 493, 546, 1307, 910, 212, 239, 1113, 244, 1270, 873, 320, 874, 1602]. 2R [1782]. 3 [1620, 1537, 1291,



A Bayesian Model of Plan Recognition

A formal theory of plan recognition

The thesis develops the first formal description of the plan recognition process, and shows how problems of medical diagnosis can be cast in the framework, and an example previously solved by a medical expert system is worked out in detail.

Formal theories of action

Reasoning and Revision in Hybrid Representation Systems

  • B. Nebel
  • Philosophy
    Lecture Notes in Computer Science
  • 1990
The universal term-forming formalism is a hybrid representation formalism that combines terminological cycles, representation and management of knowledge, and reasoning in the formalism.

Default Reasoning, Nonmonotonic Logics, and the Frame Problem

This work provides axioms for a simple problem in temporal reasoning which has long been identified as a case of default reasoning, thus presumably amenable to representation in nonmonotonic logic, and investigates the failure of the logics considered and discusses two recent proposals for solving this problem.

A Message Passing Algorithm for Plan Recognition

A general framework for plan recognition whose formulation is motivated by a general purpose algorithm for effective abduction, and the class of plans for which the method is applicable is wider than those previously proposed, as both recursive and optional plan components can be represented.

A Logical Framework for Default Reasoning

  • D. Poole
  • Computer Science, Philosophy
    Artif. Intell.
  • 1988

Getting Serious About Parsing Plans: A Grammatical Analysis of Plan Recognition

This paper is concerned with making precise the notion that recognizing plans is much like parsing text. To this end, it establishes a correspondence between Kautz' plan recognition formalism and

Modeling the User's Plans and Goals

This paper describes the IREPS system, emphasizing its dynamic construction of the task-related plan motivating the information-seeker's queries and the application of this component of a user model to handling utterances that violate the pragmatic rules of the system's world model.

Entrenchment Kinematics 101

The AGM framework of belief dynamics fails to account for iterated belief change. This paper extends the AGM framework in order to solve this problem. As in the AGM, an epistemic input is represented