TY - JOUR A1 - Sarsakov, Vladimir A1 - Schaub, Torsten H. A1 - Tompits, Hans A1 - Woltran, Stefan T1 - A compiler for nested logic programming Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Linke, Thomas A1 - Tompits, Hans A1 - Woltran, Stefan T1 - On Acyclic and head-cycle free nested logic programs Y1 - 2004 SN - 3-540-22671-01 ER - TY - JOUR A1 - Linke, Thomas A1 - Tompits, Hans A1 - Woltran, Stefan T1 - On acyclic and head-cycle free nested logic programs Y1 - 2004 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans A1 - Woltran, Stefan T1 - On Computing belief change operations using quantifield boolean formulas N2 - In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change Y1 - 2004 SN - 0955-792X ER - TY - JOUR A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Graphs and cologings for answer set programming : adridged report Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Boesel, Andreas A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Profiling answer set programming : the visualization component of the noMoRe System Y1 - 2004 SN - 3-540-23242-7 ER - TY - JOUR A1 - Borchert, P. A1 - Anger, Christian A1 - Schaub, Torsten H. A1 - Truszczynski, M. T1 - Towards systematic benchmarking in answer set programming : the dagstuhl initiative Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Weske, Mathias A1 - van der Aalst, Wil M. P. A1 - Verbeek, H. M. W. T1 - Advances in business process management Y1 - 2004 SN - 0169-023X ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Two approaches to merging knowledge bases Y1 - 2004 SN - 3-540-23242-7 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - Domain-specific preference for causal reasoning and planning Y1 - 2004 SN - 1-577-35201-7 ER - TY - JOUR A1 - Flöter, André A1 - Selbig, Joachim A1 - Schaub, Torsten H. T1 - Finding metabolic pathways in decision forests Y1 - 2004 SN - 3-540-23221-4 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Consistency-based approaches to merging knowledge based : preliminary report Y1 - 2004 UR - http://www.pims.math.ca/science/2004/NMR/papers/paper17.pdf SN - 92-990021-0-X ER - TY - JOUR A1 - Nicolelis, Miguel Angelo L. A1 - Birbaumer, Niels A1 - Muller, K. R. T1 - Untitled Y1 - 2004 SN - 0018-9294 ER - TY - JOUR A1 - Bordihn, Henning T1 - Context-freeness of the power of context-free languages is undecidable N2 - The power of a language L is the set of all powers of the words in L. In this paper, the following decision problem is investigated. Given a context-free language L, is the power of L context-free? We show that this problem is decidable for languages over unary alphabets, but it is undecidable whenever languages over alphabets with at least two letters are considered. (C) 2003 Elsevier B.V. All rights reserved Y1 - 2004 SN - 0304-3975 ER - TY - JOUR A1 - Dornhege, Guido A1 - Blankertz, Benjamin A1 - Curio, Gabriel A1 - Müller, Klaus-Robert T1 - Boosting bit rates in noninvasive EEG single-trial classifications by feature combination and multiclass paradigms N2 - Noninvasive electroencephalogram (EEG) recordings provide for easy and safe access to human neocortical processes which can be exploited for a brain-computer interface (BCI). At present, however, the use of BCIs is severely limited by low bit-transfer rates. We systematically analyze and develop two recent concepts, both capable of enhancing the information gain from multichannel scalp EEG recordings: 1) the combination of classifiers, each specifically tailored for different physiological phenomena, e.g., slow cortical potential shifts, such as the premovement Bereitschaftspotential or differences in spatio-spectral distributions of brain activity (i.e., focal event-related desynchronizations) and 2) behavioral paradigms inducing the subjects to generate one out of several brain states (multiclass approach) which all bare a distinctive spatio-temporal signature well discriminable in the standard scalp EEG. We derive information-theoretic predictions and demonstrate their relevance in experimental data. We will show that a suitably arranged interaction between these concepts can significantly boost BCI performances Y1 - 2004 ER - TY - JOUR A1 - Blankertz, Benjamin A1 - Müller, Klaus-Robert A1 - Curio, Gabriel A1 - Vaughan, Theresa M. A1 - Schalk, Gerwin A1 - Wolpaw, Jonathan R. A1 - Schlogl, Alois A1 - Neuper, Christa A1 - Pfurtscheller, Gert A1 - Hinterberger, Thilo A1 - Schroder, Michael A1 - Birbaumer, Niels T1 - The BCI competition 2003 : Progress and perspectives in detection and discrimination of EEG single trials N2 - Interest in developing a new method of man-to-machine communication-a brain-computer interface (BCI)-has grown steadily over the past few decades. BCIs create a new communication channel between the brain and an output device by bypassing conventional motor output pathways of nerves and muscles. These systems use signals recorded from the scalp, the surface of the cortex, or from inside the brain to enable users to control a variety of applications including simple word-processing software and orthotics. BCI technology could therefore provide a new communication and control option for individuals who cannot otherwise express their wishes to the outside world. Signal processing and classification methods are essential tools in the development of improved BCI technology. We organized the BCI Competition 2003 to evaluate the current state of the art of these tools. Four laboratories well versed in EEG-based BCI research provided six data sets in a documented format. We made these data sets (i.e., labeled training sets and unlabeled test sets) and their descriptions available on the Internet. The goal in the competition was to maximize the performance measure for the test labels. Researchers worldwide tested their algorithms and competed for the best classification results. This paper describes the six data sets and the results and function of the most successful algorithms Y1 - 2004 SN - 0018-9294 ER - TY - JOUR A1 - Flöter, André A1 - Nicolas, Jacques A1 - Schaub, Torsten H. A1 - Selbig, Joachim T1 - Threshold extraction in metabolite concentration data N2 - Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states Y1 - 2004 ER - TY - JOUR A1 - Harmeling, Stefan A1 - Meinecke, Frank C. A1 - Müller, Klaus-Robert T1 - Injecting noise for analysing the stability of ICA components N2 - Usually, noise is considered to be destructive. We present a new method that constructively injects noise to assess the reliability and the grouping structure of empirical ICA component estimates. Our method can be viewed as a Monte-Carlo-style approximation of the curvature of some performance measure at the solution. Simulations show that the true root-mean-squared angle distances between the real sources and the source estimates can be approximated well by our method. In a toy experiment, we see that we are also able to reveal the underlying grouping structure of the extracted ICA components. Furthermore, an experiment with fetal ECG data demonstrates that our approach is useful for exploratory data analysis of real-world data. (C) 2003 Elsevier B.V. All rights reserved Y1 - 2004 SN - 0165-1684 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans A1 - Wang, Kewen T1 - A classification and survey of preference handling approchaches in nonmonotonic reasoning N2 - In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles Y1 - 2004 SN - 0824-7935 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Reasoning with sets of preferences in default logic N2 - We present a general approach for representing and reasoning with sets of defaults in default logic, focusing on reasoning about preferences among sets of defaults. First, we consider how to control the application of a set of defaults so that either all apply (if possible) or none do (if not). From this, an approach to dealing with preferences among sets of default rules is developed. We begin with an ordered default theory, consisting of a standard default theory, but with possible preferences on sets of rules. This theory is transformed into a second, standard default theory wherein the preferences are respected. The approach differs from other work, in that we obtain standard default theories and do not rely on prioritized versions of default logic. In practical terms this means we can immediately use existing default logic theorem provers for an implementation. Also, we directly generate just those extensions containing the most preferred applied rules; in contrast, most previous approaches generate all extensions, then select the most preferred. In a major application of the approach, we show how semimonotonic default theories can be encoded so that reasoning can be carried out at the object level. With this, we can reason about default extensions from within the framework of a standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension Y1 - 2004 SN - 0824-7935 ER -