This is the sequel to my ‘‘Fifteen Arguments Against Finite Frequentism’’ (Erkenntnis 1997), the second half of a long paper that attacks the two main forms of frequentism about probability. Hypothetical frequentism asserts: The probability of an attribute A in a reference class B is p iff the limit of the relative frequency of A’s among the B’s would be p if there were an infinite sequence of ...

Hypothetical Datalog is based on an intuitionistic semantics rather than on a classical logic semantics, and embedded implications are allowed in rule bodies. While the usual implication (i.e., the neck of a Horn clause) stands for inferring facts, an embedded implication plays the role of assuming its premise for deriving its consequence. A former work introduced both a formal framework and a ...

The deployment of classification models is an integral component of many modern data mining and machine learning applications. A typical classification model is built with the tacit assumption that the deployment scenario by which it is evaluated is fixed and fully characterized. Yet, in the practical deployment of classification methods, important aspects of the application environment, such a...

In 2015 a team of nuclear physicists in Hungary reported an anomalous bump in the signal from radioactive decays of unstable beryllium-8, corresponding to a putative new particle with 34 times the mass of an electron (1). It was largely overlooked at the time, but a year later US theorists suggested that this might point to a new force felt by darkmatter, hinting that themysterious substance is...

This paper presents an efficient and reliable swarm intelligence-based approach, namely elitist-mutated particle swarm optimization EMPSO technique, to derive reservoir operation policies for multipurpose reservoir systems. Particle swarm optimizers are inherently distributed algorithms, in which the solution for a problem emerges from the interactions between many simple individuals called par...