A Complementary Economy? National Markets and International Product in Early Australian Theatre Managements

The international circulation of commercial theatre in the early twentieth century was driven not only from the centres of Great Britain and the USA, but by the specific enterprise and habitus of managers in ‘complementary’ production sites such as Australia, South Africa, and New Zealand. The activity of this period suggests a de-centred competitive trade in theatrical commodities – whether performers, scripts, or productions – wherein the perceived entertainment preferences and geographies of non-metropolitan centres were formative of international enterprise. The major producers were linked in complex bonds of partnerships, family, or common experience which crossed the globe. The fractures and commonalities displayed in the partnerships of James Cassius Williamson and George Musgrove, which came to dominate and shape the fortunes of the Australian industry for much of the century, indicate the contradictory commercial and artistic pressures bearing upon entrepreneurs seeking to provide high-quality entertainment and form advantageous combinations in competition with other local and international managements. Clarke, Meynell and Gunn mounted just such spirited competition from 1906 to 1911, and their story demonstrates both the opportunities and the centralizing logic bearing upon local managements shopping and dealing in a global market. The author, Veronica Kelly, works at the University of Queensland. She is presently undertaking a study of commercial stars and managements in late nineteenth- and early twentieth-century Australia, with a focus on the star performer as model of history, gender, and nation.

The use of complementary and alternative therapies by patients with cancer

The aim of this research was to assess the prevalence and predictors of complementary and alternative therapy (CAT) use among cancer patients in Australia. A total of 1492 cancer patients attending nine major public cancer treatment centers in New South Wales, Australia, were asked to complete the Supportive Care Needs Survey. Of the 1354 consenting patients, 888 (65%) returned a completed survey. This article reports the secondary analyses of the survey data, specifically focusing on CAT use. For all cancers, 17.1% of patients were using at least one CAT. The two main demographic characteristics of CAT users were gender and age, where females were more likely to use CAT than males and that CAT use declined as age increased. Time since diagnosis was identified as the only significant clinical predictor of CAT use, where CAT use increased with time until 5 years since diagnosis. Our research shows that herbal treatments and naturopathy are the most popular CAT used by cancer patients (constituting over 30% of all CAT use recorded). The use of CAT among cancer patients is a significant issue in cancer care, especially considering the potential interactions between CAT and conventional medicines. Given that many cancer patients may not be aware of potential risks associated with these interactions it is important that oncologists and others involved in cancer patient care are informed about CAT and its use amongst their patients.

DR-NEGOTIATE - A system for automated agent negotiation with defeasible logic-based strategies

This paper reports on a system for automated agent negotiation, based on a formal and executable approach to capture the behavior of parties involved in a negotiation. It uses the JADE agent framework, and its major distinctive feature is the use of declarative negotiation strategies. The negotiation strategies are expressed in a declarative rules language, defeasible logic, and are applied using the implemented system DR-DEVICE. The key ideas and the overall system architecture are described, and a particular negotiation case is presented in detail.

BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic

In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show that the notion of social agent either requires more complex computations or has some philosophical drawbacks.

Interaction between Normative Systems and Cognitive Agents in Temporal Modal Defeasible Logic

While some recent frameworks on cognitive agents addressed the combination of mental attitudes with deontic concepts, they commonly ignore the representation of time. An exception is [1]that manages also some temporal aspects both with respect to cognition and normative provisions. We propose in this paper an extension of the logic presented in [1]with temporal intervals.

Trace Semantics for the Owicki-Gries Theory Integrated with the Progress Logic from UNITY

The theory of Owicki and Gries has been used as a platform for safety-based verifcation and derivation of concurrent programs. It has also been integrated with the progress logic of UNITY which has allowed newer techniques of progress-based verifcation and derivation to be developed. However, a theoretical basis for the integrated theory has thus far been missing. In this paper, we provide a theoretical background for the logic of Owicki and Gries integrated with the logic of progress from UNITY. An operational semantics for the new framework is provided which is used to prove soundness of the progress logic.

A Logic Framework of Normative-based Contract Management

We explore of the feasibility of the computationally oriented institutional agency framework proposed by Governatori and Rotolo testing it against an industrial strength scenario. In particular we show how to encode in defeasible logic the dispute resolution policy described in Article 67 of FIDIC.

Contextual Deliberation of Cognitive Agents in Defeasible Logic

This article extends Defeasible Logic to deal with the contextual deliberation process of cognitive agents. First, we introduce meta-rules to reason with rules. Meta-rules are rules that have as a consequent rules for motivational components, such as obligations, intentions and desires. In other words, they include nested rules. Second, we introduce explicit preferences among rules. They deal with complex structures where nested rules can be involved.

Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

Developing logic programs from specifications using stepwise refinement

In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.