Learn More
x In this paper, we describe a new method for constructing minimal, deterministic, acyclic finite-state automata from a set of strings. Traditional methods consist of two phases: the first to construct a trie, the second one to minimize it. Our approach is to construct a minimal automaton in a single phase by adding new strings one by one and minimizing the(More)
Introductory programming instructors in Australian universities are choosing the programming language they teach primarily based on a perception of industry demand. This paper examines if this perception is justifiable, and offers instructors of all programming languages an insight into the issue of academic and industry balance, now and into the future. 1(More)
The goal of this paper is to test if a programming methodology based on the declarative language A-Prolog and the systems for computing answer sets of such programs, can be successfully applied to the development of medium size knowledge-intensive applications. We report on a successful design and development of such a system controlling some of the(More)
This paper seeks to inform instructors responsible for designing introductory programming courses within a university setting. In particular, guidelines for choosing programming languages to be taught are presented. Information relevant to instructors of later programming courses is also presented. We ask the question: " are instructors of introductory(More)
In multiple sclerosis (MS) and other autoimmune diseases, the autoreactive T cells overcome the resistance provided by the regulatory T cells (Tregs) due to a decrease in the number of Foxp3-expressing Tregs. Therefore, upregulation and/or maintenance of Tregs during an autoimmune insult may have therapeutic efficacy in autoimmune diseases. Although several(More)
In previous work, action languages have predominantly been concerned with domains in which values are static unless changed by an action. Real domains, however, often contain values that are in constant change. In this paper we introduce an action language for modeling such hybrid domains called the process description language. We discuss the syntax and(More)
We introduce a new action language, CARD, which allows defeasible dynamic causal laws, default fluents, concurrent and non-deterministic actions, and actions which use resources. We give syntax and semantics of the language and several simple examples of its use. Comparison with some other languages is also given though limited by space requirements .