Citations: A formal theory of plan recognition and its implementation

67 citations found. Retrieving documents...

J. Allen, H. Kautz, R. Pelavin, and J. Tennenberg. A formal theory of plan recognition and its implementation. In Reasoning About Plans, chapter 2, pages 69--126. Morgan Kaufmann Publishers, 1991.

Home/Search Document Details and Download Summary Related Articles Check

This paper is cited in the following contexts:

First 50 documents Next 50

Incremental Case-Based Plan Recognition with Local Predictions - Kerkez, Cox (Correct)

....of the observed agent, the recognizer typically compares the observations of the agent s behavior with possible plans contained in its plan library, and tries to find the plan(s) from the library that would account for the observed behavior. In a large number of plan recognition systems [8] [30], the plan library is specified for the recognizer a priori, by some external agent who is often the system designer. This limits the plan recognition process because only the plans known in advance can be recognized. Novel plans cannot be considered. Furthermore, it is often required that the ....

....Although the case based approach to plan recognition is not new [7] the novelty of our approach primarily arises from the manner in which we represent a plan (i.e. a case) and from the representation of indices by which we store and retrieve plans. Unlike most plan recognition systems (e.g. [30]) that represent a plan as a sequence of actions bracketed by an initial state and a goal state, we represent a plan as a sequence of action state pairs [33] such that the initial pair is as follows: null action , initial state ) The last action is also represented as follows. ....

[Article contains additional citation context not shown here]

Kautz, H. (1991). A formal theory of plan recognition and its implementation. In J. Allen, et. al., Reasoning about plans. San Francisco: Morgan Kaufmann.

Retroactive Recognition of Interleaved Plans for Natural.. - Blaylock (2001) (3 citations) (Correct)

....to minimally change hypotheses and does not generate and consider all possibilities. Lastly, BELIEVER s plan recognition did not support interleaved plans as ours does. 3. 2 Kautz Generalized Plan Recognition The other foundation work in plan recognition was that of Kautz [KA86, Kau87, Kau90, Kau91] Kautz cast plan recognition as the logical inference process of circumscription. This logical cast on plan recognition allowed him to use the a very rich knowledge representation (essentially that of first order logic) as well as to use temporal logic to represent actions and time. Kautz ....

Henry Kautz. A formal theory of plan recognition and its implementation. In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69--125. Morgan Kaufman, San Mateo, CA, 1991.

Case-Based Plan Recognition in Computer Games - Fagan, Cunningham (2003) (Correct)

....future work. 2. Plan Recognition Plan Recognition (PR) is the process whereby an agent observes the actions of another agent with the objective of inferring the agent s future actions, intentions or goals. Several methods for plan recognition have been explored. The most notable are deductive [1], abductive [2] probabilistic [3] and case based [4] PR approaches may also be classified according to whether the PR process was intended [1] or keyhole [5] If the observed agent cooperates to convey his or her intentions to the recognising agent, as in natural language dialogue systems [6] ....

....of inferring the agent s future actions, intentions or goals. Several methods for plan recognition have been explored. The most notable are deductive [1] abductive [2] probabilistic [3] and case based [4] PR approaches may also be classified according to whether the PR process was intended [1] or keyhole [5] If the observed agent cooperates to convey his or her intentions to the recognising agent, as in natural language dialogue systems [6] then the PR process is said to be intended. Whereas if the relationship between the observing and the observed agents is non interactive then it ....

[Article contains additional citation context not shown here]

Kautz., H., A Formal Theory of Plan Recognition and its Implementation, Reasoning About Plans, Allen, J., Pelavin, R. and Tenenberg, J. ed., Morgan Kaufmann, San Mateo, C.A., 1991, pp. 69-125.

Corpus-based, Statistical Goal Recognition - Blaylock, Allen (2003) (Correct)

....that remain. 4.1 Desiderata Speed Because it involves a simple probability lookup, our recognizer is linear in the number of goals (and training it is linear in the amount of training data) Speed is a big advantage to this approach. By comparison, logic based reasoning recognizers like [Kautz, 1991] are exponential in the size of the plan library. Several systems [Vilain, 1990; Lesh, 1998] improve on this time complexity, but at the expense of expressiveness. Early partial prediction Our recognizer was able to make correct predictions 22.3 (2.3 actions) through the input with 83.9 ....

....of our goal recognizer depends on the existence of a plan corpus. If a plan corpus exists or can be created for the new domain (see section below) all we have to do is use it to train models for the new domain. On the other hand, most goal recognizers (e.g. Vilain, 1990; Carberry, 1990a; Kautz, 1991; Charniak and Goldman, 1993; Paek and Horvitz, 2000] require a complete, hand crafted plan library in order to perform recognition, which can require a significant amount of knowledge engineering for each domain. Granted, these systems are performing plan recognition and not just goal ....

[Article contains additional citation context not shown here]

Henry Kautz. A formal theory of plan recognition and its implementation. In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69--125. Morgan Kaufman, San Mateo, CA, 1991.

Automated Analysis for Digital Forensic Science - Stallard (2002) (Correct)

....search for patterns of attacker activity based on known procedures for subverting security. In addition, Elsaesser and Tanner present an approach [13] which automatically generates hypotheses of computer attacks, simulates them on the target con guration and applies plan recognition techniques [23] to search for supporting data. My approach, which examines evidence for violations of speci ed relationships between data in existing software architectures, is a form of integrity checking rst studied in the Clark Wilson Integrity Model [4] By applying that model to a database, for example, ....

H. A. Kautz. A formal theory of plan recognition and its implementation. In J. F. Allen, H. A. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning About Plans, pages 69-125. Morgan Kaufmann Publishers, San Mateo (CA), USA, 1991.

Retroactive Recognition of Interleaved Plans for Natural.. - Blaylock (2001) (3 citations) (Correct)

....to minimally change hypotheses and does not generate and consider all possibilities. Lastly, BELIEVER s plan recognition did not support interleaved plans as ours does. 3. 2 Kautz Generalized Plan Recognition The other foundation work in plan recognition was that of Kautz [KA86, Kau87, Kau90, Kau91] Kautz cast plan recognition as the logical inference process of circumscription. This logical cast on plan recognition allowed him to use the a very rich knowledge representation (essentially that of rst order logic) as well as to use temporal logic to represent actions and time. Kautz ....

Henry Kautz. A formal theory of plan recognition and its implementation. In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69-125. Morgan Kaufman, San Mateo, CA, 1991.

Managing Communicative Intentions in Dialogue Using a.. - Blaylock (2002) (Correct)

....This observation was among the beginnings of the planrecognition field. The implementation, however, was never fully implemented nor specified. Kautz Generalized Plan Recognition The other foundational work in plan recognition was that of Kautz ( Kautz and Allen, 1986; Kautz, 1987; Kautz, 1990; Kautz, 1991] Kautz cast plan recognition as the logical nonmonotonic inference process of circumscription. This logical cast on plan recognition allowed him to use the a very rich knowledge representation (essentially that of first order logic) Kautz represented the space of possible plans as an event ....

Henry Kautz, "A Formal Theory of Plan Recognition and its Implementation, " In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69--125. Morgan Kaufman, San Mateo, CA, 1991.

Plan Recognition without Plan Libraries: A Plan Graph Based Approach - Hong (Correct)

....Recognition without Plan Libraries: A Plan Graph Based Approach Jun Hong School of Information and Software Engineering University of Ulster at Jordanstown Newtownabbey, Co. Antrim BT37 0QB, UK J.Hong ulst.ac. uk A typical plan recognition system (e.g. [4]) uses an explicit model of plans commonly called a plan library and conducts some type of reasoning to identify plans from this model. In a large and complex domain, it is a tedious or impractical task to represent a massive number of plans. In some other domains, the knowledge about plans might ....

Kautz, H.A. A formal theory of plan recognition and its implementation. In J.F. Allen, et al, eds., Reasoning about Plans.

Foundations of Assisted Cognition Systems - Kautz, Etzioni, Fox, Weld (2003) (8 citations) Self-citation (Kautz) (Correct)

....an actor s plans and goals given a partial view of that actor s behavior [135] Plan recognition was initially studied in the context of natural language understanding [2] and was largely descriptive in nature. More principled approaches have been investigated by the authors of this report. Kautz [79] modeled plan recognition logically in a manner that allowed goals and plans to be described at various levels of abstraction. Etzioni et al. 94, 95, 92, 93] developed a version space algorithm for plan recognition that is provably sound and polynomial time [94, 93] Weld et al. developed goal ....

Henry Kautz. A formal theory of plan recognition and its implementation. In J.F. Allen, H.A. Kautz, R.N. Pelavin, and J.D. Tennenberg, editors, Reasoning About Plans, pages 69--126. Morgan Kaufmann Publishers, 1991.

Inferring Human Interactions From Sparse Visual Data - Paul Rybski Manuela (Correct)

No context found.

J. Allen, H. Kautz, R. Pelavin, and J. Tennenberg. A formal theory of plan recognition and its implementation. In Reasoning About Plans, chapter 2, pages 69--126. Morgan Kaufmann Publishers, 1991.

Using Sparse Visual Data to Model Human Activities in Meetings - Paul Rybski Manuela (Correct)

No context found.

Henry Kautz. A formal theory of plan recognition and its implementation. In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69--125. Morgan Kaufman, San Mateo, CA, 1991.

Using Sparse Visual Data to Model Human Activities in Meetings - Paul Rybski Manuela (2004) (2 citations) (Correct)

People Detection and Tracking in High - Resolution Panoramic Video (2004) (Correct)

No context found.

J. Allen, H. Kautz, R. Pelavin, and J. Tennenberg, "A formal theory of plan recognition and its implementation," in Reasoning About Plans. Morgan Kaufmann Publishers, 1991, ch. 2, pp. 69--126.

Using Sparse Visual Data to Model Human Activities in Meetings - Paul Rybski Manuela (2004) (2 citations) (Correct)

Recognizing Instantiated Goals Using Statistical Methods - Blaylock, Allen (Correct)

Corpus-based, Statistical Goal Recognition - Nate Blaylock And (Correct)

Using Sparse Visual Data to Model Human Activities in Meetings - Rybski, Veloso (2004) (2 citations) (Correct)

People Detection and Tracking in High Resolution.. - Patil, Rybski.. (2004) (Correct)

Using Sparse Visual Data to Model Human Activities in Meetings - Rybski, Veloso (2004) (2 citations) (Correct)

Inferring Human Interactions From Sparse Visual Data - Paul Rybski Manuela (Correct)

Corpus-based, Statistical Goal Recognition - Nate Blaylock And (Correct)

Automated Analysis for Digital - Forensic Science Semantic (2003) (Correct)

No context found.

H. A. Kautz. A formal theory of plan recognition and its implementation. In J. F. Allen, H. A. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning About Plans, pages 69--125. Morgan Kaufmann Publishers, San Mateo (CA), USA, 1991.

Managing Communicative Intentions in Dialogue Using a.. - Blaylock (2002) (Correct)

No context found.

Henry Kautz, \A Formal Theory of Plan Recognition and its Implementation, " In J. Allen, H. Kautz, R. Pelavin, and J. Tenenberg, editors, Reasoning about Plans, pages 69-125. Morgan Kaufman, San Mateo, CA, 1991.

First 50 documents Next 50

Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback

CiteSeer.IST - Copyright Penn State and NEC