Temporal structure and enablement representation for mutual wills: A Petri net approach

Those temporal formalisms that are sporadically found nowadays in the literature of AI & Law are based on temporal logic. We claim a revived role for another major class of temporal representation: Petri nets. This formalism, popular in computing from the 1970s, had its potential recognized on occasion in the literature of legal computing as well, but apparently the discipline has lost sight of it, and its practitioners on average need be tutored into this kind of representation. Asynchronous, concurrent processes—for which the approach is well‐suited—are found in the legal domain, in disparate contexts. We develop an example for Mutual Wills.

Temporal representation of state transitions

This paper describes a knowledge-based temporal representation of state transitions for industrial real-time systems. To allow expression of uncertainty, we shall define fluents as disjuncts of positive/negative time-varying properties. A state of the world is represented as a collection of fluents, which is usually incomplete in the sense that neither the positive form nor the negative form of some properties can be implied from it. The world under consideration is assumed to persist in a given state until an action(s) takes place to effect a transition of it into another state, where actions may either be instantaneous or durative. High-level causal laws are characterized in terms of relationships between actions and the involved world states. An effect completion axiom is imposed on each causal law to guarantee that all the fluents that can be affected by the performance of the corresponding action are governed. This completion requirement is practical for most industrial real-time applications and in fact provides a simple and effective treatment to the so-called frame problem.

Reified temporal logics: an overview

There are three main approaches to the representation of temporal information in AI literature: the so-called method of temporal arguments that simply extends functions and predicates of first-order language to include time as the additional argument; modal temporal logics which are extensions ofthe propositional or predicate calculus with modal temporal operators; and reified temporal logics which reify standard propositions of some initial language (e.g., the classical first-order or modal logic) as objects denoting propositional terms. The objective of this paper is to provide an overview onthe temporal reified approach by looking closely atsome representative existing systems featuring reified propositions, including those of Allen, McDermott, Shoham, Reichgelt, Galton, and Ma and Knight. We shall demonstrate that, although reified logics might be more complicated in expressing assertions about some given objects with respect to different times, they accord a special status to time and therefore have several distinct advantages in talking about some important issues which would be difficult (if not impossible) to express in other approaches.

[Book Review] Noel Starkey (ed), Connectionist Natural Language Processing: Readings from 'Connection Science'

Review of: Noel Starkey (ed), Connectionist Natural Language Processing: Readings from 'Connection Science'

A policy-definition language and prototype implementation library for policy-based autonomic systems

This paper presents work towards generic policy toolkit support for autonomic computing systems in which the policies themselves can be adapted dynamically and automatically. The work is motivated by three needs: the need for longer-term policy-based adaptation where the policy itself is dynamically adapted to continually maintain or improve its effectiveness despite changing environmental conditions; the need to enable non autonomics-expert practitioners to embed self-managing behaviours with low cost and risk; and the need for adaptive policy mechanisms that are easy to deploy into legacy code. A policy definition language is presented; designed to permit powerful expression of self-managing behaviours. The language is very flexible through the use of simple yet expressive syntax and semantics, and facilitates a very diverse policy behaviour space through both hierarchical and recursive uses of language elements. A prototype library implementation of the policy support mechanisms is described. The library reads and writes policies in well-formed XML script. The implementation extends the state of the art in policy-based autonomics through innovations which include support for multiple policy versions of a given policy type, multiple configuration templates, and meta-policies to dynamically select between policy instances and templates. Most significantly, the scheme supports hot-swapping between policy instances. To illustrate the feasibility and generalised applicability of these tools, two dissimilar example deployment scenarios are examined. The first is taken from an exploratory implementation of self-managing parallel processing, and is used to demonstrate the simple and efficient use of the tools. The second example demonstrates more-advanced functionality, in the context of an envisioned multi-policy stock trading scheme which is sensitive to environmental volatility

The AGILE policy expression language for autonomic systems

This paper presents the AGILE policy expression language. The language enables powerful expression of self-managing behaviours and facilitates policy-based autonomic computing in which the policies themselves can be adapted dynamically and automatically. The language is generic so as to be deployable across a wide spectrum of application domains, and is very flexible through the use of simple yet expressive syntax and semantics. The development of AGILE is motivated by the need for adaptive policy mechanisms that are easy to deploy into legacy code and can be used by non autonomics-expert practitioners to embed self-managing behaviours with low cost and risk. A library implementation of the policy language is described. The implementation extends the state of the art in policy-based autonomics through innovations which include support for multiple policy versions of a given policy type, multiple configuration templates, and higher-level ‘meta-policies’ to dynamically select between differently configured business-logic policy instances and templates. Two dissimilar example deployment scenarios are examined.

Investigating the representation of merging behavior at the floor–stair interface in computer simulations of multi-floor building evacuations

In this article, the representation of the merging process at the floor— stair interface is examined within a comprehensive evacuation model and trends found in experimental data are compared with model predictions. The analysis suggests that the representation of floor—stair merging within the comprehensive model appears to be consistent with trends observed within several published experiments of the merging process. In particular: (a) The floor flow rate onto the stairs decreases as the stair population density increases. (b) For a given stair population density, the floor population's flow rate onto the stairs can be maximized by connecting the floor to the landing adjacent to the incoming stair. (c) In situations where the floor is connected adjacent to the incoming stair, the merging process appears to be biased in favor of the floor population. It is further conjectured that when the floor is connected opposite the incoming stair, the merging process between the stair and floor streams is almost in balance for high stair population densities, with a slight bias in favor of the floor stream at low population densities. A key practical finding of this analysis is that the speed at which a floor can be emptied onto a stair can be enhanced simply by connecting the floor to the landing at a location adjacent to the incoming stair rather than opposite the stair. Configuring the stair in this way, while reducing the floor emptying time, results in a corresponding decrease in the descent flow rate of those already on the stairs. While this is expected to have a negligible impact on the overall time to evacuate the building, the evacuation time for those higher up in the building is extended while those on the lower flows is reduced. It is thus suggested that in high-rise buildings, floors should be connected to the landing on the opposite side to the incoming stair. Information of this type will allow engineers to better design stair—floor interfaces to meet specific design objectives.

Implementation of cognitive mapping, spatial representation and wayfinding behaviours of people within evacuation modelling tools

Within the building evacuation context, wayfinding describes the process in which an individual located within an arbitrarily complex enclosure attempts to find a path which leads them to relative safety, usually the exterior of the enclosure. Within most evacuation modelling tools, wayfinding is completely ignored; agents are either assigned the shortest distance path or use a potential field to find the shortest path to the exits. In this paper a novel wayfinding technique that attempts to represent the manner in which people wayfind within structures is introduced and demonstrated through two examples. The first step is to encode the spatial information of the enclosure in terms of a graph. The second step is to apply search algorithms to the graph to find possible routes to the destination and assign a cost to the routes based on their personal route preferences such as "least time" or "least distance" or a combination of criteria. The third step is the route execution and refinement. In this step, the agent moves along the chosen route and reassesses the route at regular intervals and may decide to take an alternative path if the agent determines that an alternate route is more favourable e.g. initial path is highly congested or is blocked due to fire.

Issues in second language proficiency

Benati provides clarity about the characteristics and notion of language proficiency in the field of second language acquisition. He looks at four areas of research paradigmatically related to the role of proficiency: theorizing and measuring second language proficiency; the dimensions of L2 proficiency; factors contributing to the attainment of L2 proficiency and attaining L2 proficiency in the classroom. It also contains a variety of research accounts about the specific factors which have an effect on proficiency together with a theorised measurement of proficiency in second language research. It will be required reading for researchers in applied linguistics and second language acquisition.

Japanese language teaching: a communicative approach

Japanese Language Teaching examines the practical aspects of the acquisition of Japanese as a second language, underpinned by current theory and research. Each chapter examines the theory and practice of language teaching, and progresses to a consideration of the practical design of tasks for teaching. The final section applies theory and practice to an empirical case study, drawn from a classroom with Japanese as a second language. With its emphasis on practice underpinned by contemporary theory, this book will be of interest to postgraduates studying second language acquisition and applied linguistics. [Source: publisher's description].

Key terms in second language acquisition

Key Terms in Second Language Acquisition includes definitions of key terms within second language acquisition, and also provides accessible summaries of the key issues within this complex area of study. The final section presents a list of key readings in second language acquisition that signposts the reader towards classic articles and also provides a springboard to further study.