Geography and computer ethics: An Eastern European perspective

Several context-specific social and political factors in Eastern and Central Europe are described — factors that must be considered while developing strategies to introduce Computer Ethics. Poland is used as a primary example. GNP per capita, the cost of hardware and software, uneven and scant distribution of computing resources, and attitudes toward work and authority are discussed. Such “geographical factors” must be taken into account as the new field of Computer Ethics develops.     

ExpTime Tableau Decision Procedures for Regular Grammar Logics with Converse

Grammar logics were introduced by Fariñas del Cerro and Penttonen in 1988 and have been widely studied. In this paper we consider regular grammar logics with converse (REG ^c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG ^c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG ^c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG ^c logics is coNP-complete.     

Annotation Theories over Finite Graphs

In the current paper we consider theories with vocabulary containing a number of binary and unary relation symbols. Binary relation symbols represent labeled edges of a graph and unary relations represent unique annotations of the graph’s nodes. Such theories, which we call annotation theories, can be used in many applications, including the formalization of argumentation, approximate reasoning, semantics of logic programs, graph coloring, etc. We address a number of problems related to annotation theories over finite models, including satisfiability, querying problem, specification of preferred models and model checking problem. We show that most of considered problems are NPTime- or co-NPTime-complete. In order to reduce the complexity for particular theories, we use second-order quantifier elimination. To our best knowledge none of existing methods works in the case of annotation theories. We then provide a new second-order quantifier elimination method for stratified theories, which is successful in the considered cases. The new result subsumes many other results, including those of [2, 28, 21].     

Socratic Trees

The method of Socratic proofs (SP-method) simulates the solving of logical problem by pure questioning. An outcome of an application of the SP-method is a sequence of questions, called a Socratic transformation. Our aim is to give a method of translation of Socratic transformations into trees. We address this issue both conceptually and by providing certain algorithms. We show that the trees which correspond to successful Socratic transformations—that is, to Socratic proofs—may be regarded, after a slight modification, as Gentzen-style proofs. Thus proof-search for some Gentzen-style calculi can be performed by means of the SP-method. At the same time the method seems promising as a foundation for automated deduction.     

Changes in processing of masked stimuli across early- and late-night sleep: a study on behavior and brain potentials

Sleep has proven to support the memory consolidation in many tasks including learning of perceptual skills. Explicit, conscious types of memory have been demonstrated to benefit particularly from slow-wave sleep (SWS), implicit, non-conscious types particularly from rapid eye movement (REM) sleep. By comparing the effects of early-night sleep, rich in SWS, and late-night sleep, rich in REM sleep, we aimed to separate the contribution of these two sleep stages in a metacontrast masking paradigm in which explicit and implicit aspects in perceptual learning could be assessed separately by stimulus identification and priming, respectively. We assumed that early sleep intervening between two sessions of task performance would specifically support stimulus identification, while late sleep would specifically support priming. Apart from overt behavior, event-related EEG potentials (ERPs) were measured to record the cortical mechanisms associated with behavioral changes across sleep. In contrast to our hypothesis, late-night sleep appeared to be more important for changes of behavior, both for stimulus identification, which tended to improve across late-night sleep, and for priming, with the increase of errors induced by masked stimuli correlating with the duration of REM sleep. ERP components proved sensitive to presence of target shapes in the masked stimuli and to their priming effects. Of these components, the N2 component, indicating processing of conflict, became larger across early-night sleep and was related to the duration of S4 sleep, the deepest substage of SWS containing particularly high portions of EEG slow waves. These findings suggest that sleep promotes perceptual learning primarily by its REM sleep portion, but indirectly also by way of improved action monitoring supported by deep slow-wave sleep.     

Is Easy Access Related to Better Life? Walkability and Overlapping of Personal and Communal Identity as Predictors of Quality of Life

Two studies (N?=?190 and N?=?447) were conducted to investigate the link between living in walkable neighborhoods and satisfaction with life in a city. Additionally, we explore possible mediators of this relationship. In both studies walkability was a significant predictor of perceived quality of life in a city, and overlap between personal and communal identity (in Study 1 and Study 2) and city identification (Study 2) were mediators of the walkability—quality of life relation. Implications for research on environmental qualities of neighborhoods and on self-concept and communal identity are discussed.