Simion and Kelp explain the trustworthiness of an AI based on that AI’s disposition to meet its obligations. Roughly speaking, according to Simion and Kelp, an AI is trustworthy regarding its task if and only if that AI is obliged to complete the task and its disposition to complete the task is strong enough. Furthermore, an AI is obliged to complete a task in the case where the task is the AI’s etiological function or design function. This account has a (...) strength in that it can provide a unificatory rationale for the trustworthy-making properties of AIs. According to this account, being explainable, being safe, and being transparent are the trustworthy-making properties of an AI because an AI can fulfill its etiological or design functions in the case where it is explainable, safe, and transparent. This paper shows that though Simion and Kelp’s account has a strength, this account is not satisfactory for two reasons. The first reason is that an AI’s trustworthiness is not determined just by the AI’s disposition to meet obligations, and the second reason is that it is difficult to explain how an AI’s etiological function and design function have to do with that AI’s obligations. To provide a full-fledged account, Simion and Kelp should dismiss these concerns. (shrink)

While investigating the value of achievements, Dunkle claims that lucky achievements are possible. For instance, if a person does great works, then it is possible that the works have the status of achievements, even if luck plays a crucial role in doing the great works. Rather than examining Dunkle’s claim, this paper proceeds discussion under the assumption that lucky achievements are possible. In particular, based on this assumption, this paper suggests a new approach to the nature of achievement named the (...) Comparative Value Approach. According to the comparative value approach, a product can have the status of an achievement if the product is valuable in an achievement-relevant domain, and in that domain the product is valuable more than most other items which either have been achieved or can be achieved by others. This paper shows that the comparative value approach successfully explains the cases of achievements, including the cases of lucky achievements. Besides this reason, this paper provides three more reasons to show that the comparative value approach is a feasible view of achievements. The comparative value approach can accommodate the fact that there are various kinds of achievements; the approach can explain the relation between the nature of achievement and the achievement-value of a product; and the approach can show why in determining the status of a product it matters that for average people achieving a similar kind of product is sufficiently difficult. Based on these four reasons, this paper concludes that the comparative value approach is a plausible understanding of achievements. (shrink)

Some goals have special significance to agents. For instance, an agent could find her life worth living because she is pursuing her current goal, and the agent could also think that her previous life has no value because she did not pursue the current goal. If an agent’s current goal has special importance to the agent, then in terms of prudence the agent’s decision to obtain her current goal could be permissible even in the case where achieving her previous goal (...) brings out larger advantages. A widely endorsed thesis of prudence (i.e. the temporal neutrality thesis) does not successfully explain this phenomenon of goal achievement. Furthermore, the present-aim thesis and the harmony thesis also fail in explaining why an agent has prudential reason to prioritize her current goal. This paper introduces a new thesis of prudence, according to which an agent’s caring is significant in deciding whether the agent’s actions are prudentially permissible. In particular, after introducing this thesis named the care thesis, I argue that the care thesis can explain why an agent has reason to prioritize her current goal if the agent finds her life worth living due to her current goal. It is permissible that an agent obtains her current goal rather than previous goal because achieving her current goal benefits the agent’s cared one (i.e. the self who pursues her current goal). (shrink)

The redemption thesis assumes that how events in a person’s life are related to one another is important in evaluating the person’s welfare throughout life. In particular, according to this thesis of welfare, the fact that a person’s previous hardships contribute to bringing out the same person’s later successes, and the person would regard the hardships as having been worthwhile in light of the successes makes the person’s life better for the person herself. Recently, Ian D. Dunkle provided four objections (...) to the redemption thesis: the intuition concern, the different redemptions argument, the downplaying hardships argument, and the reconciled irreconcilables argument. This paper examines these four objections. In particular, this paper dismisses all the objections showing that the redemption thesis bases on an appealing idea, does not consider the degree of hardship significant in itself, has plausible reasons to evaluate hardships not as serious as people think, and can successfully reconcile its synchronic and diachronic evaluations. (shrink)

Amongst philosophers, there is ongoing debate about what successful event remembering requires. Causal theorists argue that it requires a causal connection to the past event. Simulation theorists argue, in contrast, that successful remembering requires only production by a reliable memory system. Both views must contend with the fact that people can remember past events they have experienced with varying degrees of accuracy. The debate between them thus concerns not only the account of successful remembering, but how each account explains the (...) various forms of memory error as well. Advancing the debate therefore must include exploration of the cognitive architecture implicated by each view and whether that architecture is capable of producing the range of event representations seen in human remembering. Our paper begins by exploring these architectures, framing casual theories as best suited to the storage of event instances and simulation theories as best suited to store schemas. While each approach has its advantages, neither can account for the full range of our event remembering abilities. We then propose a novel hybrid theory that combines both instance and schematic elements in the event memory. In addition, we provide an implementation of our theory in the context of a cognitive architecture. We also discuss an agent we developed using this system and its ability to remember events in the blocks world domain. (shrink)

The aim of this paper is to introduce Robert Brandom’s Inferentialism (Inferential theory of meaning) and Fodor and Lepore’ compositionality objection, and to protect Inferentialism from the objection based on compositionality. According to Inferentialism, To grasp or understand a concept is to have practical mastery over the inferences in which it is involved. However, Fodor and Lepore oppose Inferentialism by offering the compositionality objection. They argue that compositionality is needed to explain productivity, systematicity and learnability of language, meaning is compositional. (...) Since inferential role is not compositional, however, meaning is not an inferential role. Against Fodor and Lepore’s objection, I present Brandom’s responses and develop my own views. (shrink)

Forecasting blood glucose values for patients can help prevent hypoglycemia and hyperglycemia events in advance. To this end, this study proposes an intelligent ensemble deep learning system to predict BG values in 15, 30, and 60 min prediction horizons based on historical BG values collected via continuous glucose monitoring devices as an endogenous factor and carbohydrate intake and insulin administration information as exogenous factors. Although there are numerous deep learning algorithms available, this study applied five algorithms, namely, recurrent neural network, (...) which is optimized for sequence data, and RNN-based algorithms, stacked LSTM, bidirectional LSTM, and gated recurrent unit). Then, a genetic algorithm was applied to the five prediction models to optimize their weights through ensemble techniques and to yield the final predicted BG values. The performance of the proposed model was compared to that of the autoregressive integrated moving average model as a baseline. The results show that the proposed model significantly outperforms the baseline in terms of the root mean square error and continuous glucose error grid analysis. For the valid 29 diabetic patients for the multivariate models, the RMSE was 11.08, 19.25, and 31.30 mg/DL for 15, 30, and 60 min PH, respectively. When the same data were applied to univariate models, the RMSE was 11.28, 19.99, and 33.13 mg/DL for 15, 30, and 60 min PH, respectively. Both the univariate and multivariate models showed a statistically significant difference compared with the baseline at a 5% statistical significance level. Instead of using a model with a single algorithm, applying a GA based on each output of a model with multiple algorithms was found to play a significant role in improving model performance. (shrink)

This research examines how one’s construal level of a crisis differs by crisis type, and how the interplay of crisis type and apology appeal type impacts the effectiveness of apology messages in a corporate crisis context. Findings indicate that one’s mental construal toward a crisis varies by crisis type, with a self-threatening crisis leading to a lower level of construal than a society-threatening one. Findings further suggest that in a society-threatening crisis condition, an informational apology was more effective than an (...) emotional one. However, in a self-threatening crisis condition, there was no significant difference between two different message types. These findings offer valuable guidelines for developing effective crisis response strategy. (shrink)