Proof Relevant Corecursive Resolution

Resolution lies at the foundation of both logic programming and type class context reduction in functional languages. Terminating derivations by resolution have well-defined inductive meaning, whereas some non-terminating derivations can be understood coinductively. Cycle detection is a popular method to capture a small subset of such derivations. We show that in fact cycle detection is a restricted form of coinductive proof, in which the atomic formula forming the cycle plays the role of coinductive hypothesis. This paper introduces a heuristic method for obtaining richer coinductive hypotheses in the form of Horn formulas. Our approach subsumes cycle detection and gives coinductive meaning to a larger class of derivations. For this purpose we extend resolution with Horn formula resolvents and corecursive evidence generation. We illustrate our method on non-terminating type class resolution problems.Comment: 23 pages, with appendices in FLOPS 201

A Systematic Review of Behavioural Interventions Promoting Healthy Eating among Older People.

Because eating habits are inseparably linked with people's physical health, effective behaviour interventions are highly demanded to promote healthy eating among older people. The aim of this systematic review was to identify effective diet interventions for older people and provide useful evidence and direction for further research. Three electronic bibliographic databases-PubMed, Scopus and Web of Science Core Collection were used to conduct a systematic literature search based on fixed inclusion and exclusion criteria. English language peer-reviewed journal articles published between 2011 and 2016 were selected for data extraction and quality assessment. Finally, a total of 16 studies were identified. The studies' duration ranged from three weeks to seven years. The majority of studies were carried out in European countries. Seven studies had a moderate quality while the remaining studies were at a less than moderate level. Three dietary educational interventions and all meal service related interventions reported improvements in older people's dietary variety, nutrition status, or other health-related eating behaviours. Multicomponent dietary interventions mainly contributed to the reduction of risk of chronic disease. The results supported that older people could achieve a better dietary quality if they make diet-related changes by receiving either dietary education or healthier meal service. Further high-quality studies are required to promote healthy eating among older people by taking regional diet patterns, advanced information technology, and nudging strategies into account

Quadratic Word Equations with Length Constraints, Counter Systems, and Presburger Arithmetic with Divisibility

Word equations are a crucial element in the theoretical foundation of constraint solving over strings, which have received a lot of attention in recent years. A word equation relates two words over string variables and constants. Its solution amounts to a function mapping variables to constant strings that equate the left and right hand sides of the equation. While the problem of solving word equations is decidable, the decidability of the problem of solving a word equation with a length constraint (i.e., a constraint relating the lengths of words in the word equation) has remained a long-standing open problem. In this paper, we focus on the subclass of quadratic word equations, i.e., in which each variable occurs at most twice. We first show that the length abstractions of solutions to quadratic word equations are in general not Presburger-definable. We then describe a class of counter systems with Presburger transition relations which capture the length abstraction of a quadratic word equation with regular constraints. We provide an encoding of the effect of a simple loop of the counter systems in the theory of existential Presburger Arithmetic with divisibility (PAD). Since PAD is decidable, we get a decision procedure for quadratic words equations with length constraints for which the associated counter system is \emph{flat} (i.e., all nodes belong to at most one cycle). We show a decidability result (in fact, also an NP algorithm with a PAD oracle) for a recently proposed NP-complete fragment of word equations called regular-oriented word equations, together with length constraints. Decidability holds when the constraints are additionally extended with regular constraints with a 1-weak control structure.Comment: 18 page

Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning with conditional equalities in superposition-based theorem proving. We show that subsumption demodulation is a simplification rule that does not require radical changes to the underlying superposition calculus. We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component. Our experiments, using the TPTP and SMT-LIB repositories, show that subsumption demodulation in Vampire can solve many new problems that could so far not be solved by state-of-the-art reasoners

Subsumption Demodulation in First-Order Theorem Proving

Motivated by applications of first-order theorem proving to software analysis, we introduce a new inference rule, called subsumption demodulation, to improve support for reasoning with conditional equalities in superposition-based theorem proving. We show that subsumption demodulation is a simplification rule that does not require radical changes to the underlying superposition calculus. We implemented subsumption demodulation in the theorem prover Vampire, by extending Vampire with a new clause index and adapting its multi-literal matching component. Our experiments, using the TPTP and SMT-LIB repositories, show that subsumption demodulation in Vampire can solve many new problems that could so far not be solved by state-of-the-art reasoners

On Solving Word Equations Using SAT

We present Woorpje, a string solver for bounded word equations (i.e., equations where the length of each variable is upper bounded by a given integer). Our algorithm works by reformulating the satisfiability of bounded word equations as a reachability problem for nondeterministic finite automata, and then carefully encoding this as a propositional satisfiability problem, which we then solve using the well-known Glucose SAT-solver. This approach has the advantage of allowing for the natural inclusion of additional linear length constraints. Our solver obtains reliable and competitive results and, remarkably, discovered several cases where state-of-the-art solvers exhibit a faulty behaviour

A decision procedure for satisfiability in separation logic with inductive predicates

We show that the satisfiability problem for the "symbolic heap" fragment of separation logic with general inductively defined predicates - which includes most fragments employed in program verification - is decidable. Our decision procedure is based on the computation of a certain fixed point from the definition of an inductive predicate, called its "base", that exactly characterises its satisfiability. A complexity analysis of our decision procedure shows that it runs, in the worst case, in exponential time. In fact, we show that the satisfiability problem for our inductive predicates is EXPTIME-complete, and becomes NP-complete when the maximum arity over all predicates is bounded by a constant. Finally, we provide an implementation of our decision procedure, and analyse its performance both on a synthetically generated set of test formulas, and on a second test set harvested from the separation logic literature. For the large majority of these test cases, our tool reports times in the low milliseconds

Introducing willingness-to-pay for noise changes into transport appraisal: an application of benefit transfer.

Numerous research studies have elicited willingness-to-pay values for transport-related noise, however, in many industrialised countries including the UK, noise costs and benefits are still not incorporated into appraisals for most transport projects and policy changes (Odgaard et al, 2005; Grant-Muller et al, 2001). This paper describes the actions recently taken in the UK to address this issue, comprising: primary research based on the city of Birmingham; an international review of willingness-to-pay evidence; development of values using benefit transfers over time and locations; and integration with appraisal methods. Amongst the main findings are: that the willingness-to-pay estimates derived for the UK are broadly comparable with those used in appraisal elsewhere in Europe; that there is a case for a lower threshold at 1 45dB(A)Leq,18hr1 rather than the more conventional 55dB(A); and that values per dB(A) increase with the noise level above this threshold. There are significant issues over the valuation of rail versus road noise, the neglect of non-residential noise and the valuation of high noise levels in different countries. Conclusions are drawn regarding the feasibility of noise valuation based on benefit transfers in the UK and elsewhere, and future research needs in this field are discussed