John Hawthorne in a recent paper takes issue with Lewisian accounts of counterfactuals, when relevant laws of nature are chancy. I respond to his arguments on behalf of the Lewisian, and conclude that while some can be rebutted, the case against the original Lewisian account is strong.I develop a neo-Lewisian account of what makes for closeness of worlds. I argue that my revised version avoids Hawthorne’s challenges. I argue that this is closer to the spirit of Lewis’s first (non-chancy) proposal (...) than is Lewis’s own suggested modification. (shrink)

Comparative overall similarity lies at the basis of a lot of recent metaphysics and epistemology. It is a poor foundation. Overall similarity is supposed to be an aggregate of similarities and differences in various respects. But there is no good way of combining them all.

If connectionism is to be an adequate theory of mind, we must have a theory of representation for neural networks that allows for individual differences in weighting and architecture while preserving sameness, or at least similarity, of content. In this paper we propose a procedure for measuring sameness of content of neural representations. We argue that the correct way to compare neural representations is through analysis of the distances between neural activations, and we present a method for doing so. (...) We then use the technique to demonstrate empirically that different artificial neural networks trained by backpropagation on the same categorization task, even with different representational encodings of the input patterns and different numbers of hidden units, reach states in which representations at the hidden units are similar. We discuss how this work provides a rebuttal to Fodor and Lepore's critique of Paul Churchland's state space semantics. (shrink)

Clustering plays an important role in data mining, pattern recognition, and machine learning. Single-valued neutrosophic sets are useful means to describe and handle indeterminate and inconsistent information that fuzzy sets and intuitionistic fuzzy sets cannot describe and deal with. To cluster the data represented by single-valued neutrosophic information, this article proposes single-valued neutrosophic clustering methods based on similarity measures between SVNSs. First, we define a generalized distance measure between SVNSs and propose two distance-based similarity measures of SVNSs. Then, (...) we present a clustering algorithm based on the similarity measures of SVNSs to cluster single-valued neutrosophic data. Finally, an illustrative example is given to demonstrate the application and effectiveness of the developed clustering methods. (shrink)

In the original publication of the article, the y axis labels present in Figs. 1a and 2a are incorrect. The correct Figs. 1a and 2a are provided here.

Previous work has shown that the Complex Conceptual Spaces − Single Observation Mathematical framework is a useful tool for event characterization. This mathematical framework is developed on the basis of Conceptual Spaces and uses integer linear programming to find the needed similarity values. The work of this paper is focused primarily on space event characterization. In particular, the focus is on the ranking of threats for malicious space events such as a kinetic kill. To make the Conceptual Spaces framework (...) work, the similarity values between the contents of observations on the one hand and the properties of the entities observed on the other needs to be found. This paper shows how to exploit Dempster-Shafer theory to implement a statistical approach for finding these similarities values. This approach will allow a user to identify the uncertainty involved in similarity value data, which can later be propagated through the developed mathematical model in order for the user to know the overall uncertainty in the observation-to-concept mappings needed for space event characterization. (shrink)

We propose and investigate an Analogy Principle in the context of Unary Inductive Logic based on a notion of support by structural similarity which is often employed to motivate scientific conjectures.

In this paper we ask whether approximation for abstract argumentation is useful in practice, and in particular whether reasoning with grounded semantics – which has polynomial runtime – is already an approximation approach sufficient for several practical purposes. While it is clear from theoretical results that reasoning with grounded semantics is different from, for example, skeptical reasoning with preferred semantics, we investigate how significant this difference is in actual argumentation frameworks. As it turns out, in many graphs models, reasoning with (...) grounded semantics actually approximates reasoning with other semantics almost perfectly. An algorithm for grounded reasoning is thus a conceptually simple approximation algorithm that not only does not need a learning phase – like recent approaches – but also approximates well – in practice – several decision problems associated to other semantics. (shrink)

We introduce crossed modules in cycloids, as a generalization of cycloids, which are algebraic logical structures arising in the context of the quantum Yang–Baxter equation. As a spacial case, we in particular focus on the crossed modules of $L-$algebras. These types of crossed modules are exceptional, since the category of $L-$algebras is not protomodular, nor Barr-exact, but it nevertheless has natural semidirect products that have not been described in category theoretic terms. We identify crossed ideals of crossed module in $L-$algebras, (...) and obtain some characteristics of these objects that are normally not encountered on crossed modules of groups or algebras. As a consequence, we characterize crossed self-similarity completely in terms of properties of $L-$algebras and the boundary map forming the crossed module. (shrink)

The literature contains a disconnect between accounts of how humans learn lexical semantic representations for words. Theories generally propose that lexical semantics are learned either through perceptual experience or through exposure to regularities in language. We propose here a model to integrate these two information sources. Specifically, the model uses the global structure of memory to exploit the redundancy between language and perception in order to generate inferred perceptual representations for words with which the model has no perceptual experience. We (...) test the model on a variety of different datasets from grounded cognition experiments and demonstrate that this diverse set of results can be explained as perceptual simulation (cf. Barsalou, Simmons, Barbey, & Wilson, 2003) within a global memory model. (shrink)