Weida, R. (1996). Closed Terminologies and Temporal reasoning in Descriptions for Plan Recognition. Ph.D. thesis, Department of Computer Science, Columbia University, New York, NY.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....characterized in terms of graph matching, and based on two separate notions of subsumption: pure terminological subsumption between action types labeling the nodes, and pure temporal subsumption between interval relationships labeling the arcs. The plan library is used to guide plan recognition (Weida, 1995, 1996) in a way similar to that proposed in (Kautz, 1991) Even if this work has strong motivations, no formal semantics is provided for the language and the reasoning problems. There are Description Logics intended to represent and reasoning about actions following the Strips tradition. Heinsohn, ....

Weida, R. (1996). Closed Terminologies and Temporal reasoning in Descriptions for Plan Recognition. Ph.D. thesis, Department of Computer Science, Columbia University, New York, NY.

....of the underlying algorithms can be found in [7] Besides, Ciclop provides means for terminology closure. A closed TBox does not allow for the introduction of new concepts. Also, concepts have to be de ned to be concrete or abstract, and individuals are forced to belong to concrete concepts only ([9], 7] Dividing the knowledge base into multiple TBoxes and ABoxes allows for closing only parts of it. Furthermore, Ciclop allows for the de ni tion of TBoxes which represent concrete domains [1] A numeric TBox allows for representing constraints in form of linear equations and inequalities, ....

R. Weida. Closed Terminologies and Temporal Reasoning in Descriptions for Plan Recognition. PhD thesis, Columbia University, New York, NY, 1998.

....characterized in terms of graph matching, and based on two separate notions of subsumption: pure terminological subsumption between action types labeling the nodes, and pure temporal subsumption between interval relationships labeling the arcs. The plan library is used to guide plan recognition #Weida, 1995, 1996# in a way similar to that proposed in #Kautz, 1991#. Even if this work has strong motivations, no formal semantics is provided for the language and the reasoning problems. There are Description Logics intended to represent and reasoning about actions following the Strips tradition. Heinsohn, ....

Weida, R. #1996#. Closed Terminologies and Temporal reasoning in Descriptions for Plan Recognition. Ph.D. thesis, Department of Computer Science, Columbia University, New York, NY.

....24, bd de la Victoire, F 67084 Strasbourg Cedex rousse liia.u strasbg.fr Abstract The paper presents an extension of Description Logic to cope with con guration problems. In the paradigm of non structural algorithms the de nitions are di erent from classic one. The study originated by Weida [3] in 1992 with CLASSIC and by others [2] PROSE at AT T) must be reviewed in order to take account of the extended expressiveness of the language and of its semantic. The paper describes what is intended by terminological closure, a way to modify and constrain the terminology in order to ....

....on a kernel DL system appeared to be a good one. CICLOP DL is based on the tableaux calculus and has a good expressiveness (ALCFIHR with axioms) joined to an interesting eciency. See DL99 System comparison [5] The idea to use DL to help con guration comes from the study originated by Weida [3] in 1992 with CLASSIC and by others [2] PROSE at AT T) The present paper is based on Weida s ideas concerning con guration modelling and concerning DL use. It also introduces several improvements due to the necessity to be more precise when replacing structural algorithms with tableaux calculus ....

Weida R., 'Closed Terminologies and Temporal Reasoning in Description Logic for Concept and Plan Recognition' Ph.D. Dissertation,1996 Columbia University, USA.

....characterized in terms of graph matching, and based on two separate notions of subsumption: pure terminological subsumption between action types labeling the nodes, and pure temporal subsumption between interval relationships labeling the arcs. The plan library is used to guide plan recognition (Weida, 1996) in a way similar to that proposed by Kautz (1991) Even if this work has strong motivations, no formal semantics is provided for the language and the reasoning problems. Starting from the assumption that an action has a duration in time, our proposal considers an interval based modal temporal ....

....actions to states of the world (see Section 5.2) This kind of expressivity is not captured by T Rex, since it uses a non temporal Description Logic to represent actions. The main application of T Rex is plan recognition; according to the ideas of Kautz (1991) a Closed World Assumption (CWA) (Weida, 1996) is made, assuming that the plan library is complete and an observed plan will be fully accounted for by a single plan. CWA is not relied on here, following the Open World Semantics characterizing Description Logics. Weaker, but monotonic, deductions are allowed in the plan recognition process. ....

Weida, R. (1996). Closed Terminologies and Temporal reasoning in Descriptions for Plan Recognition. Ph.D. thesis, Department of Computer Science, Columbia University, New York, NY.

....can help focus the efforts of both user and configuration engine. This work evolved from DL based plan recognition in the T REX system (Weida Litman 1994; 1992) It is implemented in the K REP DL system (Mays, Dionne, Weida 1991) Further details, including proofs of theorems, are provided in (Weida 1996). Configuration System Configuration Engine Description Logic System Configuration KB Figure 1: Configuration System Architecture In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI 96) Copyright c fl1996, AAAI. 2 (define prim concept COMPANY) ....

....to update the MSNs, MSOs, and MGOs, respectively. The first phase discovers all newly necessary concepts, the second all newly impossible ones. The third simply prepares the new MGOs for the MSN phase of the next round of incremental recognition. Due to limited space, readers are referred to (Weida 1996) for further details of the algorithm. As an example, an initial configuration description might be: create individual COMPUTER SYSTEM89 (and COMPUTER SYSTEM (at least 2 processor) at least 1 secondary storage) For this example, suppose that IBM PROCESSOR DEVICE is omitted from the ....

[Article contains additional citation context not shown here]

Weida, R. A. 1996. Closed Terminologies and Temporal Reasoning in Description Logic for Concept and Plan Recognition. Ph.D. Dissertation, Columbia University.

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