Physical Activity, but Not Glycaemic Load, Is Associated with Lower Real-Time Glycaemic Control in Free-Living Women with Gestational Diabetes Mellitus

Maintaining blood glucose within the target range is the primary treatment goal for women with gestational diabetes mellitus (GDM). Foods with low glycaemic loads are recommended in clinical practice; however, the relative importance of other key lifestyle variables is unexplored. This pilot study explored the associations of glycaemic load, carbohydrates and physical activity parameters on blood glucose concentrations in free-living women with GDM. Twenty-nine women (28–30 weeks gestation, 34 ± 4 years) with GDM were enrolled. Continuous glucose monitoring, physical activity (ActivPAL inclinometer) and dietary intake and dietary quality were measured concurrently for 3 days. Pearson correlation analyses determined the association between glucose levels and lifestyle variables. Despite all receiving the same nutrition education, only 55% of women were following a low glycaemic load diet with a large range of carbohydrate intakes (97–267 g/day). However, the glycaemic load did not correlate with 3-hr postprandial glucose (r2 = 0.021, p = 0.56) or 24-h glucose iAUC (r2 = 0.021, p = 0.58). A significant relationship between total stepping time and lower 24-h glucose iAUC (r2 = 0.308, p = 0.02) and nocturnal glucose (r2 = 0.224, p = 0.05) was found. In free-living women with diet-controlled GDM, more physical activity, i.e., steps accumulated across the day, may be a simple and effective strategy for improving maternal blood glucose concentrations

Reasoning About Strong Inconsistency in ASP

International audienceThe last decade has witnessed remarkable improvements in the analysis of inconsistent formulas, namely in the case of Boolean Satisfiability (SAT) formulas. However, these successes have been restricted to monotonic logics. Recent work proposed the notion of strong inconsistency for a number of non-monotonic logics, including Answer Set Programming (ASP). This paper shows how algorithms for reasoning about inconsistency in monotonic logics can be extended to the case of ASP programs, in the concrete case of strong inconsistency. Initial experimental results illustrate the potential of the proposed approach

The fourth answer set programming competition: Preliminary report

Answer Set Programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language. \ua9 2013 Springer-Verlag