Late-season non-selective herbicide application reduces Lolium rigidum seed numbers, seed viability, and seedling fitness

Experiments were conducted to investigate the effect of Lolium rigidum (annual ryegrass) seed developmental stage and application rate of glyphosate and SpraySeed (paraquat 135 g/L+ diquat 115 g/L) on the number, germinability, and fitness of seeds produced. Glyphosate (450 g/L) was most effective when applied at a rate of 0.5-1 L/ha during heading and anthesis, reducing the number of filled seeds produced compared with unsprayed plants. Application post-anthesis, when seeds were at the milk to soft dough stage, was less effective. SpraySeed was most effective when applied post-anthesis, during the milk and early dough stages of seed development at a rate of 0.5-1L/ha, resulting in the production of few viable seeds. Although some filled seeds were produced, most of the seeds were dead. Application during anthesis or once the seeds reached soft dough stage was less effective. For both herbicides, those seeds that were capable of germinating were smaller and had slower radicle and coleoptile growth, resulting in slower early seedling growth and reduced biomass production within the first month of growth. Additionally, glyphosate application reduced the proportion of seeds exhibiting dormancy. The anticipated reduction in seed competitive ability and altered emergence timing resulting from late-season herbicide application, even when application timing is not optimal, could be exploited to reduce the likelihood of successful L. rigidum establishment in the following season.

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.