منابع مشابه
Situated Simplification
Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the first time, an incremental algorithm for the simultaneous tests of entailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simplz+ztion of the co...
متن کاملSituated Robotics
Robotics, like any concept that has grown and evolved over time, has eluded a single, unifying definition. What once used to be thought of as a replacement for repetitive, manual labor, has grown into a large field that includes applications as diverse as automated car assembly, space exploration and robtic soccer. Although robotics includes teleoperation, in which the robot itself may be merel...
متن کاملSituated Semantics
ions. In J. Barwise, J. M. Gawron, G. Plotkin, & S. Tutiya (Eds.), Situation theoryand its applications (Vol. 2, pp. 25–39). Stanford, CA: CSLI Publications.Devlin, K. (1992). Infons as mathematical objects.Minds and Machines, 2, 185–201.Devlin, K. (1998). Goodbye, Descartes: The end oflogic and the search for a new cosmology of the mind. New York: Wiley.Devlin, K. (2001...
متن کاملSituated Simpliication
Testing satisfaction of guards is the essential operation of concurrent constraint programming (CCP) systems. We present and prove correct, for the rst time, an incremental algorithm for the simultaneous tests of en-tailment and disentailment of rational tree constraints to be used in CCP systems with deep guards (e.g., in AKL or in Oz). The algorithm is presented as the simpliication of the co...
متن کاملSituated Groups
The referents of plural NP's denote groups, by their nature, but at the same time, we want to say that they denote atomic individuals in some cases. By analyzing such dual nature of plural Np's in Situation Semantics, we o er a straightforward and uni ed analysis which accounts not only for various readings of plural NP's but also for the so-called Committee and Judge/Hangman Puzzles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00197-1