H. Nakashima, H. Suzuki, P. K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498, Institute for New Generation Computer Technology, Tokyo, Japan, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....influential semantic and logical tradition [26] is that information content is context dependent (where a context is a situation) All these features may be cast in a rich formalism for a computational framework based on situation theory. Yet, there have been few attempts to investigate this [16, 40, 43]. Questions of what it means to do computation with situations and what aspects of the theory makes this suitable as a novel programming paradigm have not been fully answered in the literature. This is what we hope to achieve here. Accordingly, in this paper, a computational approach to situation ....

....theory and its associated environment (called BABYSIT) are proposed. The proposed approach especially adopts the ontological features which were originally put forward in [11] Existing approaches towards a computational account of situation theory unfortunately incorporated only some of these [14, 15, 16, 39, 40, 43]; the remaining features were omitted for the sake of achieving particular goals. This has caused conceptual and philosophical divergence from the ontology of the original theory a dangerous and unwanted side effect. Our work will try to avoid this pitfall by simply sticking to the essentials of ....

[Article contains additional citation context not shown here]

H. Nakashima, H. Suzuki, P.-K. Halvorsen, and S. Peters. "Towards a Computational Interpretation of Situation Theory," in Proceedings of the International Conference on Fifth Generation Computer Systems, Institute for New Generation Computer Technology, Tokyo, Japan, 1988, pp. 489--498.

....versions of it have been applied to a number of linguistic issues [17] resulting in what is commonly known as situation semantics. This was followed by assorted studies on the computational aspects of the theory, which gave birth to a group of computational systems based on situation theory [32, 33, 35, 44, 48, 46, 50, 49, 9, 10]. PROSIT (PROgramming in SItuation Theory) developed by Nakashima et al. 32, 33, 35] is the pioneering work in this direction. Therefore, it is worth examining how much PROSIT reflects situation theoretic concepts and how much it deviates from them. PROSIT seems to be especially suitable for ....

....as situation semantics. This was followed by assorted studies on the computational aspects of the theory, which gave birth to a group of computational systems based on situation theory [32, 33, 35, 44, 48, 46, 50, 49, 9, 10] PROSIT (PROgramming in SItuation Theory) developed by Nakashima et al. [32, 33, 35], is the pioneering work in this direction. Therefore, it is worth examining how much PROSIT reflects situation theoretic concepts and how much it deviates from them. PROSIT seems to be especially suitable for writing programs simulating humanlike (commonsense) reasoning [28, 29] Unfortunately, ....

[Article contains additional citation context not shown here]

H. Nakashima, H. Suzuki, P.-K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-88), pages 489--498, Tokyo, 1988.

....temporal relations and information within our contexts might be useful. ffl The need for a Situation Theory tool: Since we are using a situation theoretic framework, we should have a programming environment for Situation Theory. There are two serious attempts to do this: BABY SIT [16] and PROSIT [13]. As these attempts progress, the computational aspects of our approach can be better investigated. ffl Some classical problems: We have not discussed the application of our approach to epistemic puzzles ( a la Smullyan) However, a similar study by Ersan and Akman [8] can be adopted to our ....

H. Nakashima, H. Suzuki, P. K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498, Institute for New Generation Computer Technology, Tokyo, Japan, 1988.

....import export among modules as in typical object oriented languages. In QUIXOT E, importing exporting rules are done by rule inheritance defined in terms of the binary relation v S over modules called the submodule relation. The submodule relation is similar to the subsituation relation in PROSIT[15] 6 . Basically, rule inheritance is defined as follows: Definition 6 (Rule Inheritance) If m 1 w S m 2 then module m 1 inherits all the rules of m 2 , that is, all the rules in m 2 are exported to m 1 . Under this definition, the set of rules of m 1 is 6m 1 [6m 2 . The right hand side of w S ....

....identity is not defined over complex terms but over normal first order terms. The approach taken in QUIXOT E is more fine grained than that of F logic. 8. 2 Modules As module concepts are very important in knowledge representation as well as programming, several related works have been done [9, 10, 11, 15]. First, a brief comparison of the language features of these works is presented. From the viewpoint of knowledge representation, modularization corresponds to the classification of knowledge. In such this sense, the ability to relate modules flexibly is important. QUIXOT E provides a number of ....

H. Nakashima, H. Suzuki, P-K. Halvorsen, S. Peters, "Towards a Computational Interpretation of Situation Theory", The International Conference on Fifth Generation Computer Systems, 1988.

....these features alone do not constitute a computational system, with the addition of constraints and rules of inference we can have the basis for a computational system. The idea of a computational situation theoretic language has been considered elsewhere. Most notable is the language Prosit [9] which offers a Prolog like language based on situation theory rather than first order logic. Other systems (e.g. 5] allow the representation of situations etc. within some other formalism (e.g. feature structures) but do not use situation theory itself as the basis for the language. Astl Astl ....

H. Nakashima, H. Suzuki, P-K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In FGCS, ICOT, 1988.

....which creates the desired contextual effects might be quite difficult. This issue might be considered, in some sense, to be analogous to the unification mechanism of Prolog. Here, we will not cover the details of this task, but refer the interested reader to Computational Situation Theory [29, 39, 38]. In determining the relevance, a major problem is the measurement method. In our opinion there are three possibilities: i) Relevance as a number in the interval [0; 1] This method might be useful in computational applications of relevance. One such application area is IR. The use of certainty ....

....and Wilson s Relevance Theory. Using our formalization of context together with Relevance Theory might be beneficial. The reader may find computer applications of situation theoretic concepts shallow or cursory, but we are encouraged by the preliminary results in Computational Situation Theory [29, 39, 38]. ....

H. Nakashima, H. Suzuki, P. K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498, Institute for New Generation Computer Technology, Tokyo, Japan, 1988.

....in a feature system rather than anything new. Likewise if we restricted ourselves in Prolog to offer just the necessary features of astl again it could be rightly viewed as an implementation of astl rather than a new language. There is another computational language based on situation theory ( Nakashima et al. 88] Prosit offers a Prolog like language using aspects of situation theory. However its development has concentrated on its use in knowledge representation rather than as in astl s case on natural language processing. However astl is by no means the end. There are aspects of semantic theories ....

H. Nakashima, H. Suzuki, P-K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498. ICOT, 1988.

.... bona fide situationtheoretic constructs [2] In this paper, we demonstrate the resolution of pronominal anaphora in Turkish within a situation theoretic computational environment, called BABY SIT [7, 8] Compared to previous proposals for computational situation theory [10] i.e. PROSIT [6] and ASTL [1] BABY SIT strives to be purer. BABY SIT is currently being developed in KEE TM on a SUN Sparc workstation. 2 Terminology According to situation theory [2] individuals, properties, relations, spatio temporal locations, and situations are the basic ingredients. The world is ....

Nakashima H, Suzuki H, Halvorsen P-K, Peters S (1988) Towards a computational interpretation of situation theory. In: Proceedings of the International Conference on Fifth Generation Computer Systems, Institute for New Generation Computer Technology, Tokyo, Japan, pp. 489--498

....in what is commonly known as situation semantics . This was accompanied by assorted studies on the computational aspects of the theory, which gave birth to a small collection of programming languages based on situation theory; cf. 24] for a recent survey. PROSIT (PROgramming in SItuation Theory) [14, 15, 5] is the pioneering work in this direction. PROSIT seems to be especially suitable for writing programs simulating human like (commonsense) reasoning [12] Unfortunately, there have been very few attempts to employ PROSIT in this style. Such a study is, however, of great importance, and would help ....

....there is a fire whenever he perceives smoke: S 0 = s 0 j s 0 j= smoke present, l; t; 1AE] S 1 = s 1 j s 1 j= fire present, l; t; 1AE] C = S 0 ) S 1 ] 3 PROSIT Currently, there are three computational systems based on situation theory. PROSIT, developed by Nakashima et al. [14, 15, 5], is the earliest system. It was followed by the ASTL system of Black [4] Another computational medium called BABY SIT is currently being built by Akman and Tin [23, 22, 21] PROSIT is primarily aimed at problems of knowledge representation whereas ASTL is intended for experiments in natural ....

[Article contains additional citation context not shown here]

Hideyuki Nakashima, Hiroyuki Suzuki, Per-Kristian Halvorsen, and Stanley Peters. Towards a computational interpretation of situation theory. In Proc. Intl. Conf. on Fifth Generation Computer Systems (FGCS--88), pages 489--498, Tokyo, 1988.

....of situation theory vis a vis another influential semantic theory in the logical tradition [13] is that information content is context dependent. While not much work has been done to construct a computational framework based on situation theory, there have been some attempts to investigate this [8, 9, 16, 23]. These have incorporated only some of the original features of the theory; the remaining features were omitted for the sake of achieving particular goals. This has caused conceptual and philosophical divergence from the ontology of the theory. Recent studies [26, 27, 28, 29] have tried to avoid ....

....of situation semantics and DRT, as witnessed by Barwise and Cooper s recent work [4] 5 Computational Frameworks 5.1 PROSIT PROSIT (PROgramming in SItuation Theory) is the pioneering work in this direction. PROSIT is a situation theoretic programming language developed by Nakashima et al. [23]. It has been implemented in Common Lisp. PROSIT is tailored more for knowledge representation in general than for natural language processing. One can define situations and assert knowledge in particular situations. It is also possible to define relations between situations in the form of ....

H. Nakashima, H. Suzuki, P.-K. Halvorsen, and S. Peters. "Towards a Computational Interpretation of Situation Theory," in Proceedings of the International Conference on Fifth Generation Computer Systems, Institute for New Generation Computer Technology, Tokyo, Japan, 1988, pp. 489--498.

....which we review in the next section, we have tried to stick to the essentials of the theory and adopted the ontology which was first put forward by Barwise and Perry [3] and then refined by Devlin [7] 3. 1 PROSIT PROSIT (PROgramming in SItuation Theory) was developed by Nakashima et al. [15, 16] and implemented in Lisp. In PROSIT one can define situations and assert knowledge into particular situations. It is also possible to define relations between situations in the form of constraints. There is an inference engine similar to a Prolog interpreter. One can assert facts that a situation ....

.... BABY SIT is to facilitate the development and testing of programs in domains ranging from linguistics to AI within a unified framework built upon situationtheoretic constructs [23, 25] BABY SIT accommodates the basic features of situation theory and, compared to the existing approaches [4, 5, 16], enhances these features [24, 26] Devlin s reformed approach to situation theory [7] has been extensively used in designing the formal skeleton of BABY SIT. Akin to the basic types in situation theory, there are nine basic types which are employed in BABY SIT: IND (individuals) TIM (times) ....

H. Nakashima, H. Suzuki, P.-K. Halvorsen, and S. Peters. Towards a Computational Interpretation of Situation Theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498, Institute for New Generation Computer Technology, Tokyo, Japan, 1988.

....has additional information to the original one s, then the following transformation is allowed: situation. s j= hhR; x 1 ; x i01 ; x i ; x i 1 ; x n ii s 0 j= hhR; x 1 ; x i01 ; x i 1 ; x n ii The transformation between them is also within the descriptive power of Prosit[NSHP88] which is a language based on Situation Theory. We will write the relation between s and s as s v s 0 meaning that 1. s 0 is a projection of s. 2. s 0 is, therefore, a further specialization of s. 3. s 0 therefore contains all the information in s (s 0 is larger in informationwise) ....

Hideyuki Nakashima, Hiroyuki Suzuki, Per-Kristian Halvorsen, and Stanley Peters. Towards a computational interpretation of situation theory. In Proc. of FGCS 88, 1988.

No context found.

H. Nakashima, H. Suzuki, P. K. Halvorsen, and S. Peters. Towards a computational interpretation of situation theory. In Proceedings of the International Conference on Fifth Generation Computer Systems, pages 489--498, Institute for New Generation Computer Technology, Tokyo, Japan, 1988.

No context found.

H. Nakashima, H. Suzuki, P. Halvorsen, and S. Peters, "Towards a Computational Interpretation of Situation Theory," in Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS--88), Tokyo, Japan, pp. 489--498, 1988.

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