A. W. Black. "Constraints in Computational Situation Semantics," Lecture Notes circulated during the Logic, Language, and Information Summer School, Saarbrucken, Germany, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computational Situation Theory - Tin, Akman (1994) (Correct)
....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 ....
....are used to decide which one(s) will be successfully asserted. Candidate backward chaining constraints are activated either when a query is entered explicitly or a query is issued by the forward chaining mechanism. In BABY SIT, the following classes of constraints can be easily modeled [14]: ffl Situation constraints: Constraints between situation types. ffl Infon constraints: Constraints between infons (of a situation) ffl Argument constraints: Constraints on argument roles (of an infon) 4.2.3 Querying The basic computation upon posing a query is done by the application of ....
[Article contains additional citation context not shown here]
A. W. Black. "Constraints in Computational Situation Semantics," Lecture Notes circulated during the Logic, Language, and Information Summer School, Saarbrucken, Germany, 1991.
Situated Modeling of Epistemic Puzzles - Ersan, Akman (1995) (1 citation) (Correct)
....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 ....
....is a fire whenever he perceives smoke. Chapter 3 Computational Situation Theory Currently, there are three systems based on situation theory. PROSIT, developed by Nakashima et al. 32, 33, 35] is the pioneering work in this direction. This was followed by the development of ASTL by Black [9, 10]. Another computational medium based on situations called BABY SIT is currently being built at Bilkent University by Akman and Tin [44, 48, 46] PROSIT is primarily aimed at general problems of knowledge representation, while ASTL is developed for experiments in natural language processing. On the ....
[Article contains additional citation context not shown here]
A. W. Black. Constraints in computational situation semantics. Lecture Notes circulated during the Logic, Language, and Information Summer School. Saarbrucken, Germany, 1991.
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