TY  - JOUR
A1  - Krasnova, Hanna
A1  - Veltri, Natasha F.
A1  - Spengler, Klaus
A1  - Günther, Oliver
T1  - "Deal of the Day" Platforms what drives Consumer loyalty?
JF  - Business & information systems engineering : the international journal of Wirtschaftsinformatik
N2  - "Deal of the Day" (DoD) platforms have quickly become popular by offering savings on local services, products and vacations. For merchants, these platforms represent a new marketing channel to advertise their products and services and attract new customers. DoD platform providers, however, struggle to maintaining a stable market share and profitability, because entry and switching costs are low. To sustain a competitive market position, DoD providers are looking for ways to build a loyal customer base. However, research examining the determinants of user loyalty in this novel context is scarce. To fill this gap, this study employs Grounded Theory methodology to develop a conceptual model of customer loyalty to a DoD provider. In the next step, qualitative insights are enriched and validated using quantitative data from a survey of 202 DoD users. The authors find that customer loyalty is in large part driven by monetary incentives, but can be eroded if impressions from merchant encounters are below expectations. In addition, enhancing the share of deals relevant for consumers, i.e. signal-to-noise ratio, and mitigating perceived risks of a transaction emerge as challenges. Beyond theoretical value, the results offer practical insights into how customer loyalty to a DoD provider can be promoted.
KW  - Deal of the Day
KW  - Loyalty
KW  - Grounded theory
KW  - Structural equation modeling
Y1  - 2013
U6  - https://doi.org/10.1007/s12599-013-0268-2
SN  - 1867-0202
VL  - 5
IS  - 3
SP  - 165
EP  - 177
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Brain, Martin
A1  - Gebser, Martin
A1  - Pührer, Jörg
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - "That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Jürgensen, Helmut
A1  - Konstantinidis, Stavros
T1  - (Near-)inverses of sequences
N2  - We introduce the notion of a near-inverse of a non-decreasing sequence of positive integers; near-inverses are intended to assume the role of inverses in cases when the latter cannot exist. We prove that the near-inverse of such a sequence is unique; moreover, the relation of being near-inverses of each other is symmetric, i.e. if sequence g is the near-inverse of sequence f, then f is the near-inverse of g. There is a connection, by approximations, between near- inverses of sequences and inverses of continuous strictly increasing real-valued functions which can be exploited to derive simple expressions for near-inverses
Y1  - 2006
UR  - http://www.informaworld.com/openurl?genre=journal&issn=0020-7160
U6  - https://doi.org/10.1080/00207160500537801
SN  - 0020-7160
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  - Wang, Kewen
T1  - A comparative study of disjunctive well-founded semantics
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A comparative study of logic programs with preference
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A comparative study of logic programs with preference
Y1  - 2001
SN  - 1-558-60777-3
SN  - 1045-0823
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A compilation of Brewka and Eiter's approach to prioritizationtion
Y1  - 2000
SN  - 3-540-41131-3
ER  - 
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  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A compiler for ordered logic programs
Y1  - 2000
UR  - http://arxiv.org/abs/cs.AI/0003024
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
T1  - A concictency-based paradigm for belief change
Y1  - 2003
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Brüning, Stefan
A1  - Schaub, Torsten H.
T1  - A connection calculus for handling incomplete information
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
T1  - A consistency-based framework for merging knowledge bases
Y1  - 2007
SN  - 1570-8683
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
T1  - A consistency-based model for belief change: preliminary report
Y1  - 2000
SN  - 0-262-51112-6
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
T1  - A consistency-based model for belief change: preliminary report
Y1  - 2000
UR  - http://xxx.lanl.gov/abs/cs.AI/0003052
ER  - 
TY  - JOUR
A1  - Besnard, Philippe
A1  - Schaub, Torsten H.
T1  - A context-based framework for default logics
Y1  - 1993
SN  - 0-262-51071-5
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A framework for compiling preferences in logic programs
Y1  - 2003
ER  - 
TY  - JOUR
A1  - Kreowsky, Philipp
A1  - Stabernack, Christian Benno
T1  - A full-featured FPGA-based pipelined architecture for SIFT extraction
JF  - IEEE access : practical research, open solutions / Institute of Electrical and Electronics Engineers
N2  - Image feature detection is a key task in computer vision. Scale Invariant Feature Transform (SIFT) is a prevalent and well known algorithm for robust feature detection. However, it is computationally demanding and software implementations are not applicable for real-time performance. In this paper, a versatile and pipelined hardware implementation is proposed, that is capable of computing keypoints and rotation invariant descriptors on-chip. All computations are performed in single precision floating-point format which makes it possible to implement the original algorithm with little alteration. Various rotation resolutions and filter kernel sizes are supported for images of any resolution up to ultra-high definition. For full high definition images, 84 fps can be processed. Ultra high definition images can be processed at 21 fps.
KW  - Field programmable gate arrays
KW  - Convolution
KW  - Signal processing
KW  - algorithms
KW  - Kernel
KW  - Image resolution
KW  - Histograms
KW  - Feature extraction
KW  - Scale-invariant feature transform (SIFT)
KW  - field-programmable gate array
KW  - (FPGA)
KW  - image processing
KW  - computer vision
KW  - parallel processing
KW  - architecture
KW  - real-time
KW  - hardware architecture
Y1  - 2021
U6  - https://doi.org/10.1109/ACCESS.2021.3104387
SN  - 2169-3536
VL  - 9
SP  - 128564
EP  - 128573
PB  - Inst. of Electr. and Electronics Engineers
CY  - New York, NY
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A general framework for expressing preferences in causal reasoning and planning
N2  - We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.
Y1  - 2007
UR  - http://logcom.oxfordjournals.org/
U6  - https://doi.org/10.1093/logcom/exm046
SN  - 0955-792X
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A generic compiler for ordered logic programs
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - A Glimpse of Answer Set Programming
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf
SN  - 0170-4516
ER  - 
TY  - JOUR
A1  - Tiwari, Abhishek
A1  - Prakash, Jyoti
A1  - Groß, Sascha
A1  - Hammer, Christian
T1  - A large scale analysis of Android
BT  - Web hybridization
JF  - The journal of systems and software
N2  - Many Android applications embed webpages via WebView components and execute JavaScript code within Android. Hybrid applications leverage dedicated APIs to load a resource and render it in a WebView. Furthermore, Android objects can be shared with the JavaScript world. However, bridging the interfaces of the Android and JavaScript world might also incur severe security threats: Potentially untrusted webpages and their JavaScript might interfere with the Android environment and its access to native features.
No general analysis is currently available to assess the implications of such hybrid apps bridging the two worlds. To understand the semantics and effects of hybrid apps, we perform a large-scale study on the usage of the hybridization APIs in the wild. We analyze and categorize the parameters to hybridization APIs for 7,500 randomly selected and the 196 most popular applications from the Google Playstore as well as 1000 malware samples. Our results advance the general understanding of hybrid applications, as well as implications for potential program analyses, and the current security situation: We discovered thousands of flows of sensitive data from Android to JavaScript, the vast majority of which could flow to potentially untrustworthy code. Our analysis identified numerous web pages embedding vulnerabilities, which we exemplarily exploited. Additionally, we discovered a multitude of applications in which potentially untrusted JavaScript code may interfere with (trusted) Android objects, both in benign and malign applications.
KW  - Android hybrid apps
KW  - static analysis
KW  - information flow control
Y1  - 2020
U6  - https://doi.org/10.1016/j.jss.2020.110775
SN  - 0164-1212
SN  - 1873-1228
VL  - 170
PB  - Elsevier
CY  - New York
ER  - 
TY  - JOUR
A1  - Hlawiczka, A.
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - A linear code-preserving signature analyzer COPMISR
Y1  - 1997
SN  - 0-8186-7810-0
ER  - 
TY  - JOUR
A1  - Arnold, Holger
T1  - A linearized DPLL calculus with learning
N2  - This paper describes the proof calculus LD for clausal propositional logic, which is a linearized form of the well-known DPLL calculus extended by clause learning. It is motivated by the demand to model how current SAT solvers built on clause learning are working, while abstracting from decision heuristics and implementation details. The calculus is proved sound and terminating. Further, it is shown that both the original DPLL calculus and the conflict-directed backtracking calculus with clause learning, as it is implemented in many current SAT solvers, are complete and proof-confluent instances of the LD calculus.
N2  - Dieser Artikel beschreibt den Beweiskalkül LD für aussagenlogische Formeln in Klauselform. Dieser Kalkül ist eine um Klausellernen erweiterte linearisierte Variante des bekannten DPLL-Kalküls. Er soll dazu dienen, das Verhalten von auf Klausellernen basierenden SAT-Beweisern zu modellieren, wobei von Entscheidungsheuristiken und Implementierungsdetails abstrahiert werden soll. Es werden Korrektheit und Terminierung des Kalküls bewiesen. Weiterhin wird gezeigt, dass sowohl der ursprüngliche DPLL-Kalkül als auch der konfliktgesteuerte Rücksetzalgorithmus mit Klausellernen, wie er in vielen aktuellen SAT-Beweisern implementiert ist, vollständige und beweiskonfluente Spezialisierungen des LD-Kalküls sind.
KW  - SAT
KW  - DPLL
KW  - Klausellernen
KW  - Automatisches Beweisen
KW  - SAT
KW  - DPLL
KW  - Clause Learning
KW  - Automated Theorem Proving
Y1  - 2007
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-15421
ER  - 
TY  - JOUR
A1  - Besnard, Philippe
A1  - Hunter, Anthony
T1  - A logic-based theory of deductive arguments
Y1  - 2001
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Saposhnikov, V. V.
A1  - Saposhnikov, Vl. V.
A1  - Gössel, Michael
A1  - Morosov, Andrej
T1  - A method of construction of combinational self-checking units with detection of all single faults
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Brüning, Stefan
A1  - Schaub, Torsten H.
T1  - A model-based approach to consistency-checking
Y1  - 1996
SN  - 3-540-61286-6
ER  - 
TY  - JOUR
A1  - Delgrande, James
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A model-theoretic approach to belief change in answer set programming
JF  - ACM transactions on computational logic
N2  - We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical interpretation is a model of a propositional formula. Hence we extend techniques from the area of belief revision based on distance between models to belief change in logic programs.
 We first consider belief revision: for logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P * Q. We investigate several operators, including (logic program) expansion and two revision operators based on the distance between the SE models of logic programs. It proves to be the case that expansion is an interesting operator in its own right, unlike in classical belief revision where it is relatively uninteresting. Expansion and revision are shown to satisfy a suite of interesting properties; in particular, our revision operators satisfy all or nearly all of the AGM postulates for revision.
 We next consider approaches for merging a set of logic programs, P-1,...,P-n. Again, our formal techniques are based on notions of relative distance between the SE models of the logic programs. Two approaches are examined. The first informally selects for each program P-i those models of P-i that vary the least from models of the other programs. The second approach informally selects those models of a program P-0 that are closest to the models of programs P-1,...,P-n. In this case, P-0 can be thought of as a set of database integrity constraints. We examine these operators with regards to how they satisfy relevant postulate sets.
 Last, we present encodings for computing the revision as well as the merging of logic programs within the same logic programming framework. This gives rise to a direct implementation of our approach in terms of off-the-shelf answer set solvers. These encodings also reflect the fact that our change operators do not increase the complexity of the base formalism.
KW  - Theory
KW  - Answer set programming
KW  - belief revision
KW  - belief merging
KW  - program encodings
KW  - strong equivalence
Y1  - 2013
U6  - https://doi.org/10.1145/2480759.2480766
SN  - 1529-3785
VL  - 14
IS  - 2
PB  - Association for Computing Machinery
CY  - New York
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A multi-mode scannable memory element for high test application efficiency and delay testing
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A multi-mode scannable memory element for high test application efficiency and delay testing
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Gohlke, Mario
T1  - A new approach for model-based recognition using colour regions
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Saposhnikov, V. V.
A1  - Morosov, Andrej
A1  - Saposhnikov, Vl. V.
A1  - Gössel, Michael
T1  - A new design method for self-checking unidirectional combinational circuits
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Richter, Peter
T1  - A new deterministic approach for the optimization of cable layouts for power supply systems
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Gössel, Michael
T1  - A new method of redundancy addition for circuit optimization
JF  - Preprint / Universität Potsdam, Institut für Informatik
Y1  - 1999
SN  - 0946-7580
VL  - 1999, 08
PB  - Univ.
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Gössel, Michael
T1  - A new parity preserving multi-input signature analyser
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - A new self-testing parity checker for ultra-reliable applications
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
A1  - Morosov, Andrej
T1  - A new totally error propagating compactor for arbitrary cores with digital interfaces
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Kawanabe, Motoaki
A1  - Blanchard, Gilles
A1  - Sugiyama, Masashi
A1  - Spokoiny, Vladimir G.
A1  - Müller, Klaus-Robert
T1  - A novel dimension reduction procedure for searching non-Gaussian subspaces
N2  - In this article, we consider high-dimensional data which contains a low-dimensional non-Gaussian structure contaminated with Gaussian noise and propose a new linear method to identify the non-Gaussian subspace. Our method NGCA (Non-Gaussian Component Analysis) is based on a very general semi-parametric framework and has a theoretical guarantee that the estimation error of finding the non-Gaussian components tends to zero at a parametric rate. NGCA can be used not only as preprocessing for ICA, but also for extracting and visualizing more general structures like clusters. A numerical study demonstrates the usefulness of our method
Y1  - 2006
UR  - http://www.springerlink.com/content/105633/
U6  - https://doi.org/10.1007/11679363_19
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Liang, Feng
A1  - Liu, Yunzhen
A1  - Liu, Hai
A1  - Ma, Shilong
A1  - Schnor, Bettina
T1  - A Parallel Job Execution Time Estimation Approach Based on User Submission Patterns within Computational Grids
JF  - International journal of parallel programming
N2  - Scheduling performance in computational grid can potentially benefit a lot from accurate execution time estimation for parallel jobs. Most existing approaches for the parallel job execution time estimation, however, require ample past job traces and the explicit correlations between the job execution time and the outer layout parameters such as the consumed processor numbers, the user-estimated execution time and the job ID, which are hard to obtain or reveal. This paper presents and evaluates a novel execution time estimation approach for parallel jobs, the user-behavior clustering for execution time estimation, which can give more accurate execution time estimation for parallel jobs through exploring the job similarity and revealing the user submission patterns. Experiment results show that compared to the state-of-art algorithms, our approach can improve the accuracy of the job execution time estimation up to 5.6 %, meanwhile the time that our approach spends on calculation can be reduced up to 3.8 %.
KW  - User submission pattern
KW  - Parallel job execution time estimation
KW  - Computational grid
Y1  - 2015
U6  - https://doi.org/10.1007/s10766-013-0294-1
SN  - 0885-7458
SN  - 1573-7640
VL  - 43
IS  - 3
SP  - 440
EP  - 454
PB  - Springer
CY  - New York
ER  - 
TY  - JOUR
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - A parity-preserving multi-input signature analyzer and it application for concurrent checking and BIST
Y1  - 1996
ER  - 
TY  - JOUR
A1  - Pearce, David
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A polynomial translation of logic programs with nested expressions into disjunctive logic programs
Y1  - 2002
SN  - 3-540-43930-7
ER  - 
TY  - JOUR
A1  - Pearce, David
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report
Y1  - 2002
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A preference-based framework for updating logic programs
Y1  - 2007
SN  - 978-3-540- 72199-4
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - A Preference-Based Framework for Updating logic Programs : preliminary reports
Y1  - 2006
UR  - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
ER  - 
TY  - JOUR
A1  - Börner, Ferdinand
T1  - A remark on the finite lattice representation problem
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Schöbel, Michael
T1  - A runtime environment for online processing of operating system kernel events
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Sogomonyan, Egor S.
A1  - Singh, Adit D.
A1  - Gössel, Michael
T1  - A scan based concrrent BIST approach for low cost on-line testing
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A semantic framework for prefernce handling in answer set programming
Y1  - 2003
ER  - 
TY  - JOUR
A1  - Goessel, Michael
A1  - Chakrabarty, Krishnendu
A1  - Ocheretnij, V.
A1  - Leininger, Andreas
T1  - A signature analysis technique for the identification of failing vectors with application to Scan-BIST
N2  - We present a new technique for uniquely identifying a single failing vector in an interval of test vectors. This technique is applicable to combinational circuits and for scan-BIST in sequential circuits with multiple scan chains. The proposed method relies on the linearity properties of the MISR and on the use of two test sequences, which are both applied to the circuit under test. The second test sequence is derived from the first in a straightforward manner and the same test pattern source is used for both test sequences. If an interval contains only a single failing vector, the algebraic analysis is guaranteed to identify it. We also show analytically that if an interval contains two failing vectors, the probability that this case is interpreted as one failing vector is very low. We present experimental results for the ISCAS benchmark circuits to demonstrate the use of the proposed method for identifying failing test vectors
Y1  - 2004
SN  - 0923-8174
ER  - 
TY  - JOUR
A1  - Besnard, Philippe
A1  - Schaub, Torsten H.
T1  - A simple signed system for paraconsistent reasoning
Y1  - 1996
SN  - 3-540-61630-6
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
A1  - Sogomonyan, Egor S.
T1  - A structural approach for space compaction for concurrent checking and BIST
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
T1  - A structural approach for space compaction for sequential circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Seuring, Markus
A1  - Gössel, Michael
T1  - A structural method for output compaction of sequential automata implemented as circuits
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Lucke, Ulrike
A1  - Rensing, Christoph
T1  - A survey on pervasive education
JF  - Pervasive and mobile computing
N2  - Researchers and developers worldwide have put their efforts into the design, development and use of information and communication technology to support teaching and learning. This research is driven by pedagogical as well as technological disciplines. The most challenging ideas are currently found in the application of mobile, ubiquitous, pervasive, contextualized and seamless technologies for education, which we shall refer to as pervasive education. This article provides a comprehensive overview of the existing work in this field and categorizes it with respect to educational settings. Using this approach, best practice solutions for certain educational settings and open questions for pervasive education are highlighted in order to inspire interested developers and educators. The work is assigned to different fields, identified by the main pervasive technologies used and the educational settings. Based on these assignments we identify areas within pervasive education that are currently disregarded or deemed challenging so that further research and development in these fields are stimulated in a trans-disciplinary approach. (C) 2013 Elsevier B.V. All rights reserved.
KW  - Pervasive learning
KW  - Ubiquitous learning
KW  - Mobile learning
KW  - Contextualized learning
KW  - Seamless learning
KW  - E-learning
KW  - E-teaching
KW  - Context awareness
KW  - Adaptivity
KW  - Personalization
KW  - Augmentation
Y1  - 2014
U6  - https://doi.org/10.1016/j.pmcj.2013.12.001
SN  - 1574-1192
SN  - 1873-1589
VL  - 14
SP  - 3
EP  - 16
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Anger, Christian
A1  - Konczak, Kathrin
A1  - Linke, Thomas
T1  - A system for non-monotonic reasoning under answer set semantics
Y1  - 2001
SN  - 3-540-42593-4
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - A top-down procedure for disjucntive well-founded semantics
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Wang, Kewen
T1  - A top-down procedure for disjucntive well-founded semantics
Y1  - 2001
SN  - 3-540-42254-4
ER  - 
TY  - JOUR
A1  - Ly, Ibrahim
A1  - Tarkhanov, Nikolai Nikolaevich
T1  - A variational approach to the Cauchy problem for nonlinear elliptic differential equations
N2  - We discuss the relaxation of a class of nonlinear elliptic Cauchy problems with data on a piece S of the boundary surface by means of a variational approach known in the optimal control literature as "equation error method". By the Cauchy problem is meant any boundary value problem for an unknown function y in a domain X with the property that the data on S, if combined with the differential equations in X, allow one to determine all derivatives of y on S by means of functional equations. In the case of real analytic data of the Cauchy problem, the existence of a local solution near S is guaranteed by the Cauchy-Kovalevskaya theorem. We also admit overdetermined elliptic systems, in which case the set of those Cauchy data on S for which the Cauchy problem is solvable is very "thin". For this reason we discuss a variational setting of the Cauchy problem which always possesses a generalised solution.
Y1  - 2009
UR  - http://dx.doi.org/10.1515/jiip
U6  - https://doi.org/10.1515/Jiip.2009.037
SN  - 0928-0219
ER  - 
TY  - JOUR
A1  - Brüning, Stefan
A1  - Schaub, Torsten H.
T1  - A voiding non-ground variables
Y1  - 1999
ER  - 
TY  - JOUR
A1  - Respondek, Tobias
T1  - A workflow for computing potential areas for wind turbines
JF  - Process design for natural scientists: an agile model-driven approach
N2  - This paper describes the implementation of a workflow model for service-oriented computing of potential areas for wind turbines in jABC. By implementing a re-executable model the manual effort of a multi-criteria site analysis can be reduced. The aim is to determine the shift of typical geoprocessing tools of geographic information systems (GIS) from the desktop to the web. The analysis is based on a vector data set and mainly uses web services of the “Center for Spatial Information Science and Systems” (CSISS). This paper discusses effort, benefits and problems associated with the use of the web services.
Y1  - 2014
SN  - 978-3-662-45005-5
IS  - 500
SP  - 200
EP  - 215
PB  - Springer
CY  - Berlin
ER  - 
TY  - JOUR
A1  - Schwill, Andreas
T1  - Ab wann kann man mit Indern Informatik machen? : eine Studie über informatische Fähigkeiten von Kindern
Y1  - 2001
UR  - http://www.informatica-didactica.de/Forschung/Schriften/INFOS2001Paderborn.pdf
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Vogel, Ralf
T1  - Abduction and Preferences in Linguistics
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Vogel, Ralf
T1  - Abduction and preferences in linguistics : Extended abstract
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Polyvyanyy, Artem
T1  - Abstraction of process specifications
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Fabian, Benjamin
A1  - Kunz, Steffen
A1  - Konnegen, Marcel
A1  - Müller, Sebastian
A1  - Günther, Oliver
T1  - Access control for semantic data federations in industrial product-lifecycle management
JF  - Computers in industry : an international, application oriented research journal
N2  - Information integration across company borders becomes increasingly important for the success of product lifecycle management in industry and complex supply chains. Semantic technologies are about to play a crucial role in this integrative process. However, cross-company data exchange requires mechanisms to enable fine-grained access control definition and enforcement, preventing unauthorized leakage of confidential data across company borders. Currently available semantic repositories are not sufficiently equipped to satisfy this important requirement. This paper presents an infrastructure for controlled sharing of semantic data between cooperating business partners. First, we motivate the need for access control in semantic data federations by a case study in the industrial service sector. Furthermore, we present an architecture for controlling access to semantic repositories that is based on our newly developed SemForce security service. Finally, we show the practical feasibility of this architecture by an implementation and several performance experiments.
KW  - Access control
KW  - Data federation
KW  - Information integration
KW  - Product lifecycle management
KW  - Semantic data
Y1  - 2012
U6  - https://doi.org/10.1016/j.compind.2012.08.015
SN  - 0166-3615
VL  - 63
IS  - 9
SP  - 930
EP  - 940
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Sawade, Christoph
A1  - Bickel, Steffen
A1  - von Oertzen, Timo
A1  - Scheffer, Tobias
A1  - Landwehr, Niels
T1  - Active evaluation of ranking functions based on graded relevance
JF  - Machine learning
N2  - Evaluating the quality of ranking functions is a core task in web search and other information retrieval domains. Because query distributions and item relevance change over time, ranking models often cannot be evaluated accurately on held-out training data. Instead, considerable effort is spent on manually labeling the relevance of query results for test queries in order to track ranking performance. We address the problem of estimating ranking performance as accurately as possible on a fixed labeling budget. Estimates are based on a set of most informative test queries selected by an active sampling distribution. Query labeling costs depend on the number of result items as well as item-specific attributes such as document length. We derive cost-optimal sampling distributions for the commonly used performance measures Discounted Cumulative Gain and Expected Reciprocal Rank. Experiments on web search engine data illustrate significant reductions in labeling costs.
KW  - Information retrieval
KW  - Ranking
KW  - Active evaluation
Y1  - 2013
U6  - https://doi.org/10.1007/s10994-013-5372-5
SN  - 0885-6125
VL  - 92
IS  - 1
SP  - 41
EP  - 64
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Luckow, Andre
A1  - Jha, Shantenu
A1  - Kim, Joohyun
A1  - Merzky, Andre
A1  - Schnor, Bettina
T1  - Adaptive distributed replica-exchange simulations
N2  - Owing to the loose coupling between replicas, the replica-exchange (RE) class of algorithms should be able to benefit greatly from using as many resources as available. However, the ability to effectively use multiple distributed resources to reduce the time to completion remains a challenge at many levels. Additionally, an implementation of a pleasingly distributed algorithm such as replica-exchange, which is independent of infrastructural details, does not exist. This paper proposes an extensible and scalable framework based on Simple API for Grid Applications that provides a general-purpose, opportunistic mechanism to effectively use multiple resources in an infrastructure-independent way. By analysing the requirements of the RE algorithm and the challenges of implementing it on real production systems, we propose a new abstraction (BIGJOB), which forms the basis of the adaptive redistribution and effective scheduling of replicas.
Y1  - 2009
UR  - http://rsta.royalsocietypublishing.org/
U6  - https://doi.org/10.1098/rsta.2009.0051
SN  - 1364-503X
ER  - 
TY  - JOUR
A1  - Kupries, Mario
T1  - ADE : An architecture type-based development environment for agent application systems
Y1  - 1999
UR  - http://www.agentlink.org/newsletter/
ER  - 
TY  - JOUR
A1  - Brewka, Gerhard
A1  - Ellmauthaler, Stefan
A1  - Kern-Isberner, Gabriele
A1  - Obermeier, Philipp
A1  - Ostrowski, Max
A1  - Romero, Javier
A1  - Schaub, Torsten H.
A1  - Schieweck, Steffen
T1  - Advanced solving technology for dynamic and reactive applications
JF  - Künstliche Intelligenz
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0538-8
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 199
EP  - 200
PB  - Springer
CY  - Heidelberg
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  - Hirschfeld, Robert
A1  - Steinert, Bastian
A1  - Lincke, Jens
T1  - Agile software development in virtual collaboration environments
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Wang, Kewen
A1  - Zhou, Lizhu
A1  - Lin, Fangzhen
T1  - Alternating fixpoint theory for logic programs with priority
Y1  - 2000
SN  - 3-540-67797-6
ER  - 
TY  - JOUR
A1  - Gebser, Martin
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Alternative foundations for Reiter's default logic.
Y1  - 2000
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Pablo Alarcon, Pedro
A1  - Arroyo, Fernando
A1  - Bordihn, Henning
A1  - Mitrana, Victor
A1  - Mueller, Mike
T1  - Ambiguity of the multiple interpretations on regular languages
JF  - Fundamenta informaticae
N2  - A multiple interpretation scheme is an ordered sequence of morphisms. The ordered multiple interpretation of a word is obtained by concatenating the images of that word in the given order of morphisms. The arbitrary multiple interpretation of a word is the semigroup generated by the images of that word. These interpretations are naturally extended to languages. Four types of ambiguity of multiple interpretation schemata on a language are defined: o-ambiguity, internal ambiguity, weakly external ambiguity and strongly external ambiguity. We investigate the problem of deciding whether a multiple interpretation scheme is ambiguous on regular languages.
KW  - Multiple interpretation scheme
KW  - regular language
KW  - o-ambiguity
KW  - internal ambiguity
KW  - external ambiguity
Y1  - 2015
U6  - https://doi.org/10.3233/FI-2015-1200
SN  - 0169-2968
SN  - 1875-8681
VL  - 138
IS  - 1-2
SP  - 85
EP  - 95
PB  - IOS Press
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Besnard, Philippe
A1  - Schaub, Torsten H.
T1  - An approach to context-based default reasoning
Y1  - 1995
SN  - 0169-2968
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.
Y1  - 1998
SN  - 3-540-65141-1
ER  - 
TY  - JOUR
A1  - Reinke, Thomas
A1  - Glöde, Dirk
A1  - Lauert, Alexander
A1  - Kupries, Mario
A1  - Horn, Erika
T1  - An architecture type-based development environment for agent application systems
Y1  - 1999
SN  - 3-9501023-0-2
ER  - 
TY  - JOUR
A1  - Onoda, T.
A1  - Rätsch, Gunnar
A1  - Müller, Klaus-Robert
T1  - An asymptotic analysis and improvement of AdaBoost in the binary classification case (in Japanese)
Y1  - 2000
ER  - 
TY  - JOUR
A1  - Lindauer, Marius
A1  - Hoos, Holger H.
A1  - Hutter, Frank
A1  - Schaub, Torsten H.
T1  - An automatically configured algorithm selector
JF  - The journal of artificial intelligence research
N2  - Algorithm selection (AS) techniques - which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently - have substantially improved the state of the art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others across all AS scenarios. Furthermore, these procedures have parameters whose optimal values vary across AS scenarios. This holds specifically for the machine learning techniques that form the core of current AS procedures, and for their hyperparameters. Therefore, to successfully apply AS to new problems, algorithms and benchmark sets, two questions need to be answered: (i) how to select an AS approach and (ii) how to set its parameters effectively. We address both of these problems simultaneously by using automated algorithm configuration. Specifically, we demonstrate that we can automatically configure claspfolio 2, which implements a large variety of different AS approaches and their respective parameters in a single, highly-parameterized algorithm framework. Our approach, dubbed AutoFolio, allows researchers and practitioners across a broad range of applications to exploit the combined power of many different AS methods. We demonstrate AutoFolio can significantly improve the performance of claspfolio 2 on 8 out of the 13 scenarios from the Algorithm Selection Library, leads to new state-of-the-art algorithm selectors for 7 of these scenarios, and matches state-of-the-art performance (statistically) on all other scenarios. Compared to the best single algorithm for each AS scenario, AutoFolio achieves average speedup factors between 1.3 and 15.4.
Y1  - 2015
SN  - 1076-9757
SN  - 1943-5037
VL  - 53
SP  - 745
EP  - 778
PB  - AI Access Foundation
CY  - Marina del Rey
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
T1  - An Extended Query language for action languages (and its application to aggregates and preferences)
Y1  - 2006
UR  - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
ER  - 
TY  - JOUR
A1  - Wang, Kewen
A1  - Zhou, Lizhu
T1  - An extension to GCWA and query evaluation for disjunctive deductive databases
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Nicolas, Pascal
T1  - An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation
Y1  - 1997
SN  - 3-540-63255-7
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Nicolas, Pascal
T1  - An implementation platform for query-answering in default logics : theoretical underpinnings
Y1  - 1997
SN  - 3-540-63614-5
ER  - 
TY  - JOUR
A1  - Gebser, Martin
A1  - Sabuncu, Orkunt
A1  - Schaub, Torsten H.
T1  - An incremental answer set programming based system for finite model computation
JF  - AI communications : AICOM ; the European journal on artificial intelligence
N2  - We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.
KW  - Incremental answer set programming
KW  - finite model computation
Y1  - 2011
U6  - https://doi.org/10.3233/AIC-2011-0496
SN  - 0921-7126
VL  - 24
IS  - 2
SP  - 195
EP  - 212
PB  - IOS Press
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Uflacker, Matthias
A1  - Kowark, Thomas
A1  - Zeier, Alexander
T1  - An instrument for real-time design interaction capture
Y1  - 2011
SN  - 978-3-642-13756-3
ER  - 
TY  - JOUR
A1  - Pascalau, Emilian
T1  - An overview on teh current approaches for building and executing mashups
Y1  - 2010
SN  - 978-3-86956-036-6
ER  - 
TY  - JOUR
A1  - Kiss, Gábor
T1  - Analyse der Studienleistungen von Studierenden an der Universität Óbuda und deren Implikationen für die Informatikausbildung
JF  - Commentarii informaticae didacticae : (CID)
N2  - In der letzten Jahren ist die Zahl der erfolgreichen Prüfungen von Studierenden im Informatikkurs des ersten Studienjahres für verschiedene Studiengänge an der Universität Óbuda stark gesunken. Dies betrifft Prüfungen in den Teilgebieten Rechnerarchitektur, Betrieb von Peripheriegeräten, Binäre Codierung und logische Operationen, Computerviren, Computernetze und das Internet, Steganographie und Kryptographie, Betriebsysteme. Mehr als der Hälfte der Studenten konnte die Prüfungen der ersten Semester nicht erfolgreich absolvieren. Die hier vorgelegte Analyse der Studienleistungen zielt darauf ab, Gründe für diese Entwicklung zu identifizieren, die Zahl der Abbrecher zu reduzieren und die Leistungen der Studenten zu verbessern. Die Analyse zeigt, dass die Studenten die erforderlichen Lehrmaterialen erst ein bis zwei Tage vor oder sogar erst am Tag der Klausuren vom Server downloaden, so dass sie nicht mehr hinreichend Zeit zum Lernen haben. Diese Tendenz zeigt sich bei allen Teilgebieten des Studiengangs. Ein Mangel an kontinuierlicher Mitarbeit scheint einer der Gründe für ein frühes Scheitern zu sein. Ferner zeigt sich die Notwendigkeit, dass bei den Lehrangeboten in Informatik auf eine kontinuierliche Kommunikation mit den Studierenden und Rückmeldung zu aktuellen Unterrichtsinhalten zu achten ist. Dies kann durch motivierende Maßnahmen zur Teilnahme an den Übungen oder durch kleine wöchentliche schriftliche Tests geschehen.
Y1  - 2010
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64364
SN  - 1868-0844
SN  - 2191-1940
IS  - 4
SP  - 71
EP  - 77
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Weicker, Nicole
A1  - Weicker, Karsten
T1  - Analyse des Kompetenzerwerbs im Softwarepraktikum
JF  - Commentarii informaticae didacticae : (CID)
N2  - Diese Arbeit enthält eine umfassende Analyse, wie der Kompetenzerwerb in einem einsemestrigen Softwarepraktikum vonstatten geht. Dabei steht neben der Frage, welche Kompetenzen besonders gut erworben wurden, der Einfluss von Vorwissen/-kompetenz im Mittelpunkt der Abhandlung. Auf dieser Basis werden einige grundlegende und konkrete Verbesserungsvorschläge erarbeitet, wie der breite Kompetenzerwerb begünstigt wird, d.h. möglichst viele Studierende sich in einem breiten Kompetenzspektrum weiterentwickeln.
KW  - Informatik
KW  - Ausbildung
KW  - Didaktik
KW  - Hochschuldidaktik
Y1  - 2009
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-29676
SN  - 1868-0844
SN  - 2191-1940
IS  - 1
SP  - 93
EP  - 104
ER  - 
TY  - JOUR
A1  - Montavon, Gregoire
A1  - Braun, Mikio L.
A1  - Krüger, Tammo
A1  - Müller, Klaus-Robert
T1  - Analyzing local structure in Kernel-Based learning
JF  - IEEE signal processing magazine
Y1  - 2013
U6  - https://doi.org/10.1109/MSP.2013.2249294
SN  - 1053-5888
VL  - 30
IS  - 4
SP  - 62
EP  - 74
PB  - Inst. of Electr. and Electronics Engineers
CY  - Piscataway
ER  - 
TY  - JOUR
A1  - Stoffel, Dominik
A1  - Kunz, Wolfgang
A1  - Gerber, Stefan
T1  - And/Or reasoning graphs for determining prime implicants in multi-level combinational networks
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Froitzheim, Manuel
A1  - Bergner, Nadine
A1  - Schroeder, Ulrik
ED  - Schwill, Andreas
T1  - Android-Workshop zur Vertiefung der Kenntnisse bezüglich Datenstrukturen und Programmierung in der Studieneingangsphase
JF  - HDI 2014 : Gestalten von Übergängen
N2  - Die Studieneingangsphase stellt für Studierende eine Schlüsselphase des tertiären Ausbildungsabschnitts dar. Fachwissenschaftliches Wissen wird praxisfern vermittelt und die Studierenden können die Zusammenhänge zwischen den Themenfeldern der verschiedenen Vorlesungen nicht erkennen. Zur Verbesserung der Situation wurde ein Workshop entwickelt, der die Verbindung der Programmierung und der Datenstrukturen vertieft. Dabei wird das Spiel Go-Moku1 als Android-App von den Studierenden selbständig entwickelt. Die Kombination aus Software (Java, Android-SDK) und Hardware (Tablet-Computer) für ein kleines realistisches Softwareprojekt stellt für die Studierenden eine neue Erfahrung dar.
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-80247
VL  - 2015
IS  - 9
SP  - 11
EP  - 26
ER  - 
TY  - JOUR
A1  - Längrich, Matthias
A1  - Schulze, Jörg
ED  - Schwill, Andreas
ED  - Schubert, Sigrid
T1  - Angewandte Output-Orientierung
JF  - HDI 2014 : Gestalten von Übergängen
N2  - Erstsemester-Studierende sind mit den Anforderungen des Lehr-/ Lernprozess einer Universität oder Fachhochschule noch nicht vertraut. Ihre Erwartungen orientieren sich vielmehr an ihrer bisherigen Lerngeschichte (Abitur, Fachabitur, o. ä.). Neben den fachlichen Anforderungen des ersten Semesters müssen die Studierenden also auch Veränderungen im Lehr-/Lernprozess erkennen und bewältigen. Es wird anhand einer Output-orientierten
informatischen Lehrveranstaltung aufgezeigt, dass sich aus deren strengen Anforderungen der Messbarkeit klare Kompetenzbeschreibungen ergeben, die besonders dem Orientierungsbedürfnis Erstsemester-Studierender entgegenkommen.
Y1  - 2015
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus4-80299
VL  - 2015
IS  - 9
SP  - 93
EP  - 107
ER  - 
TY  - JOUR
A1  - Tran, Son Cao
A1  - Pontelli, Enrico
A1  - Balduccini, Marcello
A1  - Schaub, Torsten
T1  - Answer set planning
BT  - a survey
JF  - Theory and practice of logic programming
N2  - Answer Set Planning refers to the use of Answer Set Programming (ASP) to compute plans, that is, solutions to planning problems, that transform a given state of the world to another state. The development of efficient and scalable answer set solvers has provided a significant boost to the development of ASP-based planning systems. This paper surveys the progress made during the last two and a half decades in the area of answer set planning, from its foundations to its use in challenging planning domains. The survey explores the advantages and disadvantages of answer set planning. It also discusses typical applications of answer set planning and presents a set of challenges for future research.
KW  - planning
KW  - knowledge representation and reasoning
KW  - logic programming
Y1  - 2022
U6  - https://doi.org/10.1017/S1471068422000072
SN  - 1471-0684
SN  - 1475-3081
PB  - Cambridge University Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Banbara, Mutsunori
A1  - Soh, Takehide
A1  - Tamura, Naoyuki
A1  - Inoue, Katsumi
A1  - Schaub, Torsten H.
T1  - Answer set programming as a modeling language for course timetabling
JF  - Theory and practice of logic programming
N2  - The course timetabling problem can be generally defined as the task of assigning a number of lectures to a limited set of timeslots and rooms, subject to a given set of hard and soft constraints. The modeling language for course timetabling is required to be expressive enough to specify a wide variety of soft constraints and objective functions. Furthermore, the resulting encoding is required to be extensible for capturing new constraints and for switching them between hard and soft, and to be flexible enough to deal with different formulations. In this paper, we propose to make effective use of ASP as a modeling language for course timetabling. We show that our ASP-based approach can naturally satisfy the above requirements, through an ASP encoding of the curriculum-based course timetabling problem proposed in the third track of the second international timetabling competition (ITC-2007). Our encoding is compact and human-readable, since each constraint is individually expressed by either one or two rules. Each hard constraint is expressed by using integrity constraints and aggregates of ASP. Each soft constraint S is expressed by rules in which the head is the form of penalty (S, V, C), and a violation V and its penalty cost C are detected and calculated respectively in the body. We carried out experiments on four different benchmark sets with five different formulations. We succeeded either in improving the bounds or producing the same bounds for many combinations of problem instances and formulations, compared with the previous best known bounds.
KW  - answer set programming
KW  - educational timetabling
KW  - course timetabling
Y1  - 2013
U6  - https://doi.org/10.1017/S1471068413000495
SN  - 1471-0684
VL  - 13
IS  - 2
SP  - 783
EP  - 798
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Answer set programming unleashed!
JF  - Künstliche Intelligenz
N2  - Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92–103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem’s specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP’s modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53–68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0550-z
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 105
EP  - 108
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Srinivasan, K.
A1  - Senthilkumar, D. V.
A1  - Mohamed, I. Raja
A1  - Murali, K.
A1  - Lakshmanan, M.
A1  - Kurths, Jürgen
T1  - Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay
JF  - Chaos : an interdisciplinary journal of nonlinear science
N2  - We construct a new RC phase shift network based Chua's circuit, which exhibits a period-doubling bifurcation route to chaos. Using coupled versions of such a phase-shift network based Chua's oscillators, we describe a new method for achieving complete synchronization (CS), approximate lag synchronization (LS), and approximate anticipating synchronization (AS) without delay or parameter mismatch. Employing the Pecora and Carroll approach, chaos synchronization is achieved in coupled chaotic oscillators, where the drive system variables control the response system. As a result, AS or LS or CS is demonstrated without using a variable delay line both experimentally and numerically.
Y1  - 2012
U6  - https://doi.org/10.1063/1.4711375
SN  - 1054-1500
VL  - 22
IS  - 2
PB  - American Institute of Physics
CY  - Melville
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
T1  - Antwortmengenprogrammierung
Y1  - 2003
ER  - 
TY  - JOUR
A1  - Holz, Jan
A1  - Berger, Nadine
A1  - Schroeder, Ulrike
T1  - Anwendungsorientierte Gestaltung eines Informatik-Vorkurses als Studienmotivator
JF  - Commentarii informaticae didacticae : (CID)
N2  - Zur Unterstützung von Studierenden in der Studieneingangsphase wurde an der RWTH Aachen ein neuartiger und motivierender Einstieg in den Vorkurs Informatik entwickelt und zum Wintersemester 2011/12 erprobt. Dabei wurde die grafische Programmierung mittels App Inventor eingeführt, die zur Umsetzung anwendungsbezogener Projekte genutzt wurde. In diesem Beitrag werden die Motivation für die Neugestaltung, das Konzept und die Evaluation des Testlaufs beschrieben. Diese dienen als Grundlage für eine vollständige Neukonzeption des Vorkurses für das Wintersemester 2012/2013.
Y1  - 2013
U6  - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:kobv:517-opus-64871
SN  - 1868-0844
SN  - 2191-1940
IS  - 5
SP  - 56
EP  - 66
PB  - Universitätsverlag Potsdam
CY  - Potsdam
ER  - 
TY  - JOUR
A1  - Steinert, Bastian
A1  - Hirschfeld, Robert
T1  - Applying design knowledge to programming
Y1  - 2012
ER  -