In Technology and the Lifeworld, Don Ihde advances what he calls “formalisms” for the ways in which we experience or relate to technology. In this article, I seek to clarify the grammar of Ihde’s formalisms. Ihde’s formalisms have not been the focus of scrutiny. Rather, they have largely been received in the literature as merely aphoristic or epigrammatical devices serving to clarify what can be explained in prose. My hypothesis is that Ihde’s formalisms do not merely serve an epigrammatical function (...) but rather admit of a generative grammar that extends his postphenomenological framework. I propose a notation that adheres to six rules of syntax that can be derived from Ihde’s framework. I show that the proposed notation makes explicit the inter-relations among hidden dimensions of human–technology relations. Relying on my notation, I also suggest that the so-called cyborg turn is actually a turn away from the unharnessed syntax of Ihde’s formalisms. (shrink)

It is well known that the computational complexity of propositional knowledge base revision is at the second level of polynomial hierarchy. A way to solve this kind of problems is to introduce approximate algorithms. In this paper, an approximate approach is introduced for belief change. Operators, which satisfy the AGM rational postulates, are defined to change belief sets or belief bases. Furthermore, approximate algorithms to implement the revision of finite belief bases are presented. The time complexities of the approximate algorithms (...) shown in this paper are at lower level than the time complexities of the existed approaches in literatures, although they may not generate the optimal solution, and this is meaningful from the theoretical point of view. (shrink)

In this paper we present some algorithms for computing minimal conflicts. First of all we discuss the relationship between minimal conflicts and minimally inconsistent subsets. Then we introduce an algorithm for computing all minimally inconsistent subsets, which is applied to generating all minimal conflicts. Furthermore, an algorithm for computing all minimal conflicts using structured description is introduced, and its correctness is proved; its time complexity is also shown. The algorithm using structured description terminates in polynomial time for some special system, (...) such as the tree–structured systems. The algorithms are also complared with related works. (shrink)

The original version of this article unfortunately contains an incorrect sentence.

This symposium highlighted the relevance of the cultural theory pioneered by anthropologists Mary Douglas, Steve Rayner, and Michael Thompson and political scientists Aaron Wildavsky and Richard Ellis for explaining political phenomena. In this concluding article, we suggest ways in which CT can be further tested and developed. First, we describe how the theory has been applied thus far and some of the achievements of these applications. Then, we examine some of the challenges revealed by this research. Finally, we discuss ways (...) of applying CT that promise to help meet these challenges. These methods include nesting case studies and combining case study and survey research, simulations, experiments, and approaches from social neuroscience. (shrink)