Logic Programming Applications: What Are the Abstractions and Implementations?

This article presents an overview of applications of logic programming, classifying them based on the abstractions and implementations of logic languages that support the applications. The three key abstractions are join, recursion, and constraint. Their essential implementations are for-loops, fixed points, and backtracking, respectively. The corresponding kinds of applications are database queries, inductive analysis, and combinatorial search, respectively. We also discuss language extensions and programming paradigms, summarize example application problems by application areas, and touch on example systems that support variants of the abstractions with different implementations

Causality, Human Action and Experimentation: Von Wright's Approach to Causation in Contemporary Perspective

This paper discusses von Wright's theory of causation from Explanation and Understanding and Causality and Determinism in contemporary context. I argue that there are two important common points that von Wright's view shares with the version of manipulability currently supported by Woodward: the analysis of causal relations in a system modelled on controlled experiments, and the explanation of manipulability through counterfactuals - with focus on the counterfactual account of unmanipulable causes. These points also mark von Wright's departure from previous action-based theories of causation. Owing to these two features, I argue that, upon classifying different versions of manipulability theories, von Wright's view should be placed closer to the interventionist approach than to the agency theory, where it currently stands. Furthermore, given its relevance in contemporary context, which this paper aims to establish, I claim that von Wright's theory can be employed to solve present problems connected to manipulability approaches to causation

Recurrence and transience for the frog model on trees

The frog model is a growing system of random walks where a particle is added whenever a new site is visited. A longstanding open question is how often the root is visited on the infinite $d$-ary tree. We prove the model undergoes a phase transition, finding it recurrent for $d=2$ and transient for $d\geq 5$. Simulations suggest strong recurrence for $d=2$, weak recurrence for $d=3$, and transience for $d\geq 4$. Additionally, we prove a 0-1 law for all $d$-ary trees, and we exhibit a graph on which a 0-1 law does not hold. To prove recurrence when $d=2$, we construct a recursive distributional equation for the number of visits to the root in a smaller process and show the unique solution must be infinity a.s. The proof of transience when $d=5$ relies on computer calculations for the transition probabilities of a large Markov chain. We also include the proof for $d \geq 6$, which uses similar techniques but does not require computer assistance.Comment: 24 pages, 8 figures to appear in Annals of Probabilit

Pressure-dependent EPANET extension

In water distribution systems (WDSs), the available flow at a demand node is dependent on the pressure at that node. When a network is lacking in pressure, not all consumer demands will be met in full. In this context, the assumption that all demands are fully satisfied regardless of the pressure in the system becomes unreasonable and represents the main limitation of the conventional demand driven analysis (DDA) approach to WDS modelling. A realistic depiction of the network performance can only be attained by considering demands to be pressure dependent. This paper presents an extension of the renowned DDA based hydraulic simulator EPANET 2 to incorporate pressure-dependent demands. This extension is termed “EPANET-PDX” (pressure-dependent extension) herein. The utilization of a continuous nodal pressure-flow function coupled with a line search and backtracking procedure greatly enhance the algorithm’s convergence rate and robustness. Simulations of real life networks consisting of multiple sources, pipes, valves and pumps were successfully executed and results are presented herein. Excellent modelling performance was achieved for analysing both normal and pressure deficient conditions of the WDSs. Detailed computational efficiency results of EPANET-PDX with reference to EPANET 2 are included as well

Divided we stand: Parallel distributed stack memory management

We present an overview of the stack-based memory management techniques that we used in our non-deterministic and-parallel Prolog systems: &-Prolog and DASWAM. We believe that the problems associated with non-deterministic and-parallel systems are more general than those encountered in or-parallel and deterministic and-parallel systems, which can be seen as subsets of this more general case. We develop on the previously proposed "marker scheme", lifting some of the restrictions associated with the selection of goals while keeping (virtual) memory consumption down. We also review some of the other problems associated with the stack-based management scheme, such as handling of forward and backward execution, cut, and roll-backs

Slow Mixing of Glauber Dynamics for the Six-Vertex Model in the Ordered Phases

The six-vertex model in statistical physics is a weighted generalization of the ice model on Z^2 (i.e., Eulerian orientations) and the zero-temperature three-state Potts model (i.e., proper three-colorings). The phase diagram of the model represents its physical properties and suggests where local Markov chains will be efficient. In this paper, we analyze the mixing time of Glauber dynamics for the six-vertex model in the ordered phases. Specifically, we show that for all Boltzmann weights in the ferroelectric phase, there exist boundary conditions such that local Markov chains require exponential time to converge to equilibrium. This is the first rigorous result bounding the mixing time of Glauber dynamics in the ferroelectric phase. Our analysis demonstrates a fundamental connection between correlated random walks and the dynamics of intersecting lattice path models (or routings). We analyze the Glauber dynamics for the six-vertex model with free boundary conditions in the antiferroelectric phase and significantly extend the region for which local Markov chains are known to be slow mixing. This result relies on a Peierls argument and novel properties of weighted non-backtracking walks