In this paper, illocutionary acts of commanding will be differentiated from perlocutionary acts that affect preferences of addressees in a new dynamic logic which combines the preference upgrade introduced in DEUL (dynamic epistemic upgrade logic) by van Benthem and Liu with the deontic update introduced in ECL II (eliminative command logic II) by Yamada. The resulting logic will incorporate J. L. Austin’s distinction between illocutionary acts as acts having mere conventional effects and perlocutionary acts as acts having real effects (...) upon attitudes and actions of agents, and help us understand why saying so can make it so in explicit performative utterances. We will also discuss how acts of commanding give rise to so-called “deontic dilemmas” and how we can accommodate most deontic dilemmas without triggering so-called “deontic explosion”. (shrink)

Although it seems intuitively clear that acts of requesting are different from acts of commanding, it is not very easy to sate their differences precisely in dynamic terms. In this paper we show that it becomes possible to characterize, at least partially, the effects of acts of requesting and compare them with the effects of acts of commanding by combining dynamified deontic logic with epistemic logic. One interesting result is the following: each act of requesting is appropriately differentiated from an (...) act of commanding with the same content, but for each act of requesting, there is another act of commanding with much more complex content which updates models in exactly the same way as it does. We will also consider an application of our characterization of acts of requesting to acts of asking yes-no questions. It yields a straightforward formalization of the view of acts of asking questions as requests for information. (shrink)

If the notion of speech acts is to be taken seriously, it must be possible to treat speech acts as acts. The development of systems of DEL (dynamic epistemic logic) in the last two decades suggests an interesting possibility. These systems are developed on the basis of static epistemic logics by introducing model updating operations to interpret various kinds of speech acts including public announcements as well as private information transmissions as what update epistemic states of agents involved. The methods (...) used in developing DEL can be used to develop logics that deal with a much wider variety of speech acts. For example, in ECL (Eliminative Command Logic) of Yamada (2007a) and ECL II of Yamada (2007b), similar model updating operations are introduced tointerpret acts of commanding as what update deontic aspects of the situations in which agents are involved. In Yamada (2008a), ECL II is further extended so as to model acts of promising along with acts of commanding. Moreover, in Yamada (2008b), ECL II is combined with a modified version of DEUL (dynamic epistemic upgrade logic) introduced in van Benthem & Liu (2007). In the resulting logic DDPL (dynamic deontic preference logic), illocutionary acts of commanding are differentiated from preference upgrading perlocutionary acts. The development of these logics suggests a recipe for developing logics that deal with various specific speech acts: first, carefully identify the aspects affected by the speech acts you want to study; second, find the modal logic that characterizes the aspects in question; and finally, add dynamic modalities that stand for the types of the speech acts being studied and define model updating operation that interprets these speech acts as what update the very aspects. (shrink)

SOCREAL 2007: International Workshop on Philosophy and Ethics of Social Reality. Sapporo, Japan, 2007-03-09/10. Session 2: Logical Dynamics of Social Interaction.

SOCREAL 2013 : 3rd International Workshop on Philosophy and Ethics of Social Reality 2013. Hokkaido University, Sapporo, Japan, 25-27 October 2013. Session 4 : Agency, Responsibility, and Intentionality.

SOCREAL 2010: 2nd International Workshop on Philosophy and Ethics of Social Reality. Sapporo, Japan, 2010-03-27/28. Keynote Lecture 3.

One prominent feature of belief is that a belief cannot be formed at will. This paper argues that the best explanation of this fact is that belief formation is a process that takes aim at the truth. Taking aim at the truth is to be understood as causal responsiveness of the processes constituting belief formation to what facilitates achieving true beliefs. The requirement for this responsiveness precludes the possibility of belief formation responding to intentions in a way that would count (...) as forming a belief at will. (shrink)

In this paper, we establish the first-order definability of sequents with consistent variable occurrence on bi-approximation semantics by means of the Sahlqvist–van Benthem algorithm. Then together with the canonicity results in Suzuki (2011), this allows us to establish a Sahlqvist theorem for substructural logic. Our result is not limited to substructural logic but is also easily applicable to other lattice-based logics.

In this paper, we extend the canonicity methodology in Ghilardi & Meloni (1997) to arbitrary lattice expansions, and syntactically describe canonical inequalities for lattice expansions consisting of -meet preserving operations, -multiplicative operations, adjoint pairs, and constants. This approach gives us a uniform account of canonicity for substructural and lattice-based logics. Our method not only covers existing results, but also systematically accounts for many canonical inequalities containing nonsmooth additive and multiplicative uniform operations. Furthermore, we compare our technique with the approach in (...) Dunn et al. (2005) and Gehrke et al. (2005). (shrink)

This paper describes an automatic monitoring system that constantly checks partial update in Web pages and notifies them to a user. While one of the most important advantages of the WWW is update of Web pages, we need to constantly check them out and this task takes much cognitive load. Thus applications to automatically check update of Web pages have been developed, however they can not deal with partial update like update in a particular cell in a table in a (...) Web page. Hence we developed a automatic monitoring system that checks such partial update. A user can give a system regions in which he/she wants to know the update in a Web page as training examples, and it is able to learn rules to identify the partial update by classification learning. By this learning, a user do not need to directly describe the rules. We implemented our system and some executed examples were presented. (shrink)

In this paper, we develop an organization method of page information agents for adaptive interface between a user and a Web search engine. Though a Web search engine indicates a hit list of Web pages to user’s query using a large database, they includes many useless ones. Thus a user has to select useful Web pages from them with page information indicated on the hit list, and actually fetch the Web page for investigating the relevance. Unfortunately, since the page information (...) on a hit list is neither sufficient nor necessary for a user, the adequate information is necessary for valid selection. However which information is adequate depends on a user and a task. Hence we propose adaptive interface AOAI in which different page information agents are organized through man-machine interaction. In AOAI, the page information agents indicating different page information on a hit list like the file-size, network traffic and a page title are prepared at first. A user evaluates them through searching with a search engine, and the agents are organized based on the evaluation. As results, different organizations are achieved depending on a user and a task. Finally we make experiments with subjects and find out AOAI is promising for adaptive interface between a user and a search engine. (shrink)

Developmental research suggests that young children tend to value dominant individuals over subordinates. This research, however, has nearly exclusively been carried out in Western cultures, and cross-cultural research among adults has revealed cultural differences in the valuing of dominance. In particular, it seems that Japanese culture, relative to many Western cultures, values dominance less. We conducted two experiments to test whether this difference would be observed in preschoolers. In Experiment 1, preschoolers in France and in Japan were asked to identify (...) with either a dominant or a subordinate. French preschoolers identified with the dominant, but Japanese preschoolers were at chance. Experiment 2 revealed that Japanese preschoolers were more likely to believe a subordinate than a dominant individual, both compared to chance and compared to previous findings among French preschoolers. The convergent results from both experiments thus reveal an early emerging cross-cultural difference in the valuing of dominance. (shrink)

In this paper, we give a possible characterization of the distributivity on bi-approximation semantics. To this end, we introduce new notions of special elements on polarities and show that the distributivity is first-order definable on bi-approximation semantics. In addition, we investigate the dual representation of those structures and compare them with bi-approximation semantics for intuitionistic logic. We also discuss that two different methods to validate the distributivity—by the splitters and by the adjointness—can be explicated with the help of the axiom (...) of choice as well. (shrink)

Prior's three-valued modal logic Q was developed as a philosophically interesting modal logic. Thus, we should be able to modify Q as a temporal logic. Although a temporal version of Q was suggested by Prior, the subject has not been fully explored in the literature. In this paper, we develop a three-valued temporal logic $Q_t $ and give its axiomatization and semantics. We also argue that $Q_t $ provides a smooth solution to the problem of future contingents.

This paper presents what the authors call the ‘divergence problem’ regarding choosing between different future possibilities. As is discussed in the first half, the central issue of the problem is the difficulty of temporally locating the ‘active cause’ on the modal divergent diagram. In the second half of this paper, we discuss the ‘second-person freedom’ which is, strictly, neither compatibilist negative freedom nor incompatibilist positive freedom. The divergence problem leads us to two hypothetical views (i.e. the view of single-line determination (...) and that of one-off chance), and these views bring humans closer to the afree side – i.e. outside of the contrast between being free and being unfree. The afree side is greatly different from the ordinary human side. This paper tries to secure the second-person freedom as a substitute for the ordinary human freedom while preventing the divergence problem from arising. (shrink)

Correct chromosome segregation in mitosis relies on chromosome biorientation, in which sister kinetochores attach to microtubules from opposite spindle poles prior to segregation. To establish biorientation, aberrant kinetochore–microtubule interactions must be resolved through the error correction process. During error correction, kinetochore–microtubule interactions are exchanged (swapped) if aberrant, but the exchange must stop when biorientation is established. In this article, we discuss recent findings in budding yeast, which have revealed fundamental molecular mechanisms promoting this “swap and stop” process for error correction. (...) Where relevant, we also compare the findings in budding yeast with mechanisms in higher eukaryotes. Evidence suggests that Aurora B kinase differentially regulates kinetochore attachments to the microtubule end and its lateral side and switches relative strength of the two kinetochore–microtubule attachment modes, which drives the exchange of kinetochore–microtubule interactions to resolve aberrant interactions. However, Aurora B kinase, recruited to centromeres and inner kinetochores, cannot reach its targets at kinetochore–microtubule interface when tension causes kinetochore stretching, which stops the kinetochore–microtubule exchange once biorientation is established. (shrink)

The number of competing-brands changes by new product's entry. The new product introduction is endemic among consumer packaged goods firm and is an integral component of their marketing strategy. As a new product's entry affects markets, there is a pressing need to develop market response model that can adapt to such changes. In this paper, we develop a dynamic model that capture the underlying evolution of the buying behavior associated with the new product. This extends an application of a dynamic (...) linear model, which is used by a number of time series analyses, by allowing the observed dimension to change at some point in time. Our model copes with a problem that dynamic environments entail: changes in parameter over time and changes in the observed dimension. We formulate the model with framework of a state space model. We realize an estimation of the model using modified Kalman filter/fixed interval smoother. We find that new product's entry (1) decreases brand differentiation for existing brands, as indicated by decreasing difference between cross-price elasticities; (2) decreases commodity power for existing brands, as indicated by decreasing trend; and (3) decreases the effect of discount for existing brands, as indicated by a decrease in the magnitude of own-brand price elasticities. The proposed framework is directly applicable to other fields in which the observed dimension might be change, such as economic, bioinformatics, and so forth. (shrink)

Since the realisation that the antigen‐binding regions of antibodies, the variable (V) regions, can be uncoupled from the rest of the molecule to create fragments that recognise and abrogate particular protein functions in cells, the use of antibody fragments inside cells has become an important tool in bioscience. Diverse libraries of antibody fragments plus in vivo screening can be used to isolate single chain variable fragments comprising VH and VL segments or single V‐region domains. Some of these are interfering antibody (...) fragments that compete with protein‐protein interactions, providing lead molecules for drug interactions that until now have been considered difficult or undruggable. It may be possible to deliver or express antibody fragments in target cells as macrodrugs per se. In future incarnations of intracellular antibodies, however, the structural information of the interaction interface of target and antibody fragment should facilitate development of binding site mimics as small drug‐like molecules. This is a new dawn for intracellular antibody fragments both as macrodrugs and as precursors of drugs to treat human diseases and should finally lead to the removal of the epithet of the ‘undruggable’ protein‐protein interactions. (shrink)

Anthropomorphic agents used in online-shopping need to be trusted by users so that users feel comfortable buying products. In this paper, we propose a model for designing trustworthy agents by assuming two factors of trust, that is, emotion and knowledgeableness perceived. Our hypothesis is that when a user feels happy and perceives an agent as being highly knowledgeable, a high level of trust results between the user and agent. We conducted four experiments with participants to verify this hypothesis by preparing (...) transition operators utilizing emotional contagion and knowledgeable utterances. As a result, we verified that users' internal states transitioned as expected and that the two factors significantly influenced their trust states. (shrink)

In the past four decades, the notion of quantum polynomial-time computability has been mathematically modeled by quantum Turing machines as well as quantum circuits. This paper seeks the third model, which is a quantum analogue of the schematic definition of recursive functions. For quantum functions mapping finite-dimensional Hilbert spaces to themselves, we present such a schematic definition, composed of a small set of initial quantum functions and a few construction rules that dictate how to build a new quantum function from (...) the existing ones. We prove that our schematic definition precisely characterizes all functions that can be computable with high success probabilities on well-formed quantum Turing machines in polynomial time, or equivalently uniform families of polynomial-size quantum circuits. Our new, schematic definition is quite simple and intuitive and, more importantly, it avoids the cumbersome introduction of the well-formedness condition imposed on a quantum Turing machine model as well as of the uniformity condition necessary for a quantum circuit model. Our new approach can further open a door to the descriptional complexity of quantum functions, to the theory of higher-type quantum functionals, to the development of new first-order theories for quantum computing, and to the designing of programming languages for real-life quantum computer. (shrink)

Two-player, zero-sum, non-cooperative, blindfold games in extensive form with incomplete information are considered in this paper. Any information about past moves which players played is stored in a database, and each player can access the database. A polynomial game is a game in which, at each step, all players withdraw at most a polynomial amount of previous information from the database. We show resource-bounded determinacy of some kinds of finite, zero-sum, polynomial games whose pay-off sets are computable by non-deterministic polynomial-time (...) function-oracle Turing machines. We call a pay-off set -determined if, for any polynomial game G associated with the given pay-off set, either player has a winning strategy which is in for any subgames of G. We show that there exists an FP-strongly-determined pay-off set which is computed by an exponential-time oracle Turing machine, where FP is the set of polynomial-time computable functions. We also discuss several relationships between the determinacy of polynomial games and recursion-theoretic properties for the classes co-NP and co-NEXP. We show that the polynomial version of the axiom of choice holds under some assumption of polynomial determinacy for a pay-off set which is polynomial-time computable with parallel queries. This principle of choice implies that co-NP has the separation property. (shrink)

劇的転換を求められている新たな生命倫理の案内書。従来、医療分野に集中しがちであった内容を生命科学全体とさらに関連する社会的緊急課題―環境・人口・難民・人種などにまで拡大、包括して最適任者が興趣ある解説 で応える。.

Today's computers are becoming ever more versatile. They are used in various applications, such as for education, entertainment, and information services. In other words, computers are often required to not only inform users of information but also communicate with them socially. Previous studies explored the design of ambient light displays and suggested that such systems can convey information to people in the periphery of their attention without distracting them from their primary work. However, they mainly focused on using ambient lights (...) to convey certain information. It is still unclear whether and how the lights can influence people's perception and decision-making. To explore this, we performed three experiments using a ping-pong game, Ultimatum game, and Give-Some game, in which we attached an LED strip to the front-bottom of a computer monitor and had it display a set of light expressions. Our evaluation of the results suggested that expressive lights do affect human perception and decision-making. Participants liked and anthropomorphized the computer more when it displayed light animations. Particularly, they perceived the computer as positive and friendlier when it displayed green and low intensity light animation, while red and high intensity light animation was perceived as negative and more hostile. They consequently behaved with more tolerance and cooperation to the computer when it was positive compared with when it was negative. The findings can open up possibilities for the design of ambient light systems for various applications where human-machine interaction is needed. (shrink)

This paper discusses a way to create social innovation around 2040. With such innovation, social restrictions that are regarded as being inevitable in the current society can be eliminated. First, it is necessary to determine how to approach the innovation. Symbiotic technology is one of the promising technologies for achieving social innovation. It is the fusion of scientific technology and socio-technology. Its elemental technologies are classified into two categories: technologies for converging the real and cyber worlds and those for integrating (...) hetero-systems. This paper describes examples of those technical categories and introduces the challenges of the first step toward social innovation. (shrink)