TY  - JOUR
A1  - Volkmann, Gerald
A1  - Linke, Thomas
A1  - Waschulzik, Thomas
A1  - Ohmes, Rick
A1  - Schaub, Torsten H.
A1  - Wischnewsky, M.
T1  - HExProSA - ein hybrides Expertensystem zur Prozeßkontrolle und Störfallanalyse von Abwasserbehandlungsanlagen : Erfahrungen bei der Evaluierung eines Prototypen
Y1  - 1998
UR  - http://home.zait.uni-bremen.de/~gerald/papers/pius-papers.html
ER  - 
TY  - JOUR
A1  - Videla, Santiago
A1  - Guziolowski, Carito
A1  - Eduati, Federica
A1  - Thiele, Sven
A1  - Gebser, Martin
A1  - Nicolas, Jacques
A1  - Saez-Rodriguez, Julio
A1  - Schaub, Torsten H.
A1  - Siegel, Anne
T1  - Learning Boolean logic models of signaling networks with ASP
JF  - Theoretical computer science
N2  - Boolean networks provide a simple yet powerful qualitative modeling approach in systems biology. However, manual identification of logic rules underlying the system being studied is in most cases out of reach. Therefore, automated inference of Boolean logical networks from experimental data is a fundamental question in this field. This paper addresses the problem consisting of learning from a prior knowledge network describing causal interactions and phosphorylation activities at a pseudo-steady state, Boolean logic models of immediate-early response in signaling transduction networks. The underlying optimization problem has been so far addressed through mathematical programming approaches and the use of dedicated genetic algorithms. In a recent work we have shown severe limitations of stochastic approaches in this domain and proposed to use Answer Set Programming (ASP), considering a simpler problem setting. Herein, we extend our previous work in order to consider more realistic biological conditions including numerical datasets, the presence of feedback-loops in the prior knowledge network and the necessity of multi-objective optimization. In order to cope with such extensions, we propose several discretization schemes and elaborate upon our previous ASP encoding. Towards real-world biological data, we evaluate the performance of our approach over in silico numerical datasets based on a real and large-scale prior knowledge network. The correctness of our encoding and discretization schemes are dealt with in Appendices A-B. (C) 2014 Elsevier B.V. All rights reserved.
KW  - Answer set programming
KW  - Signaling transduction networks
KW  - Boolean logic models
KW  - Combinatorial multi-objective optimization
KW  - Systems biology
Y1  - 2015
U6  - https://doi.org/10.1016/j.tcs.2014.06.022
SN  - 0304-3975
SN  - 1879-2294
VL  - 599
SP  - 79
EP  - 101
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Thielscher, Michael
A1  - Schaub, Torsten H.
T1  - Default reasoning by deductive planning
Y1  - 1995
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Woltran, Stefan
T1  - Answer set programming unleashed!
JF  - Künstliche Intelligenz
N2  - Answer Set Programming faces an increasing popularity for problem solving in various domains. While its modeling language allows us to express many complex problems in an easy way, its solving technology enables their effective resolution. In what follows, we detail some of the key factors of its success. Answer Set Programming [ASP; Brewka et al. Commun ACM 54(12):92–103, (2011)] is seeing a rapid proliferation in academia and industry due to its easy and flexible way to model and solve knowledge-intense combinatorial (optimization) problems. To this end, ASP offers a high-level modeling language paired with high-performance solving technology. As a result, ASP systems provide out-off-the-box, general-purpose search engines that allow for enumerating (optimal) solutions. They are represented as answer sets, each being a set of atoms representing a solution. The declarative approach of ASP allows a user to concentrate on a problem’s specification rather than the computational means to solve it. This makes ASP a prime candidate for rapid prototyping and an attractive tool for teaching key AI techniques since complex problems can be expressed in a succinct and elaboration tolerant way. This is eased by the tuning of ASP’s modeling language to knowledge representation and reasoning (KRR). The resulting impact is nicely reflected by a growing range of successful applications of ASP [Erdem et al. AI Mag 37(3):53–68, 2016; Falkner et al. Industrial applications of answer set programming. K++nstliche Intelligenz (2018)]
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0550-z
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 105
EP  - 108
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, T.
T1  - Preferred well-founded semantics for logic programming by alternating fixpoints : preliminary report
Y1  - 2002
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A semantic framework for prefernce handling in answer set programming
Y1  - 2003
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A comparative study of logic programs with preference
Y1  - 2001
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Wang, Kewen
T1  - A comparative study of logic programs with preference
Y1  - 2001
SN  - 1-558-60777-3
SN  - 1045-0823
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Thielscher, Michael
T1  - Skeptical query-answering in constrained default logic
Y1  - 1996
SN  - 3-540-61313-7
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Nicolas, Pascal
T1  - An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation
Y1  - 1997
SN  - 3-540-63255-7
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Nicolas, Pascal
T1  - An implementation platform for query-answering in default logics : theoretical underpinnings
Y1  - 1997
SN  - 3-540-63614-5
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Brüning, Stefan
A1  - Nicolas, Pascal
T1  - XRay : a prolog technology theorem prover for default reasoning: a system description
Y1  - 1996
SN  - 3-540-61511-3
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Brüning, Stefan
T1  - Prolog technology for default reasoning
Y1  - 1996
SN  - 0-471-96809-9
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
A1  - Brüning, Stefan
T1  - Prolog technology for default reasoning : proof theory and compilation techniques
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
T1  - Antwortmengenprogrammierung
Y1  - 2003
ER  - 
TY  - JOUR
A1  - Schaub, Torsten H.
T1  - The family of default logics
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A compiler for nested logic programming
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Pearce, David
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A polynomial translation of logic programs with nested expressions into disjunctive logic programs
Y1  - 2002
SN  - 3-540-43930-7
ER  - 
TY  - JOUR
A1  - Pearce, David
A1  - Sarsakov, Vladimir
A1  - Schaub, Torsten H.
A1  - Tompits, Hans
A1  - Woltran, Stefan
T1  - A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report
Y1  - 2002
ER  - 
TY  - JOUR
A1  - Ostrowski, Max
A1  - Schaub, Torsten H.
T1  - ASP modulo CSP The clingcon system
JF  - Theory and practice of logic programming
N2  - 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.
Y1  - 2012
U6  - https://doi.org/10.1017/S1471068412000142
SN  - 1471-0684
VL  - 12
SP  - 485
EP  - 503
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Nicolas, Pascal
A1  - Schaub, Torsten H.
T1  - The XRay system : an implementation platform for local query-answering in default logics
Y1  - 1998
SN  - 3-540-65312-0
ER  - 
TY  - JOUR
A1  - Nicolas, Pascal
A1  - Schaub, Torsten H.
T1  - Un cadre général pour l'interrogation automatique en logiques des défauts
Y1  - 1998
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten H.
A1  - Merico, Davide
A1  - Bisiani, Roberto
T1  - Knowledge-based multi-criteria optimization to support indoor positioning
JF  - Annals of mathematics and artificial intelligence
N2  - 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.
KW  - Knowledge representation
KW  - Answer Set Programming
KW  - Wireless Sensor Networks
KW  - Localization
KW  - Tracking
Y1  - 2011
U6  - https://doi.org/10.1007/s10472-011-9241-2
SN  - 1012-2443
SN  - 1573-7470
VL  - 62
IS  - 3-4
SP  - 345
EP  - 370
PB  - Springer
CY  - Dordrecht
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten H.
T1  - Qualitative constraint enforcement in advanced policy specification
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten H.
T1  - Extending ordered disjunctions for policy enforcement : preliminary report
Y1  - 2006
UR  - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Towards a classification of default logic
Y1  - 1997
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Putting default logics in perspective
Y1  - 1996
SN  - 3-540-61708-6
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - An approach to query-answering in Reiter's default logic and the underlying existence of extensions problem.
Y1  - 1998
SN  - 3-540-65141-1
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Lemma handling in default logic theorem provers
Y1  - 1995
SN  - 3540601120
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Alternative foundations for Reiter's default logic.
Y1  - 2000
SN  - 0004-3702
ER  - 
TY  - JOUR
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - On bottom-up pre-processing techniques for automated default reasoning
Y1  - 1999
SN  - 3-540-66131-x
ER  - 
TY  - JOUR
A1  - Lindauer, Marius
A1  - Hoos, Holger
A1  - Leyton-Brown, Kevin
A1  - Schaub, Torsten H.
T1  - Automatic construction of parallel portfolios via algorithm configuration
JF  - Artificial intelligence
N2  - Since 2004, increases in computational power described by Moore's law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for propositional satisfiability (SAT), one of the most widely studied NP-complete problems, can be produced automatically from any existing sequential, highly parametric SAT solver. Our Automatic Construction of Parallel Portfolios (ACPP) approach uses an automatic algorithm configuration procedure to identify a set of configurations that perform well when executed in parallel. Applied to two prominent SAT solvers, Lingeling and clasp, our ACPP procedure identified 8-core solvers that significantly outperformed their sequential counterparts on a diverse set of instances from the application and hard combinatorial category of the 2012 SAT Challenge. We further extended our ACPP approach to produce parallel portfolio solvers consisting of several different solvers by combining their configuration spaces. Applied to the component solvers of the 2012 SAT Challenge gold medal winning SAT Solver pfolioUZK, our ACPP procedures produced a significantly better-performing parallel SAT solver.
KW  - Algorithm configuration
KW  - Parallel SAT solving
KW  - Algorithm portfolios
KW  - Programming by optimization
KW  - Automated parallelization
Y1  - 2016
U6  - https://doi.org/10.1016/j.artint.2016.05.004
SN  - 0004-3702
SN  - 1872-7921
VL  - 244
SP  - 272
EP  - 290
PB  - Elsevier
CY  - Amsterdam
ER  - 
TY  - JOUR
A1  - Lindauer, Marius
A1  - Hoos, Holger H.
A1  - Hutter, Frank
A1  - Schaub, Torsten H.
T1  - An automatically configured algorithm selector
JF  - The journal of artificial intelligence research
N2  - Algorithm selection (AS) techniques - which involve choosing from a set of algorithms the one expected to solve a given problem instance most efficiently - have substantially improved the state of the art in solving many prominent AI problems, such as SAT, CSP, ASP, MAXSAT and QBF. Although several AS procedures have been introduced, not too surprisingly, none of them dominates all others across all AS scenarios. Furthermore, these procedures have parameters whose optimal values vary across AS scenarios. This holds specifically for the machine learning techniques that form the core of current AS procedures, and for their hyperparameters. Therefore, to successfully apply AS to new problems, algorithms and benchmark sets, two questions need to be answered: (i) how to select an AS approach and (ii) how to set its parameters effectively. We address both of these problems simultaneously by using automated algorithm configuration. Specifically, we demonstrate that we can automatically configure claspfolio 2, which implements a large variety of different AS approaches and their respective parameters in a single, highly-parameterized algorithm framework. Our approach, dubbed AutoFolio, allows researchers and practitioners across a broad range of applications to exploit the combined power of many different AS methods. We demonstrate AutoFolio can significantly improve the performance of claspfolio 2 on 8 out of the 13 scenarios from the Algorithm Selection Library, leads to new state-of-the-art algorithm selectors for 7 of these scenarios, and matches state-of-the-art performance (statistically) on all other scenarios. Compared to the best single algorithm for each AS scenario, AutoFolio achieves average speedup factors between 1.3 and 15.4.
Y1  - 2015
SN  - 1076-9757
SN  - 1943-5037
VL  - 53
SP  - 745
EP  - 778
PB  - AI Access Foundation
CY  - Marina del Rey
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with prefernces : preliminary report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/koschli03a.pdf
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
A1  - Linke, Thomas
T1  - Graphs and colorings for answer set programming with preferences
N2  - The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one
Y1  - 2003
SN  - 0169-2968
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and colorings for answer set programming
N2  - 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
Y1  - 2006
UR  - http://www.cs.kuleuven.ac.be/~dtai/projects/ALP//TPLP/
U6  - https://doi.org/10.1017/S1471068405002528
SN  - 1471-0684
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and cologings for answer set programming : adridged report
Y1  - 2004
SN  - 3-540- 20721-x
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten H.
T1  - Graphs and colorings for answer set programming : abridged report
Y1  - 2003
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/kolisch03a.pdf
SN  - 1613-0073
ER  - 
TY  - JOUR
A1  - Kaminski, Roland
A1  - Schaub, Torsten H.
A1  - Siegel, Anne
A1  - Videla, Santiago
T1  - Minimal intervention strategies in logical signaling networks with ASP
JF  - Theory and practice of logic programming
N2  - 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.
Y1  - 2013
U6  - https://doi.org/10.1017/S1471068413000422
SN  - 1471-0684
VL  - 13
SP  - 675
EP  - 690
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Hoos, Holger
A1  - Lindauer, Marius
A1  - Schaub, Torsten H.
T1  - claspfolio 2
BT  - advances in algorithm selection for answer set programming
JF  - Theory and practice of logic programming
N2  - 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.
Y1  - 2014
U6  - https://doi.org/10.1017/S1471068414000210
SN  - 1471-0684
SN  - 1475-3081
VL  - 14
SP  - 569
EP  - 585
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Hoos, Holger
A1  - Kaminski, Roland
A1  - Lindauer, Marius
A1  - Schaub, Torsten H.
T1  - aspeed: Solver scheduling via answer set programming
JF  - Theory and practice of logic programming
N2  - Although Boolean Constraint Technology has made tremendous progress over the last decade, the efficacy of state-of-the-art solvers is known to vary considerably across different types of problem instances, and is known to depend strongly on algorithm parameters. This problem was addressed by means of a simple, yet effective approach using handmade, uniform, and unordered schedules of multiple solvers in ppfolio, which showed very impressive performance in the 2011 Satisfiability Testing (SAT) Competition. Inspired by this, we take advantage of the modeling and solving capacities of Answer Set Programming (ASP) to automatically determine more refined, that is, nonuniform and ordered solver schedules from the existing benchmarking data. We begin by formulating the determination of such schedules as multi-criteria optimization problems and provide corresponding ASP encodings. The resulting encodings are easily customizable for different settings, and the computation of optimum schedules can mostly be done in the blink of an eye, even when dealing with large runtime data sets stemming from many solvers on hundreds to thousands of instances. Also, the fact that our approach can be customized easily enabled us to swiftly adapt it to generate parallel schedules for multi-processor machines.
KW  - algorithm schedules
KW  - answer set programming
KW  - portfolio-based solving
Y1  - 2015
U6  - https://doi.org/10.1017/S1471068414000015
SN  - 1471-0684
SN  - 1475-3081
VL  - 15
SP  - 117
EP  - 142
PB  - Cambridge Univ. Press
CY  - New York
ER  - 
TY  - JOUR
A1  - Hermenegildo, Manuel
A1  - Schaub, Torsten H.
T1  - Introduction to the technical communications of the 26th International Conference on Logic Programming : special issue
Y1  - 2010
UR  - http://www.cs.kuleuven.ac.be/~dtai/projects/ALP//TPLP/
U6  - https://doi.org/10.1017/S1471068410000153
SN  - 1471-0684
ER  - 
TY  - JOUR
A1  - Haubelt, Christian
A1  - Neubauer, Kai
A1  - Schaub, Torsten H.
A1  - Wanko, Philipp
T1  - Design space exploration with answer set programming
JF  - Künstliche Intelligenz
N2  - The aim of our project design space exploration with answer set programming is to develop a general framework based on Answer Set Programming (ASP) that finds valid solutions to the system design problem and simultaneously performs Design Space Exploration (DSE) to find the most favorable alternatives. We leverage recent developments in ASP solving that allow for tight integration of background theories to create a holistic framework for effective DSE.
Y1  - 2018
U6  - https://doi.org/10.1007/s13218-018-0530-3
SN  - 0933-1875
SN  - 1610-1987
VL  - 32
IS  - 2-3
SP  - 205
EP  - 206
PB  - Springer
CY  - Heidelberg
ER  - 
TY  - JOUR
A1  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten H.
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - On probing and multi-threading in platypus
Y1  - 2006
UR  - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
ER  - 
TY  - JOUR
A1  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten H.
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - On probing and multi-threading in platypus
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten H.
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - Platypus : a platform for distributed answer set solving
Y1  - 2005
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.pdf
ER  - 
TY  - JOUR
A1  - Grell, Susanne
A1  - Schaub, Torsten H.
A1  - Selbig, Joachim
T1  - Modelling biological networks by action languages via set programming
Y1  - 2006
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf
U6  - https://doi.org/10.1007/11799573
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Grell, Susanne
A1  - Konczak, Kathrin
A1  - Schaub, Torsten H.
T1  - nomore) : a system for computing preferred Answer Sets
Y1  - 2005
SN  - 0302-9743
ER  - 
TY  - JOUR
A1  - Gharib, Mona
A1  - Schaub, Torsten H.
A1  - Mercer, Robert E.
T1  - Incremental answer set programming : a preliminary report
Y1  - 2007
ER  - 
TY  - JOUR
A1  - Gerbser, Martin
A1  - Schaub, Torsten H.
T1  - Tableau calculi for answer set programming
Y1  - 2006
UR  - http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf
U6  - https://doi.org/10.1007/11799573
SN  - 0302-9743
ER  -