1428
2007
eng
article
0
2007-11-02
--
--
A linearized DPLL calculus with learning
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.
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.
urn:nbn:de:kobv:517-opus-15421
1542
Holger Arnold
deu
uncontrolled
SAT
deu
uncontrolled
DPLL
deu
uncontrolled
Klausellernen
deu
uncontrolled
Automatisches Beweisen
eng
uncontrolled
SAT
eng
uncontrolled
DPLL
eng
uncontrolled
Clause Learning
eng
uncontrolled
Automated Theorem Proving
Datenverarbeitung; Informatik
Classical propositional logic
Mechanization of proofs and logical operations [See also 68T15]
Theorem proving (deduction, resolution, etc.) [See also 03B35]
open_access
Institut für Informatik und Computational Science
Universität Potsdam
https://publishup.uni-potsdam.de/files/1428/arnold_aufsatz.pdf
11668
2006
2006
eng
article
1
--
--
--
On probing and multi-threading in platypus
http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
allegro:1991-2014
10102206
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 30 - 38
Jean Gressmann
Tomi Janhunen
Robert E. Mercer
Torsten Schaub
Sven Thiele
Richard Tichy
Institut für Informatik und Computational Science
Institut für Informatik
11640
2006
2006
eng
article
1
--
--
--
Modelling biological networks by action languages via set programming
http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf
10.1007/11799573
0302-9743
allegro:1991-2014
10102201
Lecture notes in computer science : logic programming : proceedings. - ISSN 0302-9743. - 4079 (2006), S. 285 - 299
Susanne Grell
Torsten Schaub
Joachim Selbig
Institut für Informatik und Computational Science
Institut für Informatik
11605
2006
2006
eng
article
1
--
--
--
A Preference-Based Framework for Updating logic Programs : preliminary reports
http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
allegro:1991-2014
10102208
ICLP'06 Workshop : Preferences and their applications in logic programming Systems, PREFS 2006, Seatle, August 16, 2006 ; Proceedings / Hrsg.: E. Pontelli ; T. C. Son. - New Mexico : Univ., 2006. - S. 31 - 44
James Patrick Delgrande
Torsten Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
11925
2006
2006
eng
article
1
--
--
--
Approaching the core of unfounded sets
http://www.cs.uni-potsdam.de/wv/pdfformat/angesc06a.pdf
allegro:1991-2014
10102203
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 58 - 66
Christian Anger
Martin Gebser
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
11957
2006
2006
eng
article
1
--
--
--
Towards adaptive classification for BCI
Non-stationarities are ubiquitous in EEG signals. They are especially apparent in the use of EEG-based brain- computer interfaces (BCIs): (a) in the differences between the initial calibration measurement and the online operation of a BCI, or (b) caused by changes in the subject's brain processes during an experiment (e.g. due to fatigue, change of task involvement, etc). In this paper, we quantify for the first time such systematic evidence of statistical differences in data recorded during offline and online sessions. Furthermore, we propose novel techniques of investigating and visualizing data distributions, which are particularly useful for the analysis of (non-) stationarities. Our study shows that the brain signals used for control can change substantially from the offline calibration sessions to online control, and also within a single session. In addition to this general characterization of the signals, we propose several adaptive classification schemes and study their performance on data recorded during online experiments. An encouraging result of our study is that surprisingly simple adaptive methods in combination with an offline feature selection scheme can significantly increase BCI performance
http://iopscience.iop.org/1741-2552/3/1/R02/
10.1088/1741-2560/3/1/R02
allegro:1991-2014
10102084
Journal of neural engineering. - 3 (2006), 1, S. R13 - R23
Pradeep Shenoy
Matthias Krauledat
Benjamin Blankertz
Rajesh P. N. Rao
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12100
2006
2006
eng
article
1
--
--
--
Enhancing the signal-to-noise ratio of ICA-based extracted ERPs
When decomposing single trial electroencephalography it is a challenge to incorporate prior physiological knowledge. Here, we develop a method that uses prior information about the phase-locking property of event-related potentials in a regularization framework to bias a blind source separation algorithm toward an improved separation of single-trial phase-locked responses in terms of an increased signal-to-noise ratio. In particular, we suggest a transformation of the data, using weighted average of the single trial and trial-averaged response, that redirects the focus of source separation methods onto the subspace of event-related potentials. The practical benefit with respect to an improved separation of such components from ongoing background activity and extraneous noise is first illustrated on artificial data and finally verified in a real-world application of extracting single-trial somatosensory evoked potentials from multichannel EEG-recordings
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=10
10.1109/Tbme.2006.870258
0018-9294
allegro:1991-2014
10102073
IEEE transactions on biomedical engineering. - ISSN 0018-9294. - 53 (2006), 4, S. 601 - 607
Steven Lemm
Gabriel Curio
Yevhen Hlushchuk
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12047
2009
2009
eng
article
1
--
--
--
Special issue on ReCoSoC 2007 : editorial
http://www.sciencedirect.com/science/journal/01419331
10.1016/j.micpro.2009.01.001
0141-9331
allegro:1991-2014
10107912
Microprocessors and microsystems. - ISSN 0141-9331. - 33 (2009), 1, S. 1
Christophe Bobda
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12051
2006
2006
eng
article
1
--
--
--
The Berlin brain-computer interface : EEG-based communication without subject training
The Berlin Brain-Computer Interface (BBCI) project develops a noninvasive BCI system whose key features are 1) the use of well-established motor competences as control paradigms, 2) high-dimensional features from 128-channel electroencephalogram (EEG), and 3) advanced machine learning techniques. As reported earlier, our experiments demonstrate that very high information transfer rates can be achieved using the readiness potential (RP) when predicting the laterality of upcoming left-versus right-hand movements in healthy subjects. A more recent study showed that the RP similarily accompanies phantom movements in arm amputees, but the signal strength decreases with longer loss of the limb. In a complementary approach, oscillatory features are used to discriminate imagined movements (left hand versus right hand versus foot). In a recent feedback study with six healthy subjects with no or very little experience with BCI control, three subjects achieved an information transfer rate above 35 bits per minute (bpm), and further two subjects above 24 and 15 bpm, while one subject could not achieve any BCI control. These results are encouraging for an EEG-based BCI system in untrained subjects that is independent of peripheral nervous system activity and does not rely on evoked potentials even when compared to results with very well-trained subjects operating other BCI systems
http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=7333
10.1109/Tnsre.2006.875557
1534-4320 - 14 (2006), 2, S
allegro:1991-2014
10102074
IEEE transactions on neural systems and rehabilitation engineering. - ISSN 1534-4320 - 14 (2006), 2, S. 147 - 152
Benjamin Blankertz
Guido Dornhege
Matthias Krauledat
Klaus-Robert Müller
Volker Kunzmann
Florian Losch
Gabriel Curio
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
12174
2006
2006
eng
article
1
--
--
--
Bioinformatics approach to predicting HIV drug resistance
The emergence of drug resistance remains one of the most challenging issues in the treatment of HIV-1 infection. The extreme replication dynamics of HIV facilitates its escape from the selective pressure exerted by the human immune system and by the applied combination drug therapy. This article reviews computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genotypic and phenotypic data. Genotypic assays are based on the analysis of mutations associated with reduced drug susceptibility, but are difficult to interpret due to the numerous mutations and mutational patterns that confer drug resistance. Phenotypic resistance or susceptibility can be experimentally evaluated by measuring the inhibition of the viral replication in cell culture assays. However, this procedure is expensive and time consuming
http://www.expert-reviews.com/loi/erm
10.1586/14737159.6.2.207
1473-7159
allegro:1991-2014
10102060
Expert review of molecular diagnostics. - ISSN 1473-7159. - 6 (2006), 2, S. 207 - 215
Frank Cordes
Rolf Kaiser
Joachim Selbig
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12217
2006
2006
eng
article
1
--
--
--
Weak order equivalence for Logic Programs with Prefernces
allegro:1991-2014
10102212
Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, Februar 22-24,2006 / Hrsg.: Michael Fink ; Hans Tompits ; Stefan Woltran. - Wien : TU, 2006. - (INFSYS Research Report ; 1843-06-02). - S. 154 - 163
Kathrin Konczak
Institut für Informatik und Computational Science
Institut für Informatik
12224
2006
2006
eng
article
1
--
--
--
Tableau calculi for answer set programming
http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf
10.1007/11799573
0302-9743
allegro:1991-2014
10102202
Lecture notes in computer science : logic programming : proceedings. - ISSN 0302-9743. - 4079 (2006), S. 11 - 25
Martin Gerbser
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12204
2006
2006
eng
article
1
--
--
--
Voting Theory in Answer Set Programming
allegro:1991-2014
10102213
Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, Februar 22-24,2006 / Hrsg.: Michael Fink ; Hans Tompits ; Stefan Woltran. - Wien : TU, 2006. - (INFSYS Research Report ; 1843-06-02). - S. 45 - 53
Kathrin Konczak
Institut für Informatik und Computational Science
Institut für Informatik
12186
2006
2006
eng
article
1
--
--
--
On probing and multi-threading in platypus
allegro:1991-2014
10102207
Proceedings of the 17th European Conference on Artifical Intelligence , ECAI 2006 / Hrsg.: Gerhard Brewka ; Silvia Coradeschi ; Anna Perini ; Paolo Traverso. - Riva del Garda : IOS Press, 2006. - S. 392 - 396
Jean Gressmann
Tomi Janhunen
Robert E. Mercer
Torsten Schaub
Sven Thiele
Richard Tichy
Institut für Informatik und Computational Science
Institut für Informatik
12210
2006
2006
eng
article
1
--
--
--
What's a head without a body?
allegro:1991-2014
10102186
Proceedings of the 17th European Conference on Artifical Intelligence , ECAI 2006 / Hrsg.: Gerhard Brewka ; Silvia Coradeschi ; Anna Perini ; Paolo Traverso. - Riva del Garda : IOS Press, 2006. - S. 769 - 770
Christian Anger
Martin Gebser
Tomi Janhunen
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12211
2006
2006
eng
article
1
--
--
--
Elementary sets for logic programs
978-1-57735-281-5
allegro:1991-2014
10102211
Proceedings of the twenty-first National Conference on Artificial Intelligence, (AAAI-06) : eighteenth Innovative Applicatons of artificial Intelligence Conference (IAAI-06), Boston Massachussets. - Menlo Park : AAAI Press, 2006. - ISBN 978-1-57735-281-5
Martin Gerbser
Joohyung Lee
Yuliya Lierler
Institut für Informatik und Computational Science
Institut für Informatik
12212
2006
2006
eng
article
1
--
--
--
Characterizing (ASP) inferences by unit propagation
allegro:1991-2014
10102210
Proceedings of the International Workshop on Search and Logic : answer set Programming and SAT (LaSh 2006) / Hrsg.: Enrico Giunchiglia ; Victor Marek ; David Mitchell ; Eugenia Ternovska. - Helsinki : Univ., 2006. - S. 41 - 56
Martin Gerbser
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12246
2006
2006
eng
article
1
--
--
--
The first 10 years of the ECCC digital library
http://portal.acm.org/cacm
10.1145/1107458.1107484
allegro:1991-2014
10102049
Communications of the acm. - 49 (2006), 1, S. 131 - 134
Christoph Meinel
Volker Klotz
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12294
2006
2006
eng
article
1
--
--
--
On the information and representation of non-Euclidean pairwise data
Two common data representations are mostly used in intelligent data analysis, namely the vectorial and the pairwise representation. Pairwise data which satisfy the restrictive conditions of Euclidean spaces can be faithfully translated into a Euclidean vectorial representation by embedding. Non-metric pairwise data with violations of symmetry, reflexivity or triangle inequality pose a substantial conceptual problem for pattern recognition since the amount of predictive structural information beyond what can be measured by embeddings is unclear. We show by systematic modeling of non-Euclidean pairwise data that there exists metric violations which can carry valuable problem specific information. Furthermore, Euclidean and non-metric data can be unified on the level of structural information contained in the data. Stable component analysis selects linear subspaces which are particularly insensitive to data fluctuations. Experimental results from different domains support our pattern recognition strategy.
http://www.sciencedirect.com/science/journal/00313203
10.1016/j.patcog.2006.04.016
0031-3203
allegro:1991-2014
10102123
Pattern recognition. - ISSN 0031-3203. - 39 (2006), 10, S. 1815 - 1826
Julian Laub
Volker Roth
Joachim Buhmann
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12242
2006
2006
eng
article
1
--
--
--
Conformance testing: Measuring the fit and appropriateness of event logs and process models
Most information systems log events (e.g., transaction logs, audit traits) to audit and monitor the processes they support. At the same time, many of these processes have been explicitly modeled. For example, SAP R/3 logs events in transaction logs and there are EPCs (Event-driven Process Chains) describing the so-called reference models. These reference models describe how the system should be used. The coexistence of event logs and process models raises an interesting question: "Does the event log conform to the process model and vice versa?". This paper demonstrates that there is not a simple answer to this question. To tackle the problem, we distinguish two dimensions of conformance: fitness (the event log may be the result of the process modeled) and appropriateness (the model is a likely candidate from a structural and behavioral point of view). Different metrics have been defined and a Conformance Checker has been implemented within the ProM Framework
allegro:1991-2014
10102042
Business process management workshops lecture notes in Computer science. - 3812 (2006), S. 163 - 176
A Rozinat
Wil M. P. Van der Aalst
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12263
2006
2006
eng
article
1
--
--
--
Results of bit error measurements with sensor nodes and casuistic consequences for design of energy-efficient error control schemes
For the proper design of energy-efficient error control schemes some insight into channel error patterns is needed. This paper presents bit error and packet loss measurements taken with sensor nodes running the popular RFM
978-3-540-32158-3
allegro:1991-2014
10102151
Wireless sensor networks : Third europena Workshop, ewsn 2006, Zurich, Switzerland, Februar 13 - 15, 2006, proceedings / Hrsg.: Kay Römer ; Holger Karl ; Friedmann Mattern. Heidelberg : Springer, 2006. - (Lecture Notes in Computer Science ; 3868). - ISBN 978-3-540-32158-3. - S. 310 - 325
Andreas Willig
Robert Mitschke
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12328
2006
2006
eng
article
1
--
--
--
COBA 2.0 : a consistency-based belief change system
http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
allegro:1991-2014
10102204
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 267 - 273
James Patrick Delgrande
Daphne H. Liu
Torsten Schaub
Sven Thiele
Institut für Informatik und Computational Science
Institut für Informatik
12329
2006
2006
eng
article
1
--
--
--
An Extended Query language for action languages (and its application to aggregates and preferences)
http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
allegro:1991-2014
10102205
Proceedings of the 11th Workshop on Nonmonotonic Reasoning, NMR 2006, 30 May to 1 Juni 2006, Lakes District, England / Hrsg.: Jürgen Dix ; Anthony Hunter. - Clausthal : Univ., 2006. - (Ifl Technical Report Series ; ifl-06- 04). - S. 362 - 370
James Patrick Delgrande
Torsten Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
12330
2006
2006
eng
article
1
--
--
--
Extending ordered disjunctions for policy enforcement : preliminary report
http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
allegro:1991-2014
10102209
ICLP'06 Workshop : Preferences and their applications in logic programming Systems, PREFS 2006, Seatle, August 16, 2006 ; Proceedings / Hrsg.: E. Pontelli ; T. C. Son. - New Mexico : Univ., 2006. - S. 45 - 59
Alessandra Mileo
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12379
2006
2006
eng
article
1
--
--
--
Migol : a Fault Tolerant Service Framework for Grid Computing : Evolution to WSRF (2006)
allegro:1991-2014
10102435
Mitteilungen / GI, Gesellschaft für Informatik e.V., Parallel-Algorithmen, -Rechnerstrukturen und - Systemsoftware (PARS). - 23 (2006), S. 190 - 197
André Luckow
Bettina Schnor
Institut für Informatik und Computational Science
Institut für Informatik
12381
2006
2006
eng
article
1
--
--
--
Grid Security for Fault Tolerant Grid Applications
978-1-880843-60-4
allegro:1991-2014
10102436
Parallel and Distributed Computing and Systems (PDCS-2006), ISCA 19th International Conference on Parallel and Distributed Computing Systems, September 20-11, 2006 / Hrsg.: Peterson, Gregory D. - San Francisco, California, USA : ISCA, 2006. - ISBN 978-1-880843-60-4. - S. 76 - 83
Nicole Hallama
André Luckow
Bettina Schnor
Institut für Informatik und Computational Science
Institut für Informatik
12322
2006
2006
eng
article
1
--
--
--
Building content clusters based on modelling page pairs
We give a new view on building content clusters from page pair models. We measure the heuristic importance within every two pages by computing the distance of their accessed positions in usage sessions. We also compare our page pair models with the classical pair models used in information theories and natural language processing, and give different evaluation methods to build the reasonable content communities. And we finally interpret the advantages and disadvantages of our models from detailed experiment results
http://www.springerlink.com/content/105633/
10.1007/11610113_85
0302
allegro:1991-2014
10102181
Lecture Notes in Computer Science. - ISSN 0302. - 3841 (2006), S. 856 - 861
Christoph Meinel
Long Wang
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12324
2006
2006
eng
article
1
--
--
--
A novel dimension reduction procedure for searching non-Gaussian subspaces
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
http://www.springerlink.com/content/105633/
10.1007/11679363_19
0302-9743
allegro:1991-2014
10102182
Lecture notes in computer science : independent component analysis and blind signal separation : proceedings. - ISSN 0302-9743. - 3889 (2006), S. 149 - 156
Motoaki Kawanabe
Gilles Blanchard
Masashi Sugiyama
Vladimir G. Spokoiny
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12373
2006
2006
eng
article
1
--
--
--
Business process management
0169-023X
allegro:1991-2014
10102580
Data & Knowledge Engineering. - ISSN 0169-023X. - 56 (2006), 1, S. 1 - 3
Barbara Pernici
Mathias Weske
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12362
2006
2006
eng
article
1
--
--
--
Loaded: Server Load Balancing for IPv6
With the next generation Internet protocol IPv6 at the horizon, it is time to think about how applications can migrate to IPv6. Web traffic is currently one of the most important applications in the Internet. The increasing popularity of dynamically generated content on the World Wide Web, has created the need for fast web servers. Server clustering together with server load balancing has emerged as a promising technique to build scalable web servers. The paper gives a short overview over the new features of IPv6 and different server load balancing technologies. Further, we present and evaluate Loaded, an user-space server load balancer for IPv4 and IPv6 based on Linux.
0-7695-2622-5
allegro:1991-2014
10102437
International Conference on Networking and Services (ICNS'06) : Proceedings. - Los Alamitos, CA, USA : IEEE Computer Society, 2006. - ISBN 0-7695-2622-5. - S. 8
Sven Friedrich
Sebastian Krahmer
Lars Schneidenbach
Bettina Schnor
Institut für Informatik und Computational Science
Institut für Informatik
12420
2007
2007
eng
article
1
--
--
--
A preference-based framework for updating logic programs
978-3-540- 72199-4
allegro:1991-2014
10105916
Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) / Hrsg.: C. Baral ; G. Brewka ; J. Schlipf. - Heidelberg [u.a.] : Springer, 2007. - ISBN 978-3-540- 72199-4. - S. 71 - 83
James Patrick Delgrande
Torsten Schaub
Hans Tompits
Institut für Informatik und Computational Science
Institut für Informatik
12464
2007
2007
eng
article
1
--
--
--
Qualitative constraint enforcement in advanced policy specification
allegro:1991-2014
10105908
Proceedings of the Ninth European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU'07) / Hrsg.: K. Mellouli. - Heidelberg [u.a.] : Springer, 2007. - S. 695 - 706
Alessandra Mileo
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12466
2007
2007
eng
article
1
--
--
--
Belief change based on global minimisation
allegro:1991-2014
10105904
Proceedings of the Twentieth International Conference on Artificial Intelligence (IJCAI'07) / Hrsg.: M. Veloso. - Menlo Park : AAAI Press/MIT Press, 2007. - S. 2468 - 2473
James Patrick Delgrande
Jérôme Lang
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
12482
2007
2007
eng
article
1
--
--
--
GrinGo : a new grounder for answer set programming
978-3-540- 72199-4
allegro:1991-2014
10105924
Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) / Hrsg.: C. Baral ; G. Brewka ; J. Schlipf. - Heidelberg [u.a.] : Springer, 2007. - ISBN 978-3-540- 72199-4. - S. 266 - 271
Martin Gebser
Torsten Schaub
Sven Thiele
Institut für Informatik und Computational Science
Institut für Informatik
12501
2006
2006
eng
article
1
--
--
--
Graphs and colorings for answer set programming
We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics
http://www.cs.kuleuven.ac.be/~dtai/projects/ALP//TPLP/
10.1017/S1471068405002528
1471-0684
allegro:1991-2014
10101724
Theory and practice of logic programming. ISSN 1471-0684. - 6 (2006), 1-2, S. 61 - 106
Kathrin Konczak
Thomas Linke
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12688
2005
2005
eng
article
1
--
--
--
Migration of MPI Applications to IPv6 Networks
0-88986-468-3
allegro:1991-2014
10097050
IASTED International Conference on Parallel and Distributed Computing and Networks Conference (PDCN 2005), Innsbruck, Austria, February 15 - 17, 2005. - ISBN 0-88986-468-3. - S. 172 - 176
Lars Schneidenbach
Bettina Schnor
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
12845
2005
2005
eng
article
1
--
--
--
The nomore++ approach to answer set solving
http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf
allegro:1991-2014
10100808
Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05), / ed. G. Sutcliffe and A. Voronkov. - Springer, 2005 - (Lecture Notes in Computer Science ; 3835). - S. 95 - 109
Christian Anger
Martin Gebser
Thomas Linke
Andre Neumann
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
12877
2005
2005
deu
33 S.
2005, 2
article
Univ.
Potsdam
1
--
--
--
Assoziationen in Softwarearchitekturen
Preprint / Universität Potsdam, Institut für Informatik
0946-7580
allegro:1991-2014
10099373
Sebastian Häger
Wolfgang Schubert
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
12904
2005
2005
eng
article
1
--
--
--
Explicit formulation of the solution of Hamada-Leray-Wagschal's theorem
In this paper, an explicit formula of the solution of Hainada-Leray-Wagschal's theorem is given. For this, only structure's theorem of finite dimensional determination's function and linear algebra technics developped in [1] are used
0034-5318
allegro:1991-2014
10103259
Publications of the Research Institute for Mathematical Sciences. - ISSN 0034-5318. - 41 (2005), 2, S. 417 - 433
Renaud Camales
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13157
2005
2005
eng
article
1
--
--
--
Abduction and Preferences in Linguistics
http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05a.pdf
allegro:1991-2014
10100810
Answer Set Programming : Advances in Theory and Implementation (ASP'05). - 2005. - S. 263 - 276
Kathrin Konczak
Ralf Vogel
Institut für Informatik und Computational Science
Institut für Informatik
13270
2005
2005
eng
article
1
--
--
--
Voting procedures with incomplete preferences
http://koala.ilog.fr/wiki/pub/Preference05/WsProceedings/Pref05.pdf
allegro:1991-2014
10100809
Multidisciplinary IJCAI-05 Workshop on Advances in Preference Handling / Romen Brafman and Ulrich Junker (organizers). - Edinburgh, 2005. - S. 124 - 129
Kathrin Konczak
Jerome Lang
Institut für Informatik und Computational Science
Nicht referiert
Institut für Informatik
13271
2005
2005
eng
article
1
--
--
--
Abduction and preferences in linguistics : Extended abstract
http://www.cs.uni-potsdam.de/~konczak/Papers/konvog05b.pdf
0302-9743
allegro:1991-2014
10100812
Lecture notes in artificial intelligence / logic programming and nonmonotonic reasonong. - ISSN 0302-9743. - 3662 (2005), S- 384 - 388
Kathrin Konczak
Ralf Vogel
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13272
2005
2005
eng
article
1
--
--
--
Platypus : a platform for distributed answer set solving
http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.pdf
allegro:1991-2014
10100815
Lecture Notes in Artificial Intelligence. Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2005). - 3662 (2005), S. 227 - 239
Jean Gressmann
Tomi Janhunen
Robert E. Mercer
Torsten Schaub
Sven Thiele
Richard Tichy
Institut für Informatik und Computational Science
Institut für Informatik
13273
2005
2005
eng
article
1
--
--
--
The nomore++ approach to answer set solving
http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf
allegro:1991-2014
10100817
Proceedings of the Twelfth International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'05). (2005), S. 95 - 109
Christian Anger
Martin Gebser
Thomas Linke
Andre Neumann
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
13274
2005
2005
eng
article
1
--
--
--
nomore) : a system for computing preferred Answer Sets
0302-9743
allegro:1991-2014
10100813
Lecture notes in artificial intelligence / logic programming and nonmonotonic reasonong. - ISSN 0302-9743. - 3662 (2005), S. 394 - 398
Susanne Grell
Kathrin Konczak
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13275
2005
2005
eng
article
1
--
--
--
Strong Equivalence for Logic Programs with Preferences
http://www.cs.uni-potsdam.de/~konczak/Papers/fabkon05a.pdf
allegro:1991-2014
10100814
Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), - (2005). - S. 430 - 435
Wolfgang Faber
Kathrin Konczak
Institut für Informatik und Computational Science
Nicht ermittelbar
Institut für Informatik
13276
2005
2005
eng
article
1
--
--
--
A Glimpse of Answer Set Programming
http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf
0170-4516
allegro:1991-2014
10100818
Künstliche Intelligenz. - ISSN 0170-4516. - 19 (2005), 1, S. 12 - 17
Christian Anger
Kathrin Konczak
Thomas Linke
Torsten Schaub
Institut für Informatik und Computational Science
Institut für Informatik
13407
2005
2005
eng
article
1
--
--
--
Checking combinational circuits by the method of logic complement
Design of fully self-testing combinational circuits was considered. A theorem defining the conditions for guaranteed logic complement-based design of fully self-testing circuit was proved. Examples were presented
0005-1179
allegro:1991-2014
10103377
Automation and Remote Control. - ISSN 0005-1179. - 66 (2005), 8, S. 1336 - 1346
Michael Goessel
A. V. Morozov
V. V. Sapozhnikov
Vl. V. Sapozhaikov
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13481
2005
2005
eng
article
1
--
--
--
Privacy Requirements for Embedded Sensor Devices
This paper analyses data privacy issues as they arise from different deployment scenarios for networks that use embedded sensor devices. Maintaining data privacy in pervasive environments requires the management and implementation of privacy protection measures close to the data source. We propose a set of atomic privacy parameters that is generic enough to form specific privacy classes and might be applied directly at the embedded sensor device.
978-3-800729-09-8
allegro:1991-2014
10102430
PIMRC 2005 : the 16th Annual IEEE International Symposium on Personal Indoor and Mobile Radio Communications, Berlin, Germany, September 11 - 14, 2005 / Berlin : VDE, 2005. - CD-ROM. - (VOL. 2). - ISBN 978-3-800729-09-8. - S. 790 - 794
Thomas Scheffler
Bettina Schnor
Institut für Informatik und Computational Science
Institut für Informatik
13544
2005
2005
eng
article
1
--
--
--
Is complexity a source of incompleteness?
In this paper we prove Chaitin's "heuristic principle," the theorems of a finitely-specified theory cannot be significantly more complex than the theory itself, for an appropriate measure of complexity. We show that the measure is invariant under the change of the Godel numbering. For this measure, the theorems of a finitely-specified, sound, consistent theory strong enough to formalize arithmetic which is arithmetically sound (like Zermelo-Fraenkel set theory with choice or Peano Arithmetic) have bounded complexity, hence every sentence of the theory which is significantly more complex than the theory is unprovable. Previous results showing that incompleteness is not accidental, but ubiquitous are here reinforced in probabilistic terms: the probability that a true sentence of length n is provable in the theory tends to zero when n tends to infinity, while the probability that a sentence of length n is true is strictly positive. (c) 2004 Elsevier Inc. All rights reserved
0196-8858
allegro:1991-2014
10103258
Advances in Applied Mathematics. - ISSN 0196-8858. - 35 (2005), 1, S. 1 - 15
C. S. Calude
Helmut Jurgensen
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13558
2005
2005
eng
article
1
--
--
--
Expressing default logic variants in default logic
Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant interpretation into a second default theory, under the original Reiter semantics, wherein the variant interpretation is respected. That is, in each case we show that, given an extension of a translated theory, one may extract an extension of the original variant default logic theory. We show how constrained, rational, justified, and cumulative default logic can be expressed in Reiter's default logic. As well, we show how Reiter's default logic can be expressed in rational default logic. From this, we suggest that any such variant can be similarly treated. Consequently, we provide a unification of default logics, showing how the original formulation of default logic may express its variants. Moreover, the translations clearly express the relationships between alternative approaches to default logic. The translations themselves are shown to generally have good properties. Thus, in at least a theoretical sense, we show that these variants are in a sense superfluous, in that for any of these variants of default logic, we can exactly mimic the behaviour of a variant in standard default logic. As well, the translations lend insight into means of classifying the expressive power of default logic variants; specifically we suggest that the property of semi-monotonicity represents a division with respect to expressibility, whereas regularity and cumulativity do not
0955-792X
allegro:1991-2014
10103278
Journal of Logic and Computation. - ISSN 0955-792X. - 15 (2005), 5, S. 593-621
James Patrick Delgrande
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13567
2005
2005
eng
article
1
--
--
--
Geospatial digital rights management in geovisualization
Geovisualization offers powerful tools, techniques, and strategies to present, explore, analyze, and manage geoinformation. Interactive geovirtual environments such as virtual 3D maps or virtual 3D city models, however, raise the question how to control geodata usage and distribution. We present a concept for embedding digital rights in geovisualizations. It is based on geo-documents, an object-oriented scheme to specify a wide range of geo visualizations. Geo-documents are assembled by building blocks categorized into presentation, structure, interaction, animation, and Digital Rights Management (DRM) classes. DRM objects allow for defining permissions and constraints for all objects contained in geo-documents. In this way, authors of geo visualizations can control how their geo-documents are used, personalized, and redistributed by users. The strengths of the presented concept include the ability to integrate heterogeneous 2D and 3D geodata within a compact design scheme and the ability to cope with privacy, security, and copyright issues. Embedded digital rights in geovisualizations can be applied to improve the usability of geodata user interfaces, to implement publisher-subscriber communication systems for geodata, and to establish business models for geodata trading systems
0008-7041
allegro:1991-2014
10103289
Cartographic Journal. - ISSN 0008-7041. - 42 (2005), 1, S. 27 - 34
Jürgen Döllner
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13530
2005
2005
eng
article
1
--
--
--
Micropolitical innovation arenas as a tool for analyzing innovation processes in the context of electronic government
E-Government requires technical and organizational innovation. Research has already shown that the respective innovation process is complex and contingent upon specific organizational structures. Managing such innovation processes successfully is difficult. Drawing on assumptions of micropolitical behavior, a framework of innovation arenas is proposed. It supports the analysis of ongoing E-Government projects as well as the ex post investigation of successful or failed projects. Testing this framework in case studies already demonstrates its usefulness for individual actors making strategic choices about change management. Furthermore, the results indicate that many commonly held assumptions about successful change management have to be reconsidered
0937-6429
allegro:1991-2014
10103252
Wirtschaftsinformatik. - ISSN 0937-6429. - 47 (2005), 5, S. 347 - 355
M. Bruggemeier
A. Dovifat
D. Kubisch
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13533
2005
2005
eng
article
1
--
--
--
Representation of semiautomata by canonical words and equivalences
We study a novel representation of semiautomata, which is motivated by the method of trace-assertion specifications of software modules. Each state of the semiautomaton is represented by an arbitrary word leading to that state, the canonical word. The transitions of the semiautomaton give rise to a right congruence, the state-equivalence, on the set of input words of the semiautomaton: two words are state-equivalent if and only if they lead to the same state. We present a simple algorithm for finding a set of generators for state-equivalence. Directly from this set of generators, we construct a confluent prefix-rewriting system which permits us to transform any word to its canonical representative. In general, the rewriting system may allow infinite derivations. To address this issue, we impose the condition of prefix-continuity on the set of canonical words. A set is prefix-continuous if, whenever a word w and a prefix u of w axe in the set, then all the prefixes of w longer than u are also in the set. Prefix-continuous sets include prefix-free and prefix-closed sets as special cases. We prove that the rewriting system is Noetherian if and only if the set of canonical words is prefix-continuous. Furthermore, if the set of canonical words is prefix- continuous, then the set of rewriting rules is irredundant. We show that each prefix-continuous canonical set corresponds to a spanning forest of the semiautomaton
0129-0541
allegro:1991-2014
10103253
International Journal of Foundations of Computer Science. - ISSN 0129-0541. - 16 (2005), 5, S. 831 - 850
J. A. Brzozowski
Helmut Jürgensen
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13511
2005
2005
eng
article
1
--
--
--
On the number of components in cooperating distributed grammar systems
It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems. In this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components. (C) 2004 Elsevier B.V. All rights reserved
0304-3975
allegro:1991-2014
10102902
Theoretical Computer Science. - ISSN 0304-3975. - 330 (2005), 2, S. 195 - 204
Henning Bordihn
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13512
2005
2005
eng
article
1
--
--
--
Unsolvability levels of operation problems for subclasses of context-free languages
We investigate the operation problem for linear and deterministic context-free languages: Fix an operation on formal languages. Given linear (deterministic, respectively) context-free languages, is the application of this operation to the given languages still a linear (deterministic, respectively) context-free language? Besides the classical operations, for which the linear and deterministic context-free languages are not closed, we also consider the recently introduced root and power operation. We show non-semidecidability, to be more precise, we show completeness for the second level of the arithmetic hierarchy for all of the aforementioned operations, except for the power operation, if the underlying alphabet contains at least two letters. The result for the power opera, tion solves an open problem stated in Theoret. Comput. Sci. 314 (2004) 445-449
0129-0541
allegro:1991-2014
10102903
International Journal of Foundations of Computer Science. - ISSN 0129-0541. - 16 (2005), 3, S. 423 - 440
Henning Bordihn
Markus Holzer
Martin Kutrib
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13495
2005
2005
eng
article
1
--
--
--
Computational methods for the design of effective therapies against drug resistant HIV strains
The development of drug resistance is a major obstacle to successful treatment of HIV infection. The extraordinary replication dynamics of HIV facilitates its escape from selective pressure exerted by the human immune system and by combination drug therapy. We have developed several computational methods whose combined use can support the design of optimal antiretroviral therapies based on viral genomic data
allegro:1991-2014
10102883
Bioinformatics. - 21 (2005), 21, S. 3943 - 3950
Niko Beerenwinkel
Tobias Sing
Thomas Lengauer
Joerg Rahnenfuhrer
Kirsten Roomp
Igor Savenkov
Roman Fischer
Daniel Hoffmann
Joachim Selbig
Klaus Korn
Hauke Walter
Thomas Berg
Patrick Braun
Gerd Faetkenheuer
Mark Oette
Juergen Rockstroh
Bernd Kupfer
Rolf Kaiser
Martin Daeumer
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
13620
2007
2007
eng
article
1
--
--
--
The first answer set programming system competition
978-3-540- 72199-4
allegro:1991-2014
10105913
Proceedings of the Ninth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'07) / Hrsg.: C. Baral ; G. Brewka ; J. Schlipf. - Heidelberg [u.a.] : Springer, 2007. - ISBN 978-3-540- 72199-4. - S. 3 - 17
Martin Gebser
Lengning Liu
Gayathri Namasivayam
André Neumann
Torsten Schaub
Miroslaw Truszczynski
Institut für Informatik und Computational Science
Institut für Informatik
13750
2005
2005
eng
article
1
--
--
--
Spatio-spectral filters for improving the classification of single trial EEG
Data recorded in electroencephalogram (EEG)-based brain-computer interface experiments is generally very noisy, non-stationary, and contaminated with artifacts that can deteriorate discrimination/classification methods. In this paper, we extend the common spatial pattern (CSP) algorithm with the aim to alleviate these adverse effects. In particular, we suggest an extension of CSP to the state space, which utilizes the method of time delay embedding. As we will show, this allows for individually tuned frequency filters at each electrode position and, thus, yields an improved and more robust machine learning procedure. The advantages of the proposed method over the original CSP method are verified in terms of an improved information transfer rate (bits per trial) on a set of EEG-recordings from experiments of imagined limb movements
0018-9294
allegro:1991-2014
10103916
Ieee Transactions on Biomedical Engineering. - ISSN 0018-9294. - 52 (2005), 9, S. 1541 - 1548
Steven Lemm
Benjamin Blankertz
Gabriel Curio
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35178
2013
2013
eng
55
63
9
1
16
article
Springer
New York
1
--
--
--
CHERUB power consumption aware cluster resource management
This paper presents an evaluation of ACPI energy saving modes, and deduces the design and implementation of an energy saving daemon for clusters called cherub. The design of the cherub daemon is modular and extensible. Since the only requirement is a central approach for resource management, cherub is suited for Server Load Balancing (SLB) clusters managed by dispatchers like Linux Virtual Server (LVS), as well as for High Performance Computing (HPC) clusters. Our experimental results show that cherub's scheduling algorithm works well, i.e. it will save energy, if possible, and avoids state-flapping.
Cluster computing : the journal of networks, software tools and applications
10.1007/s10586-011-0176-5
1386-7857 (print)
wos:2011-2013
WOS:000316011800006
Kiertscher, S (reprint author), Univ Potsdam, Inst Comp Sci, Potsdam, Germany., kiertscher@cs.uni-potsdam.de; jozinke@cs.uni-potsdam.de; schnor@cs.uni-potsdam.de
Simon Kiertscher
Jörg Zinke
Bettina Schnor
eng
uncontrolled
Green computing
eng
uncontrolled
Cluster computing
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35220
2013
2013
eng
107
117
11
2
48
article
Association for Computing Machinery
New York
1
--
--
--
CoExist overcoming aversion to change preserving immediate access to source code and run-time information of previous development states
Programmers make many changes to the program to eventually find a good solution for a given task. In this course of change, every intermediate development state can of value, when, for example, a promising ideas suddenly turn out inappropriate or the interplay of objects turns out more complex than initially expected before making changes. Programmers would benefit from tool support that provides immediate access to source code and run-time of previous development states of interest. We present IDE extensions, implemented for Squeak/Smalltalk, to preserve, retrieve, and work with this information. With such tool support, programmers can work without worries because they can rely on tools that help them with whatever their explorations will reveal. They no longer have to follow certain best practices only to avoid undesired consequences of changing code.
ACM SIGPLAN notices
10.1145/2480360.2384591
0362-1340 (print)
wos:2011-2013
WOS:000318630300010
Steinert, B (reprint author), Univ Potsdam, Software Architecture Grp, Hasso Plattner Inst, Potsdam, Germany., astian.steinert@hpi.uni-potsdam.de; damien.cassou@inria.fr; hirschfeld@hpi.uni-potsdam.de
Hasso Plattner Design Thinking Research Program
Bastian Steinert
Damien Cassou
Robert Hirschfeld
eng
uncontrolled
Design
eng
uncontrolled
Experimentation
eng
uncontrolled
Human Factors
eng
uncontrolled
Continuous Testing
eng
uncontrolled
Continuous Versioning
eng
uncontrolled
Debugging
eng
uncontrolled
Evolution
eng
uncontrolled
Explore-first Programming
eng
uncontrolled
Fault Localization
eng
uncontrolled
Prototyping
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35754
2012
2012
eng
52
89
38
8
187
article
Elsevier
Amsterdam
1
--
--
--
Conflict-driven answer set solving: From theory to practice
We introduce an approach to computing answer sets of logic programs, based on concepts successfully applied in Satisfiability (SAT) checking. The idea is to view inferences in Answer Set Programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraint-based framework capturing diverse inferences encountered in ASP solving. Moreover, our approach allows us to apply advanced solving techniques from the area of SAT. As a result, we present the first full-fledged algorithmic framework for native conflict-driven ASP solving. Our approach is implemented in the ASP solver clasp that has demonstrated its competitiveness and versatility by winning first places at various solver contests.
Artificial intelligence
10.1016/j.artint.2012.04.001
0004-3702 (print)
wos:2011-2013
WOS:000305598200003
Schaub, T (reprint author), Univ Potsdam, Inst Informat, August Bebel Str 89, D-14482 Potsdam, Germany., gebser@cs.uni-potsdam.de; kaufmann@cs.uni-potsdam.de; torsten@cs.uni-potsdam.de
German Science Foundation (DFG) [SCHA 550/8-1, SCHA 550/8-2]
Martin Gebser
Benjamin Kaufmann
Torsten Schaub
eng
uncontrolled
Answer set programming
eng
uncontrolled
Logic programming
eng
uncontrolled
Nonmonotonic reasoning
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35775
2012
2012
eng
485
503
19
12
article
Cambridge Univ. Press
New York
1
--
--
--
ASP modulo CSP The clingcon system
We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.
Theory and practice of logic programming
10.1017/S1471068412000142
1471-0684 (print)
wos:2011-2013
WOS:000308365000005
Ostrowski, M (reprint author), Univ Potsdam, Inst Informat, Potsdam, Germany.
German Science Foundation (DFG) [SCHA 550/8-2, SCHA 550/10-1 AOBJ: 593494]
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413908">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 579</a>
Max Ostrowski
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35776
2012
2012
eng
525
545
21
8
12
article
Cambridge Univ. Press
New York
1
--
--
--
Multi-threaded ASP solving with clasp
We present the new multi-threaded version of the state-of-the-art answer set solver clasp. We detail its component and communication architecture and illustrate how they support the principal functionalities of clasp. Also, we provide some insights into the data representation used for different constraint types handled by clasp. All this is accompanied by an extensive experimental analysis of the major features related to multi-threading in clasp.
Theory and practice of logic programming
10.1017/S1471068412000166
1471-0684 (print)
wos:2011-2013
WOS:000308365000007
Gebser, M (reprint author), Univ Potsdam, Inst Informat, Potsdam, Germany.
German Science Foundation (DFG) [SCHA 550/8-2]
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413977">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 586</a>
Martin Gebser
Benjamin Kaufmann
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36747
2011
2011
eng
345
370
26
3-4
62
article
Springer
Dordrecht
1
--
--
--
Knowledge-based multi-criteria optimization to support indoor positioning
Indoor position estimation constitutes a central task in home-based assisted living environments. Such environments often rely on a heterogeneous collection of low-cost sensors whose diversity and lack of precision has to be compensated by advanced techniques for localization and tracking. Although there are well established quantitative methods in robotics and neighboring fields for addressing these problems, they lack advanced knowledge representation and reasoning capacities. Such capabilities are not only useful in dealing with heterogeneous and incomplete information but moreover they allow for a better inclusion of semantic information and more general homecare and patient-related knowledge. We address this problem and investigate how state-of-the-art localization and tracking methods can be combined with Answer Set Programming, as a popular knowledge representation and reasoning formalism. We report upon a case-study and provide a first experimental evaluation of knowledge-based position estimation both in a simulated as well as in a real setting.
Annals of mathematics and artificial intelligence
10.1007/s10472-011-9241-2
1012-2443 (print)
1573-7470 (online)
wos:2011-2013
WOS:000300019900008
Mileo, A (reprint author), Natl Univ Ireland, Digital Enterprise Res Inst, IDA Business Pk, Galway, Ireland., alessandra.mileo@deri.org; torsten@cs.uni-potsdam.de; davide.merico@disco.unimib.it; roberto.bisiani@disco.unimib.it
German Science Foundation (DFG) [SCHA 550/8-2]
Alessandra Mileo
Torsten Schaub
Davide Merico
Roberto Bisiani
eng
uncontrolled
Knowledge representation
eng
uncontrolled
Answer Set Programming
eng
uncontrolled
Wireless Sensor Networks
eng
uncontrolled
Localization
eng
uncontrolled
Tracking
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36748
2011
2011
eng
213
242
30
4
48
article
Springer
New York
1
--
--
--
Connectivity of workflow nets the foundations of stepwise verification
Behavioral models capture operational principles of real-world or designed systems. Formally, each behavioral model defines the state space of a system, i.e., its states and the principles of state transitions. Such a model is the basis for analysis of the system's properties. In practice, state spaces of systems are immense, which results in huge computational complexity for their analysis. Behavioral models are typically described as executable graphs, whose execution semantics encodes a state space. The structure theory of behavioral models studies the relations between the structure of a model and the properties of its state space. In this article, we use the connectivity property of graphs to achieve an efficient and extensive discovery of the compositional structure of behavioral models; behavioral models get stepwise decomposed into components with clear structural characteristics and inter-component relations. At each decomposition step, the discovered compositional structure of a model is used for reasoning on properties of the whole state space of the system. The approach is exemplified by means of a concrete behavioral model and verification criterion. That is, we analyze workflow nets, a well-established tool for modeling behavior of distributed systems, with respect to the soundness property, a basic correctness property of workflow nets. Stepwise verification allows the detection of violations of the soundness property by inspecting small portions of a model, thereby considerably reducing the amount of work to be done to perform soundness checks. Besides formal results, we also report on findings from applying our approach to an industry model collection.
Acta informatica
10.1007/s00236-011-0137-8
0001-5903 (print)
wos:2011-2013
WOS:000297512600001
Polyvyanyy, A (reprint author), Univ Potsdam, Business Proc Technol Grp, Hasso Plattner Inst, Prof Dr Helmert Str 2-3, D-14482 Potsdam, Germany., Artem.Polyvyanyy@hpi.uni-potsdam.de; Matthias.Weidlich@hpi.uni-potsdam.de; Mathias.Weske@hpi.uni-potsdam.de
Artem Polyvyanyy
Matthias Weidlich
Mathias Weske
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36787
2011
2011
eng
275
279
5
6
16
article
Med. Scientific Publ. Holzapfel
München
1
--
--
--
Dual endothelin-converting enzyme/neutral endopeptidase blockade in rats with D-galactosamine-induced liver failure
Secondary activation of the endothelin system is thought to be involved in toxic liver injury. This study tested the hypothesis that dual endothelin-converting enzyme / neutral endopeptidase blockade might: be able to attenuate acute toxic liver injury.
Male Sprague-Dawley rats were implanted with subcutaneous minipumps to deliver the novel compound SLV338 (10 mg/kg*d) or vehicle. Four days later they received two intraperitoneal injections of D-galactosamine (1.3 g/kg each) or vehicle at an interval of 12 hours. The animals were sacrificed 48 hours after the first injection.
Injection of D-galactosamine resulted in very severe liver injury, reflected by strongly elevated plasma liver enzymes, hepatic necrosis and inflammation, and a mortality rate of 42.9 %. SLV338 treatment did not show any significant effect on the extent of acute liver injury as judged from plasma parameters, hepatic histology and mortality. Plasma measurements of SLV338 confirmed adequate drug delivery. Plasma concentrations of big endothelin-1 and endothelin-1 were significantly elevated in animals with liver injury (5-fold and 62-fold, respectively). Plasma endothelin-1 was significantly correlated with several markers of liver injury. SLV338 completely prevented the rise of plasma big endothelin-1 (p<0.05) and markedly attenuated the rise of endothelin-1 (p = 0.055).
In conclusion, dual endothelin-converting enzyme / neutral endopeptidase blockade by SLV338 did not significantly attenuate D-galactosamine-induced acute liver injury, although it largely prevented the activation of the endothelin system. An evaluation of SLV338 in a less severe model of liver injury would be of interest, since very severe intoxication might not be relevantly amenable to pharmacological interventions.
European journal of medical research : official organ "Deutsche AIDS-Gesellschaft"
0949-2321 (print)
wos:2011-2013
WOS:000292524100006
Hocher, B (reprint author), Univ Potsdam, Inst Nutr Sci, Potsdam, Germany., berthold.hocher@charite.de
Abbott Products GmbH
Berthold Hocher
S. Heiden
Karoline von Websky
Jörg Rahnenführer
Philipp Kalk
T. Pfab
eng
uncontrolled
endothelin
eng
uncontrolled
endothelin-converting enzyme
eng
uncontrolled
neutral endopeptidase
eng
uncontrolled
D-galactosamine
eng
uncontrolled
acute liver failure
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36760
2011
2011
eng
749
766
18
11
article
Cambridge Univ. Press
New York
1
--
--
--
Automatic network reconstruction using ASP
Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.
Theory and practice of logic programming
10.1017/S1471068411000287
1471-0684 (print)
wos:2011-2013
WOS:000292701100020
Durzinsky, M (reprint author), Univ Magdeburg, Magdeburg Ctr Syst Biol, D-39106 Magdeburg, Germany.
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412419">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 560</a>
Markus Durzinsky
Wolfgang Marwan
Max Ostrowski
Torsten Schaub
Annegret Wagler
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36761
2011
2011
eng
821
839
19
3
11
article
Cambridge Univ. Press
New York
1
--
--
--
Complex optimization in answer set programming
Preference handling and optimization are indispensable means for addressing nontrivial applications in Answer Set Programming (ASP). However, their implementation becomes difficult whenever they bring about a significant increase in computational complexity. As a consequence, existing ASP systems do not offer complex optimization capacities, supporting, for instance, inclusion-based minimization or Pareto efficiency. Rather, such complex criteria are typically addressed by resorting to dedicated modeling techniques, like saturation. Unlike the ease of common ASP modeling, however, these techniques are rather involved and hardly usable by ASP laymen. We address this problem by developing a general implementation technique by means of meta-prpogramming, thus reusing existing ASP systems to capture various forms of qualitative preferences among answer sets. In this way, complex preferences and optimization capacities become readily available for ASP applications.
Theory and practice of logic programming
10.1017/S1471068411000329
1471-0684 (print)
wos:2011-2013
WOS:000292701100024
Gebser, M (reprint author), Univ Potsdam, Inst Informat, Potsdam, Germany.
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412436">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 554</a>
Martin Gebser
Roland Kaminski
Torsten Schaub
eng
uncontrolled
Answer Set Programming
eng
uncontrolled
Preference Handling
eng
uncontrolled
Complex optimization
eng
uncontrolled
Meta-Programming
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37378
2014
2014
eng
123
139
17
46
article
Elsevier
Oxford
1
--
--
--
Bridging abstraction layers in process mining
While the maturity of process mining algorithms increases and more process mining tools enter the market, process mining projects still face the problem of different levels of abstraction when comparing events with modeled business activities. Current approaches for event log abstraction try to abstract from the events in an automated way that does not capture the required domain knowledge to fit business activities. This can lead to misinterpretation of discovered process models. We developed an approach that aims to abstract an event log to the same abstraction level that is needed by the business. We use domain knowledge extracted from existing process documentation to semi-automatically match events and activities. Our abstraction approach is able to deal with n:m relations between events and activities and also supports concurrency. We evaluated our approach in two case studies with a German IT outsourcing company. (C) 2014 Elsevier Ltd. All rights reserved.
Information systems
10.1016/j.is.2014.04.004
0306-4379 (print)
1873-6076 (online)
wos:2014
WOS:000340318800008
Baier, T (reprint author), Univ Potsdam, Hasso Plattner Inst, Prof Dr Helmert Str 2-3, D-14482 Potsdam, Germany., thomas.baier@hpi.uni-potsdam.de; jan.mendling@wu.ac.at; mathias.weske@hpi.uni-potsdam.de
Thomas Baier
Jan Mendling
Mathias Weske
eng
uncontrolled
Process mining
eng
uncontrolled
Abstraction
eng
uncontrolled
Event mapping
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34899
2013
2013
eng
41
64
24
1
92
article
Springer
Dordrecht
1
--
--
--
Active evaluation of ranking functions based on graded relevance
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.
Machine learning
10.1007/s10994-013-5372-5
0885-6125 (print)
wos:2011-2013
European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases (ECML-PKDD)
SEP 24-28, 2012
WOS:000321273100003
Bristol, ENGLAND
Sawade, C (reprint author), Univ Potsdam, Dept Comp Sci, August Bebel Str 89, D-14482 Potsdam, Germany., sawade@cs.uni-potsdam.de; steffen.bickel@nokia.com; timo@virginia.edu; scheffer@cs.uni-potsdam.de; landwehr@cs.uni-potsdam.de
Christoph Sawade
Steffen Bickel
Timo von Oertzen
Tobias Scheffer
Niels Landwehr
eng
uncontrolled
Information retrieval
eng
uncontrolled
Ranking
eng
uncontrolled
Active evaluation
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34920
2013
2013
eng
523
537
15
4
66
article
Cambridge Univ. Press
New York
1
--
--
--
Increasing the usability of pedestrian navigation interfaces by means of landmark visibility analysis
Communicating location-specific information to pedestrians is a challenging task which can be aided by user-friendly digital technologies. In this paper, landmark visibility analysis, as a means for developing more usable pedestrian navigation systems, is discussed. Using an algorithmic framework for image-based 3D analysis, this method integrates a 3D city model with identified landmarks and produces raster visibility layers for each one. This output enables an Android phone prototype application to indicate the visibility of landmarks from the user's actual position. Tested in the field, the method achieves sufficient accuracy for the context of use and improves navigation efficiency and effectiveness.
The journal of navigation
10.1017/S0373463313000209
0373-4633 (print)
wos:2011-2013
WOS:000319339200003
Delikostidis, I (reprint author), Univ Munster, Inst Geoinformat Ifgi, Munster, Germany., dioannis@gmail.com
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415500">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 599</a>
Ioannis Delikostidis
Juri Engel
Bas Retsios
Corne P. J. M. van Elzakker
Menno-Jan Kraak
Jürgen Döllner
eng
uncontrolled
Pedestrian navigation
eng
uncontrolled
Landmark visibility
eng
uncontrolled
User-centred design
eng
uncontrolled
Usability testing
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34884
2013
2013
eng
783
798
16
2
13
article
Cambridge Univ. Press
New York
1
--
--
--
Answer set programming as a modeling language for course timetabling
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.
Theory and practice of logic programming
10.1017/S1471068413000495
1471-0684 (print)
wos:2011-2013
WOS:000324926400022
Banbara, M (reprint author), Kobe Univ, Nada Ku, 1-1 Rokko Dai, Kobe, Hyogo 6578501, Japan., banbara@kobe-u.ac.jp; soh@lion.kobe-u.ac.jp; tamura@kobe-u.ac.jp; inoue@nii.ac.jp; torsten@cs.uni-potsdam.de
JSPS KAKENHI [24300007]; DFG [SCHA 550/9-1]
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415469">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 594</a>
Mutsunori Banbara
Takehide Soh
Naoyuki Tamura
Katsumi Inoue
Torsten Schaub
eng
uncontrolled
answer set programming
eng
uncontrolled
educational timetabling
eng
uncontrolled
course timetabling
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34909
2013
2013
eng
62
74
13
4
30
article
Inst. of Electr. and Electronics Engineers
Piscataway
1
--
--
--
Analyzing local structure in Kernel-Based learning
IEEE signal processing magazine
10.1109/MSP.2013.2249294
1053-5888 (print)
wos:2011-2013
WOS:000320606100010
Montavon, G (reprint author), Tech Univ Berlin, Berlin, Germany., gregoire.montavon@tu-berlin.de; mikio.braun@tu-berlin.de; t.krueger@tu-berlin.de; klaus-robert.mueller@tu-berlin.de
World Class University Program through the National Research Foundation
of Korea; Ministry of Education, Science, and Technology [R31-10008];
BMBF [01IB10003B]; DFG [MU 987/17-1]
Gregoire Montavon
Mikio L. Braun
Tammo Krüger
Klaus-Robert Müller
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34883
2013
2013
eng
675
690
16
13
article
Cambridge Univ. Press
New York
1
--
--
--
Minimal intervention strategies in logical signaling networks with ASP
Proposing relevant perturbations to biological signaling networks is central to many problems in biology and medicine because it allows for enabling or disabling certain biological outcomes. In contrast to quantitative methods that permit fine-grained (kinetic) analysis, qualitative approaches allow for addressing large-scale networks. This is accomplished by more abstract representations such as logical networks. We elaborate upon such a qualitative approach aiming at the computation of minimal interventions in logical signaling networks relying on Kleene's three-valued logic and fixpoint semantics. We address this problem within answer set programming and show that it greatly outperforms previous work using dedicated algorithms.
Theory and practice of logic programming
10.1017/S1471068413000422
1471-0684 (print)
wos:2011-2013
WOS:000324926400015
Kaminski, R (reprint author), Univ Potsdam, Potsdam, Germany.
DFG grant [SCHA 550/9-1]; [ANR-10-BLANC-0218]
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-415704">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 596</a>
Roland Kaminski
Torsten Schaub
Anne Siegel
Santiago Videla
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35482
2012
2012
eng
930
940
11
9
63
article
Elsevier
Amsterdam
1
--
--
--
Access control for semantic data federations in industrial product-lifecycle management
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.
Computers in industry : an international, application oriented research journal
10.1016/j.compind.2012.08.015
0166-3615 (print)
wos:2011-2013
WOS:000312178300005
Fabian, B (reprint author), Humboldt Univ, Inst Informat Syst, Spandauer Str 1, D-10178 Berlin, Germany., bfabian@wiwi.hu-berlin.de; steffen.kunz@wiwi.hu-berlin.de; marcel.konnegen@googlemail.com; sebastian.mueller@fu-berlin.de; oliver.guenther@uni-potsdam.de
German Federal Ministry of Education and Research [01IA08001E]
Benjamin Fabian
Steffen Kunz
Marcel Konnegen
Sebastian Müller
Oliver Günther
eng
uncontrolled
Access control
eng
uncontrolled
Data federation
eng
uncontrolled
Information integration
eng
uncontrolled
Product lifecycle management
eng
uncontrolled
Semantic data
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36867
2011
2011
eng
410
429
20
3
37
article
Inst. of Electr. and Electronics Engineers
Los Alamitos
1
--
--
--
Efficient consistency measurement based on behavioral profiles of process models
Engineering of process-driven business applications can be supported by process modeling efforts in order to bridge the gap between business requirements and system specifications. However, diverging purposes of business process modeling initiatives have led to significant problems in aligning related models at different abstract levels and different perspectives. Checking the consistency of such corresponding models is a major challenge for process modeling theory and practice. In this paper, we take the inappropriateness of existing strict notions of behavioral equivalence as a starting point. Our contribution is a concept called behavioral profile that captures the essential behavioral constraints of a process model. We show that these profiles can be computed efficiently, i.e., in cubic time for sound free-choice Petri nets w.r.t. their number of places and transitions. We use behavioral profiles for the definition of a formal notion of consistency which is less sensitive to model projections than common criteria of behavioral equivalence and allows for quantifying deviation in a metric way. The derivation of behavioral profiles and the calculation of a degree of consistency have been implemented to demonstrate the applicability of our approach. We also report the findings from checking consistency between partially overlapping models of the SAP reference model.
IEEE transactions on software engineering
10.1109/TSE.2010.96
0098-5589 (print)
wos:2011-2013
WOS:000290934800008
Weidlich, M (reprint author), Univ Potsdam, Hasso Plattner Inst, Prof Dr Helmert Str 2-3, D-14482 Potsdam, Germany., matthias.weidlich@hpi.uni-potsdam.de; jan.mendling@wiwi.hu-berlin.de; mathias.weske@hpi.uni-potsdam.de
Matthias Weidlich
Jan Mendling
Mathias Weske
eng
uncontrolled
Process model analysis
eng
uncontrolled
process model alignment
eng
uncontrolled
behavioral abstraction
eng
uncontrolled
consistency checking
eng
uncontrolled
consistency measures
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37528
2014
2014
eng
3
16
14
14
article
Elsevier
Amsterdam
1
--
--
--
A survey on pervasive education
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.
Pervasive and mobile computing
10.1016/j.pmcj.2013.12.001
1574-1192 (print)
1873-1589 (online)
wos:2014
WOS:000342049700002
Lucke, U (reprint author), Univ Potsdam, August Bebel Str 89, D-14482 Potsdam, Germany., ulrike.lucke@uni-potsdam.de
Ulrike Lucke
Christoph Rensing
eng
uncontrolled
Pervasive learning
eng
uncontrolled
Ubiquitous learning
eng
uncontrolled
Mobile learning
eng
uncontrolled
Contextualized learning
eng
uncontrolled
Seamless learning
eng
uncontrolled
E-learning
eng
uncontrolled
E-teaching
eng
uncontrolled
Context awareness
eng
uncontrolled
Adaptivity
eng
uncontrolled
Personalization
eng
uncontrolled
Augmentation
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37529
2014
2014
eng
47
56
10
14
article
Elsevier
Amsterdam
1
--
--
--
FreshUP-A pervasive educational game for freshmen
Students beginning their studies at university face manifold problems such as orientation in a new environment and organizing their courses. This article presents the implementation and successful empirical evaluation of the pervasive browser-based educational game "FreshUP", which aims at helping to overcome the initial difficulties of freshmen. In contrast to a conventional scavenger hunt, mobile pervasive games like FreshUP, bridging in-game and real world activities, have the potential to provide help in a motivating manner using new technology which is currently becoming more and more common. (C) 2013 Elsevier B.V. All rights reserved.
Pervasive and mobile computing
10.1016/j.pmcj.2013.09.003
1574-1192 (print)
1873-1589 (online)
wos:2014
WOS:000342049700005
Zender, R (reprint author), Univ Potsdam, Dept Comp Sci, August Bebel Str 89, D-14482 Potsdam, Germany., zender@uni-potsdam.de
Raphael Zender
Richard Metzler
Ulrike Lucke
eng
uncontrolled
Pervasive game
eng
uncontrolled
Campus
eng
uncontrolled
Freshmen
eng
uncontrolled
e-learning
eng
uncontrolled
Mobile devices
eng
uncontrolled
SOA
eng
uncontrolled
Evaluation
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
38036
2014
2014
eng
277
297
21
3
44
article
Wiley-Blackwell
Hoboken
1
--
--
--
Simplicity-first model-based plug-in development
In this article, we present our experience with over a decade of strict simplicity orientation in the development and evolution of plug-ins. The point of our approach is to enable our graphical modeling framework jABC to capture plug-in development in a domain-specific setting. The typically quite tedious and technical plug-in development is shifted this way from a programming task to the modeling level, where it can be mastered also by application experts without programming expertise. We show how the classical plug-in development profits from a systematic domain-specific API design and how the level of abstraction achieved this way can be further enhanced by defining adequate building blocks for high-level plug-in modeling. As the resulting plug-in models can be compiled and deployed automatically, our approach decomposes plug-in development into three phases where only the realization phase requires plug-in-specific effort. By using our modeling framework jABC, this effort boils down to graphical, tool-supported process modeling. Furthermore, we support the automatic completion of process sketches for executability. All this will be illustrated along the most recent plug-in-based evolution of the jABC framework, which witnessed quite some bootstrapping effects.
Software : practice & experience
10.1002/spe.2243
0038-0644 (print)
1097-024X (online)
wos:2014
WOS:000331275900003
Naujokat, S (reprint author), TU Dortmund Univ, D-44227 Dortmund, Germany., stefan.naujokat@tu-dortmund.de
Stefan Naujokat
Johannes Neubauer
Anna-Lena Lamprecht
Bernhard Steffen
Sven Joerges
Tiziana Margaria
eng
uncontrolled
plug-ins
eng
uncontrolled
simplicity
eng
uncontrolled
domain-specific APIs
eng
uncontrolled
process modeling
eng
uncontrolled
bootstrapping
eng
uncontrolled
evolution
eng
uncontrolled
code generation
eng
uncontrolled
loose programming
eng
uncontrolled
dynamic service binding
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
38011
2014
2014
eng
111
125
15
1
12
article
Springer
Dordrecht
1
--
--
--
Towards standardized job submission and control in infrastructure clouds
The submission and management of computational jobs is a traditional part of utility computing environments. End users and developers of domain-specific software abstractions often have to deal with the heterogeneity of such batch processing systems. This lead to a number of application programming interface and job description standards in the past, which are implemented and established for cluster and Grid systems. With the recent rise of cloud computing as new utility computing paradigm, the standardized access to batch processing facilities operated on cloud resources becomes an important issue. Furthermore, the design of such a standard has to consider a tradeoff between feature completeness and the achievable level of interoperability. The article discusses this general challenge, and presents some existing standards with traditional cluster and Grid computing background that may be applicable to cloud environments. We present OCCI-DRMAA as one approach for standardized access to batch processing facilities hosted in a cloud.
Journal of grid computing
10.1007/s10723-013-9275-2
1570-7873 (print)
1572-9184 (online)
wos:2014
WOS:000334446700007
Troger, P (reprint author), Univ Potsdam, Hasso Plattner Inst, D-14482 Potsdam, Germany., peter.troeger@hpi.uni-potsdam.de; andre@merzky.net
Peter Troeger
Andre Merzky
eng
uncontrolled
Cloud
eng
uncontrolled
IaaS
eng
uncontrolled
DRMS
eng
uncontrolled
DRMAA
eng
uncontrolled
OCCI
eng
uncontrolled
Batch processing
eng
uncontrolled
Job submission
eng
uncontrolled
Job monitoring
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35153
2013
2013
eng
464
479
16
3
64
article
Wiley-Blackwell
Hoboken
1
--
--
--
Evaluating the success of vocabulary reconciliation for cultural heritage collections
The concept of Linked Data has made its entrance in the cultural heritage sector due to its potential use for the integration of heterogeneous collections and deriving additional value out of existing metadata. However, practitioners and researchers alike need a better understanding of what outcome they can reasonably expect of the reconciliation process between their local metadata and established controlled vocabularies which are already a part of the Linked Data cloud. This paper offers an in-depth analysis of how a locally developed vocabulary can be successfully reconciled with the Library of Congress Subject Headings (LCSH) and the Arts and Architecture Thesaurus (AAT) through the help of a general-purpose tool for interactive data transformation (OpenRefine). Issues negatively affecting the reconciliation process are identified and solutions are proposed in order to derive maximum value from existing metadata and controlled vocabularies in an automated manner.
Journal of the American Society for Information Science and Technology
10.1002/asi.22763
1532-2882 (print)
wos:2011-2013
WOS:000323388800005
van Hooland, S (reprint author), Univ Libre Brussels, Informat & Commun Sci Dept, B-1050 Brussels, Belgium., svhoolan@ulb.ac.be; ruben.verborgh@ugent.be; madewild@ulb.ac.be; johannes.hercher@hpi.uni-potsdam.de; erik.mannens@ugent.be; rik.vandewalle@ugent.be
Ghent University; Interdisciplinary Institute for Broadband Technology
(IBBT); Institute for the Promotion of Innovation by Science and
Technology in Flanders (IWT); Fund for Scientific Research Flanders (FWO
Flanders); European Union
Seth van Hooland
Ruben Verborgh
Max De Wilde
Johannes Hercher
Erik Mannens
Rik Van de Walle
eng
uncontrolled
semantic web
eng
uncontrolled
metadata
eng
uncontrolled
controlled vocabularies
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35866
2012
2012
eng
950
957
8
6
31
article
Inst. of Electr. and Electronics Engineers
Piscataway
1
--
--
--
Highly efficient test response compaction using a hierarchical x-masking technique
This paper presents a highly effective compactor architecture for processing test responses with a high percentage of x-values. The key component is a hierarchical configurable masking register, which allows the compactor to dynamically adapt to and provide excellent performance over a wide range of x-densities. A major contribution of this paper is a technique that enables the efficient loading of the x-masking data into the masking logic in a parallel fashion using the scan chains. A method for eliminating the requirement for dedicated mask control signals using automated test equipment timing flexibility is also presented. The proposed compactor is especially suited to multisite testing. Experiments with industrial designs show that the proposed compactor enables compaction ratios exceeding 200x.
IEEE transactions on computer-aided design of integrated circuits and systems
10.1109/TCAD.2011.2181847
0278-0070 (print)
wos:2011-2013
WOS:000304244900012
Rabenalt, T (reprint author), Infineon Technol, D-85579 Neubiberg, Germany., trabenal@cs.uni-potsdam.de; miricht@cs.uni-potsdam.de; frank.poehl@intel.com; mgoessel@cs.uni-potsdam.de
MAYA, German Federal Ministry for Education and Research, [01M3063A]
Thomas Rabenalt
Michael Richter
Frank Pöhl
Michael Gössel
eng
uncontrolled
Design for testability (DFT)
eng
uncontrolled
test response compaction
eng
uncontrolled
X-masking
eng
uncontrolled
X-values
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35842
2012
2012
eng
8
2
22
article
American Institute of Physics
Melville
1
--
--
--
Anticipating, complete and lag synchronizations in RC phase-shift network based coupled Chua's circuits without delay
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.
Chaos : an interdisciplinary journal of nonlinear science
10.1063/1.4711375
1054-1500 (print)
wos:2011-2013
023124
WOS:000305833900024
Srinivasan, K (reprint author), Bharathidasan Univ, Ctr Nonlinear Dynam, Dept Phys, Tiruchchirappalli 620024, Tamil Nadu, India.
Department of Science and Technology (DST), Government of India; DST
Ramanna program; DAE Raja Ramanna program; EU [240763 PHOCUS
(FP7-ICT-2009-C)]
K. Srinivasan
D. V. Senthilkumar
I. Raja Mohamed
K. Murali
M. Lakshmanan
J. Kurths
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36986
2011
2011
eng
323
360
38
5-6
11
article
Cambridge Univ. Press
New York
1
--
--
--
Detecting inconsistencies in large biological networks with answer set programming
We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and high-throughput profiles of cell activity. We then present an approach based on answer set programming to check the consistency of large-scale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions.
Theory and practice of logic programming
10.1017/S1471068410000554
1471-0684 (print)
wos:2011-2013
24th International Conference on Logic Programming (ICLP)
DEC 09-13, 2008
WOS:000287977500008
Udine, ITALY
Gebser, M (reprint author), Univ Potsdam, Inst Informat, Potsdam, Germany., gebser@cs.uni-potsdam.de; torsten@cs.uni-potsdam.de; sthiele@cs.uni-potsdam.de; philippe.veber@googlemail.com
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-412467">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 561</a>
Martin Gebser
Torsten Schaub
Sven Thiele
Philippe Veber
eng
uncontrolled
answer set programming
eng
uncontrolled
bioinformatics
eng
uncontrolled
consistency
eng
uncontrolled
diagnosis
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35067
2013
2013
eng
866
885
20
5
19
article
Inst. of Electr. and Electronics Engineers
Los Alamitos
1
--
--
--
State of the "Art" a taxonomy of artistic stylization techniques for images and video
This paper surveys the field of nonphotorealistic rendering (NPR), focusing on techniques for transforming 2D input (images and video) into artistically stylized renderings. We first present a taxonomy of the 2D NPR algorithms developed over the past two decades, structured according to the design characteristics and behavior of each technique. We then describe a chronology of development from the semiautomatic paint systems of the early nineties, through to the automated painterly rendering systems of the late nineties driven by image gradient analysis. Two complementary trends in the NPR literature are then addressed, with reference to our taxonomy. First, the fusion of higher level computer vision and NPR, illustrating the trends toward scene analysis to drive artistic abstraction and diversity of style. Second, the evolution of local processing approaches toward edge-aware filtering for real-time stylization of images and video. The survey then concludes with a discussion of open challenges for 2D NPR identified in recent NPR symposia, including topics such as user and aesthetic evaluation.
IEEE transactions on visualization and computer graphics
10.1109/TVCG.2012.160
1077-2626 (print)
wos:2011-2013
WOS:000316801500013
Kyprianidis, JE (reprint author), Univ Potsdam, Comp Graph Syst Grp, Hasso Plattner Inst, Prof Dr Helmert Str 2-3, D-14482 Potsdam, Germany., kyprianidis@hpi.uni-potsdam.de; J.Collomosse@surrey.ac.uk; Tinghuai.Wang@surrey.ac.uk; tobias.isenberg@inria.fr
Jan Eric Kyprianidis
John Collomosse
Tinghuai Wang
Tobias Isenberg
eng
uncontrolled
Image and video stylization
eng
uncontrolled
nonphotorealistic rendering (NPR)
eng
uncontrolled
artistic rendering
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35093
2013
2013
eng
385
398
14
1
55
article
Elsevier
Amsterdam
1
--
--
--
Secure federation of semantic information services
fundamental challenge for product-lifecycle management in collaborative value networks is to utilize the vast amount of product information available from heterogeneous sources in order to improve business analytics, decision support, and processes. This becomes even more challenging if those sources are distributed across multiple organizations. Federations of semantic information services, combining service-orientation and semantic technologies, provide a promising solution for this problem. However, without proper measures to establish information security, companies will be reluctant to join an information federation, which could lead to serious adoption barriers.
Following the design science paradigm, this paper presents general objectives and a process for designing a secure federation of semantic information services. Furthermore, new as well as established security measures are discussed. Here, our contributions include an access-control enforcement system for semantic information services and a process for modeling access-control policies across organizations. In addition, a comprehensive security architecture is presented. An implementation of the architecture in the context of an application scenario and several performance experiments demonstrate the practical viability of our approach.
Decision support systems : DSS ; the international journal
10.1016/j.dss.2012.05.049
0167-9236 (print)
wos:2011-2013
WOS:000320493400036
Fabian, B (reprint author), Humboldt Univ, Inst Informat Syst, Spandauer Str 1, D-10178 Berlin, Germany., bfabian@wiwi.hu-berlin.de; steffen.kunz@wiwi.hu-berlin.de; sebastian.mueller@fu-berlin.de; oliver.guenther@uni-potsdam.de
German Federal Ministry of Education and Research [01IA08001E]
Benjamin Fabian
Steffen Kunz
Sebastian Müller
Oliver Günther
eng
uncontrolled
Information federation
eng
uncontrolled
Service orientation
eng
uncontrolled
Semantic web
eng
uncontrolled
Information security
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
35974
2012
2012
eng
713
732
20
3
23
article
World Scientific
Singapore
1
--
--
--
On the computational capacity of parallel communicating finite automata
Systems of parallel finite automata communicating by states are investigated. We consider deterministic and nondeterministic devices and distinguish four working modes. It is known that systems in the most general mode are as powerful as one-way multi-head finite automata. Here we solve some open problems on the computational capacity of systems working in the remaining modes. In particular, it is shown that deterministic returning and non-returning devices are equivalent, and that there are languages which are accepted by deterministic returning and centralized systems but cannot be accepted by deterministic non-returning centralized systems. Furthermore, we show that nondeterministic systems are strictly more powerful than their deterministic variants in all the four working modes. Finally, incomparability with the classes of (deterministic) (linear) context-free languages as well as the Church-Rosser languages is derived.
International journal of foundations of computer science
10.1142/S0129054112500062
0129-0541 (print)
wos:2011-2013
WOS:000304003000009
Bordihn, H (reprint author), Univ Potsdam, Inst Informat, August Bebel Str 89, D-14482 Potsdam, Germany., henning@cs.uni-potsdam.de; kutrib@informatik.uni-giessen.de; malcher@informatik.uni-giessen.de
Henning Bordihn
Martin Kutrib
Andreas Malcher
eng
uncontrolled
Automata systems
eng
uncontrolled
cooperating systems
eng
uncontrolled
formal languages
eng
uncontrolled
theory of computation
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36524
2011
2011
eng
953
988
36
2
11
article
Cambridge Univ. Press
New York
1
--
--
--
On elementary loops of logic programs
Using the notion of an elementary loop, Gebser and Schaub (2005. Proceedings of the Eighth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'05), 53-65) refined the theorem on loop formulas attributable to Lin and Zhao (2004) by considering loop formulas of elementary loops only. In this paper, we reformulate the definition of an elementary loop, extend it to disjunctive programs, and study several properties of elementary loops, including how maximal elementary loops are related to minimal unfounded sets. The results provide useful insights into the stable model semantics in terms of elementary loops. For a nondisjunctive program, using a graph-theoretic characterization of an elementary loop, we show that the problem of recognizing an elementary loop is tractable. On the other hand, we also show that the corresponding problem is coNP-complete for a disjunctive program. Based on the notion of an elementary loop, we present the class of Head-Elementary-loop-Free (HEF) programs, which strictly generalizes the class of Head-Cycle-Free (HCF) programs attributable to Ben-Eliyahu and Dechter (1994. Annals of Mathematics and Artificial Intelligence 12, 53-87). Like an Ha: program, an HEF program can be turned into an equivalent nondisjunctive program in polynomial time by shifting head atoms into the body.
Theory and practice of logic programming
10.1017/S1471068411000019
1471-0684 (print)
wos:2011-2013
WOS:000297442300004
Gebser, M (reprint author), Univ Potsdam, Inst Informat, Potsdam, Germany., gebser@cs.uni-potsdam.de; joolee@asu.edu; yuliya@cs.uky.edu
German Research Foundation [SCHA 550/8-1]; National Science Foundation [IIS-0916116, IIS-0712113]; Office of the Director of National Intelligence (ODNI); Intelligence Advanced Research Projects Activity (IARPA), through US army; Computing Innovation Fellowship
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-413091">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 566</a>
Martin Gebser
Joohyung Lee
Yuliya Lierler
eng
uncontrolled
stable model semantics
eng
uncontrolled
loop formulas
eng
uncontrolled
unfounded sets
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36522
2011
2011
eng
1577
1592
16
7
22
article
World Scientific
Singapore
1
--
--
--
Undecidability and hierarchy results for parallel communicating finite automata
Parallel communicating finite automata (PCFAs) are systems of several finite state automata which process a common input string in a parallel way and are able to communicate by sending their states upon request. We consider deterministic and nondeterministic variants and distinguish four working modes. It is known that these systems in the most general mode are as powerful as one-way multi-head finite automata. It is additionally known that the number of heads corresponds to the number of automata in PCFAs in a constructive way. Thus, undecidability results as well as results on the hierarchies induced by the number of heads carry over from multi-head finite automata to PCFAs in the most general mode. Here, we complement these undecidability and hierarchy results also for the remaining working modes. In particular, we show that classical decidability questions are not semi-decidable for any type of PCFAs under consideration. Moreover, it is proven that the number of automata in the system induces infinite hierarchies for deterministic and nondeterministic PCFAs in three working modes.
International journal of foundations of computer science
10.1142/S0129054111008891
0129-0541 (print)
wos:2011-2013
WOS:000297580200007
Bordihn, H (reprint author), Univ Potsdam, Inst Informat, August Bebet Str 89, D-14482 Potsdam, Germany., henning@es.uni-potsdam.de; kutrib@informatik.uni-giessen.de; malcher@informatik.uni-giessen.de
Henning Bordihn
Martin Kutrib
Andreas Malcher
eng
uncontrolled
Automata systems
eng
uncontrolled
cooperating systems
eng
uncontrolled
formal languages
eng
uncontrolled
decidability questions
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36995
2011
2011
eng
344
352
9
3
209
article
Elsevier
San Diego
1
--
--
--
Decidability of operation problems for TOL languages and subclasses
We investigate the decidability of the operation problem for TOL languages and subclasses. Fix an operation on formal languages. Given languages from the family considered (OL languages, TOL languages, or their propagating variants), is the application of this operation to the given languages still a language that belongs to the same language family? Observe, that all the Lindenmayer language families in question are anti-AFLs, that is, they are not closed under homomorphisms, inverse homomorphisms, intersection with regular languages, union, concatenation, and Kleene closure. Besides these classical operations we also consider intersection and substitution, since the language families under consideration are not closed under these operations, too. We show that for all of the above mentioned language operations, except for the Kleene closure, the corresponding operation problems of OL and TOL languages and their propagating variants are not even semidecidable. The situation changes for unary OL languages. In this case we prove that the operation problems with respect to Kleene star, complementation, and intersection with regular sets are decidable.
Information and computation
10.1016/j.ic.2010.11.008
0890-5401 (print)
wos:2011-2013
3rd International Conference on Language and Automata Theory and Applications
APR 02-08, 2009
WOS:000287382300007
Tarragona, SPAIN
Bordihn, H (reprint author), Univ Potsdam, Inst Informat, August Bebel Str 89, D-14482 Potsdam, Germany., henning@cs.uni-potsdam.de; holzer@informatik.uni-giessen.de; kutrib@informatik.uni-giessen.de
Henning Bordihn
Markus Holzer
Martin Kutrib
eng
uncontrolled
L systems
eng
uncontrolled
Operation problem
eng
uncontrolled
Decidability
eng
uncontrolled
Unary languages
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37028
2011
2011
eng
31
41
11
1
27
article
Springer
Dordrecht
1
--
--
--
Masking of X-Values by use of a hierarchically configurable register
In this paper we consider masking of unknowns (X-values) for VLSI circuits. We present a new hierarchical method of X-masking which is a major improvement of the method proposed in [4], called WIDE1. By the method proposed, the number of observable scan cells is optimized and data volume for X-masking can be significantly reduced in comparison to WIDEL This is demonstrated for three industrial designs. In cases where all X-values have to be masked the novel approach is especially efficient.
Journal of electronic testing : theory and applications
10.1007/s10836-010-5179-2
0923-8174 (print)
wos:2011-2013
WOS:000288768900004
Rabenalt, T (reprint author), Univ Potsdam, August Bebel Str 89, D-14482 Potsdam, Germany., trabenal@cs.uni-potsdam.de; mgoessel@cs.uni-potsdam.de; andreas.leininger@infinen.com
German Federal Ministry for Education and Research (BMBF) [01M3063A]
Thomas Rabenalt
Michael Goessel
Andreas Leininger
eng
uncontrolled
Masking of X-values
eng
uncontrolled
Hierarchically configurable mask register
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37029
2011
2011
eng
239
272
34
2
82
article
Springer
Dordrecht
1
--
--
--
Stochastic relational processes efficient inference and applications
One of the goals of artificial intelligence is to develop agents that learn and act in complex environments. Realistic environments typically feature a variable number of objects, relations amongst them, and non-deterministic transition behavior. While standard probabilistic sequence models provide efficient inference and learning techniques for sequential data, they typically cannot fully capture the relational complexity. On the other hand, statistical relational learning techniques are often too inefficient to cope with complex sequential data. In this paper, we introduce a simple model that occupies an intermediate position in this expressiveness/efficiency trade-off. It is based on CP-logic (Causal Probabilistic Logic), an expressive probabilistic logic for modeling causality. However, by specializing CP-logic to represent a probability distribution over sequences of relational state descriptions and employing a Markov assumption, inference and learning become more tractable and effective. Specifically, we show how to solve part of the inference and learning problems directly at the first-order level, while transforming the remaining part into the problem of computing all satisfying assignments for a Boolean formula in a binary decision diagram. We experimentally validate that the resulting technique is able to handle probabilistic relational domains with a substantial number of objects and relations.
Machine learning
10.1007/s10994-010-5213-8
0885-6125 (print)
wos:2011-2013
International Conference on Machine Learning/ Workshop on Machine Learning and Graphs
2008
WOS:000288121900007
Helsinki, FINLAND
Thon, I (reprint author), Katholieke Univ Leuven, Dept Comp Sci, Celestijnenlaan 200A, B-3001 Heverlee, Belgium., ingo.thon@cs.kuleuven.be; landwehr@cs.uni-potsdam.de; luc.deraedt@cs.kuleuven.be
Ingo Thon
Niels Landwehr
Luc De Raedt
eng
uncontrolled
Statistical relational learning
eng
uncontrolled
Stochastic relational process
eng
uncontrolled
Markov processes
eng
uncontrolled
Time series
eng
uncontrolled
CP-Logic
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37720
2014
2014
eng
569
585
17
14
article
Cambridge Univ. Press
New York
1
--
--
--
claspfolio 2
Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio, but also over manually tuned configurations of clasp.
Theory and practice of logic programming
advances in algorithm selection for answer set programming
10.1017/S1471068414000210
1471-0684 (print)
1475-3081 (online)
wos:2014
30th International Conference on Logic Programming
JUL, 2014
WOS:000343203200012
Vienna, AUSTRIA
Hoos, H (reprint author), Univ British Columbia, Vancouver, BC V5Z 1M9, Canada.
<a href="http://nbn-resolving.de/urn:nbn:de:kobv:517-opus4-416129">Zweitveröffentlichung in der Schriftenreihe Postprints der Universität Potsdam : Mathematisch-Naturwissenschaftliche Reihe ; 606</a>
Holger Hoos
Marius Lindauer
Torsten Schaub
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34949
2013
2013
eng
165
177
13
3
5
article
Springer
Heidelberg
1
--
--
--
"Deal of the Day" Platforms what drives Consumer loyalty?
"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.
Business & information systems engineering : the international journal of Wirtschaftsinformatik
10.1007/s12599-013-0268-2
1867-0202 (print)
wos:2011-2013
WOS:000323897900005
Krasnova, H (reprint author), Humboldt Univ, Inst Informat Syst, Spandauer Str 1, D-10178 Berlin, Germany., krasnovh@wiwi.hu-berlin.de; nveltri@ut.edu; klaus.spengler@wiwi.hu-berlin.de; oliver.guenther@uni-potsdam.de
Hanna Krasnova
Natasha F. Veltri
Klaus Spengler
Oliver Günther
eng
uncontrolled
Deal of the Day
eng
uncontrolled
Loyalty
eng
uncontrolled
Grounded theory
eng
uncontrolled
Structural equation modeling
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34971
2013
2013
eng
46
2
14
article
Association for Computing Machinery
New York
1
--
--
--
A model-theoretic approach to belief change in answer set programming
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.
ACM transactions on computational logic
10.1145/2480759.2480766
1529-3785 (print)
wos:2011-2013
14
WOS:000320619600007
Delgrande, J (reprint author), Simon Fraser Univ, Burnaby, BC V5A 1S6, Canada., jim@cs.sfu.ca; torsten@cs.uni-potsdam.de; tompits@kr.tuwien.ac.at; woltran@dbai.tuwien.ac.at
Canadian NSERC Discovery Grant; German Science Foundation (DFG) [SCHA
550/8-2]; Austrian Science Fund (FWF) [P21698]; Vienna University of
Technology [9006.09/008]
James Delgrande
Torsten Schaub
Hans Tompits
Stefan Woltran
eng
uncontrolled
Theory
eng
uncontrolled
Answer set programming
eng
uncontrolled
belief revision
eng
uncontrolled
belief merging
eng
uncontrolled
program encodings
eng
uncontrolled
strong equivalence
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
34972
2013
2013
eng
40
2
14
article
Association for Computing Machinery
New York
1
--
--
--
Tableau calculi for logic programs under answer set semantics
We introduce formal proof systems based on tableau methods for analyzing computations in Answer Set Programming (ASP). Our approach furnishes fine-grained instruments for characterizing operations as well as strategies of ASP solvers. The granularity is detailed enough to capture a variety of propagation and choice methods of algorithms used for ASP solving, also incorporating SAT-based and conflict-driven learning approaches to some extent. This provides us with a uniform setting for identifying and comparing fundamental properties of ASP solving approaches. In particular, we investigate their proof complexities and show that the run-times of best-case computations can vary exponentially between different existing ASP solvers. Apart from providing a framework for comparing ASP solving approaches, our characterizations also contribute to their understanding by pinning down the constitutive atomic operations. Furthermore, our framework is flexible enough to integrate new inference patterns, and so to study their relation to existing ones. To this end, we generalize our approach and provide an extensible basis aiming at a modular incorporation of additional language constructs. This is exemplified by augmenting our basic tableau methods with cardinality constraints and disjunctions.
ACM transactions on computational logic
10.1145/2480759.2480767
1529-3785 (print)
wos:2011-2013
15
WOS:000320619600008
Gebser, M (reprint author), Univ Potsdam, Inst Informat, August Bebel Str 89, D-14482 Potsdam, Germany., fgebser@cs.uni-potsdam.de; torsteng@cs.uni-potsdam.de
German Science Foundation (DFG) [SCHA 550/8-1/2]
Martin Gebser
Torsten Schaub
eng
uncontrolled
Theory
eng
uncontrolled
Answer Set Programming
eng
uncontrolled
tableau calculi
eng
uncontrolled
proof complexity
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36319
2012
2012
eng
771
793
23
5
26
article
Routledge, Taylor & Francis Group
Abingdon
1
--
--
--
Extended hybrid meshing algorithm for multiresolution terrain models
Hybrid terrains are a convenient approach for the representation of digital terrain models, integrating heterogeneous data from different sources. In this article, we present a general, efficient scheme for achieving interactive level-of-detail rendering of hybrid terrain models, without the need for a costly preprocessing or resampling of the original data. The presented method works with hybrid digital terrains combining regular grid data and local high-resolution triangulated irregular networks. Since grid and triangulated irregular network data may belong to different datasets, a straightforward combination of both geometries would lead to meshes with holes and overlapping triangles. Our method generates a single multiresolution model integrating the different parts in a coherent way, by performing an adaptive tessellation of the region between their boundaries. Hence, our solution is one of the few existing approaches for integrating different multiresolution algorithms within the same terrain model, achieving a simple interactive rendering of complex hybrid terrains.
International journal of geographical information science
10.1080/13658816.2011.615317
1365-8816 (print)
wos:2011-2013
WOS:000303412500001
Paredes, EG (reprint author), Univ Santiago de Compostela, Dept Elect & Comp Sci, Santiago De Compostela, Galicia, Spain., eg.paredes@usc.es
Xunta de Galicia [08TIC001206PR, 08SIN011291PR]; Program for
Consolidation of Competitive Research Groups [2010/06, 2010/28];
Ministry of Science and Innovation of Spain; European Union
[TIN2010-16735, TIN2010-17541]
E. G. Paredes
M. Boo
M. Amor
J. D. Bruguera
Jürgen Döllner
eng
uncontrolled
3D modeling
eng
uncontrolled
3D visualization
eng
uncontrolled
geovisualization
eng
uncontrolled
triangulated irregular networks
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
36648
2011
2011
eng
589
606
18
5
23
article
Springer
New York
1
--
--
--
Assuring property conformance of code generators via model checking
Automatic code generation is an essential cornerstone of today's model-driven approaches to software engineering. Thus a key requirement for the success of this technique is the reliability and correctness of code generators. This article describes how we employ standard model checking-based verification to check that code generator models developed within our code generation framework Genesys conform to (temporal) properties. Genesys is a graphical framework for the high-level construction of code generators on the basis of an extensible library of well-defined building blocks along the lines of the Extreme Model-Driven Development paradigm. We will illustrate our verification approach by examining complex constraints for code generators, which even span entire model hierarchies. We also show how this leads to a knowledge base of rules for code generators, which we constantly extend by e.g. combining constraints to bigger constraints, or by deriving common patterns from structurally similar constraints. In our experience, the development of code generators with Genesys boils down to re-instantiating patterns or slightly modifying the graphical process model, activities which are strongly supported by verification facilities presented in this article.
Formal aspects of computing : the international journal of formal methods
10.1007/s00165-010-0169-9
0934-5043 (print)
wos:2011-2013
WOS:000294468000002
Jorges, S (reprint author), Tech Univ Dortmund, Chair Programming Syst, Dortmund, Germany., sven.joerges@tu-dortmund.de
Sven Jörges
Tiziana Margaria
Bernhard Steffen
eng
uncontrolled
Extreme Model-Driven Development
eng
uncontrolled
Code generation
eng
uncontrolled
Model checking
eng
uncontrolled
Verification
Institut für Informatik und Computational Science
Referiert
Institut für Informatik
37185
2011
2011
eng
151
177
27
2
113
article
IOS Press
Amsterdam
1
--
--
--
Relational feature mining with hierarchical multitask kFOIL
We introduce hierarchical kFOIL as a simple extension of the multitask kFOIL learning algorithm. The algorithm first learns a core logic representation common to all tasks, and then refines it by specialization on a per-task basis. The approach can be easily generalized to a deeper hierarchy of tasks. A task clustering algorithm is also proposed in order to automatically generate the task hierarchy. The approach is validated on problems of drug-resistance mutation prediction and protein structural classification. Experimental results show the advantage of the hierarchical version over both single and multi task alternatives and its potential usefulness in providing explanatory features for the domain. Task clustering allows to further improve performance when a deeper hierarchy is considered.
Fundamenta informaticae
10.3233/FI-2011-604
0169-2968 (print)
wos:2011-2013
WOS:000299978700004
Cilia, E (reprint author), Univ Libre Bruxelles, Dept Informat, Brussels, Belgium., ecilia@ulb.ac.be; landwehr@cs.uni-potsdam.de; passerini@disi.unitn.it
NIH [P41 RR-01081]
Elisa Cilia
Niels Landwehr
Andrea Passerini
Institut für Informatik und Computational Science
Referiert
Institut für Informatik