Time reasoning in the office environment

Time reasoning in the office environment

360 Abstracts R. Maiocchi and B. Pernici: Time Reasoning in the Office Environment, Dipartimento di Elettronica, Politecnico di Miiano, Oct. 1985. I...

121KB Sizes 7 Downloads 72 Views

360

Abstracts

R. Maiocchi and B. Pernici: Time Reasoning in the Office Environment, Dipartimento di Elettronica, Politecnico di Miiano, Oct. 1985. In the office environment temporal aspects are important to mark documents and to coordinate activities. The TSOS time model for office information systems provides the capability of specifying time aspects. Temporal specifications are organized in classes; then, with the time expert, it is possible to answer questions about temporal specification. The answers about time evolution of the office system are precise to the maximum possible extent. When only possible to give an approximate answer, this is done with the maximum level of precision that can be achieved. The proposed method for dealing with time specifications and the time expert for reasoning on time are general and can be applied not only to Office Information Systems, but also to Information Systems and Database Systems. Author's Abstract

William C. Mann and Sandra A. Thompson: Rhetorical Structure Theory: Description and Construction of text Structures, Information Sciences Institute, Marina del Rey, October 1986. Rhetorical Structure Theory (RST) is a theory of text structure that is being extended to serve as a theoretical basis for computational text planning. Text structure in RST are hierarchic, builts on small patterns called schemas. The schemas which compose the structural hierarchy of a text describe the functions of the parts rather than their form characteristics. Relations between text parts, comparable to conjunctive relations, are a prominent part of RST's definitional machinery. Recent work on RST has put it onto a new definitional basis. This paper describes the current status of descriptive RST, along with efforts to create a constructive version for use as a basis for programming a text planner. Authors' Abstract

William C. Mann and Sandra A. Thompson: Rhetorical Structure Theory: A Framework for the Analysis of Texts, Information Sciences Institute, Marina del Rey, 1987. Rhetorical Structure Theory is a theory of text organization which provides a framework for an analysis of text. The theory is based on the understanding that a test is not merely a string of clauses, but consists instead of hierarchically organized gro,,aps of clauses that stand in various relations to one another. There 'rhetorical relations' can be described functionally in terms of the purposes of the writer and the writer's assumptions about *,he reader. They hold between two adjacent parts of a text, where, typically, one part is 'nuclear' and one a 'satellite'. An analysis of a text consists in identifying the relations holding between successively larger parts of the text, yielding a natural hierarclfical description of the rhetorical organization of the text. The paper informally outlines RST's mechanisms and applications, which include studies of clause combining, coherence and assertional effects of discourse structure. RST characteristically provides comprehensive analyses rather than selective commentary. RST is insensitive to text size, and has been applied to a wide variety of sizes of text. Author's Abstract

Alexander Ollongren: On the Implementation of parts of Meta/IV in Lisp, Software Systems Research Center, Linkoeping Institute of Technology, April 1981. Meta-IV, the meta-language of the Vienna Development Method, has been designed as a supporting language for the formal definition of high-level programming languages and information processing systems. Its basic features are the use of abstract grammars to delimit universes of discourse and the use of (primitive) recursive functions. In the present paper we show that parts of Meta-lV can be implemented in LISP. In order to do so we first decide to use the set of so-called generalised multilevel arrays and two fundamental operations on them (selection and assignment) as the basic datatype. This implies at once that not full Meta-lv is considered but only that part of it