@article{GrellKonczakSchaub2005,
  author    = {Grell, Susanne and Konczak, Kathrin and Schaub, Torsten H.},
  title     = {nomore) : a system for computing preferred Answer Sets},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@article{DelgrandeSchaub2005,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Expressing default logic variants in default logic},
  issn      = {0955-792X},
  year      = {2005},
  abstract  = {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},
  language  = {en}
}
@article{GebserLiuNamasivayametal.2007,
  author    = {Gebser, Martin and Liu, Lengning and Namasivayam, Gayathri and Neumann, Andr{\´e} and Schaub, Torsten H. and Truszczynski, Miroslaw},
  title     = {The first answer set programming system competition},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{BorchertAngerSchaubetal.2004,
  author    = {Borchert, P. and Anger, Christian and Schaub, Torsten H. and Truszczynski, M.},
  title     = {Towards systematic benchmarking in answer set programming : the dagstuhl initiative},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Two approaches to merging knowledge bases},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompits2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {Domain-specific preference for causal reasoning and planning},
  isbn      = {1-577-35201-7},
  year      = {2004},
  language  = {en}
}
@article{FloeterSelbigSchaub2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Selbig, Joachim and Schaub, Torsten H.},
  title     = {Finding metabolic pathways in decision forests},
  isbn      = {3-540-23221-4},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Consistency-based approaches to merging knowledge based : preliminary report},
  isbn      = {92-990021-0-X},
  year      = {2004},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten H. and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2004},
  abstract  = {Motivation: Continued development of analytical techniques based on gas chromatography and mass spectrometry now facilitates the generation of larger sets of metabolite concentration data. An important step towards the understanding of metabolite dynamics is the recognition of stable states where metabolite concentrations exhibit a simple behaviour. Such states can be characterized through the identification of significant thresholds in the concentrations. But general techniques for finding discretization thresholds in continuous data prove to be practically insufficient for detecting states due to the weak conditional dependences in concentration data. Results: We introduce a method of recognizing states in the framework of decision tree induction. It is based upon a global analysis of decision forests where stability and quality are evaluated. It leads to the detection of thresholds that are both comprehensible and robust. Applied to metabolite concentration data, this method has led to the discovery of hidden states in the corresponding variables. Some of these reflect known properties of the biological experiments, and others point to putative new states},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Wang, Kewen},
  title     = {A classification and survey of preference handling approchaches in nonmonotonic reasoning},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {In recent years, there has been a large amount of disparate work concerning the representation and reasoning with qualitative preferential information by means of approaches to nonmonotonic reasoning. Given the variety of underlying systems, assumptions, motivations, and intuitions, it is difficult to compare or relate one approach with another. Here, we present an overview and classification for approaches to dealing with preference. A set of criteria for classifying approaches is given, followed by a set of desiderata that an approach might be expected to satisfy. A comprehensive set of approaches is subsequently given and classified with respect to these sets of underlying principles},
  language  = {en}
}
@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning with sets of preferences in default logic},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {We present a general approach for representing and reasoning with sets of defaults in default logic, focusing on reasoning about preferences among sets of defaults. First, we consider how to control the application of a set of defaults so that either all apply (if possible) or none do (if not). From this, an approach to dealing with preferences among sets of default rules is developed. We begin with an ordered default theory, consisting of a standard default theory, but with possible preferences on sets of rules. This theory is transformed into a second, standard default theory wherein the preferences are respected. The approach differs from other work, in that we obtain standard default theories and do not rely on prioritized versions of default logic. In practical terms this means we can immediately use existing default logic theorem provers for an implementation. Also, we directly generate just those extensions containing the most preferred applied rules; in contrast, most previous approaches generate all extensions, then select the most preferred. In a major application of the approach, we show how semimonotonic default theories can be encoded so that reasoning can be carried out at the object level. With this, we can reason about default extensions from within the framework of a standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2003},
  language  = {en}
}
@article{KonczakLinkeSchaub2003,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and colorings for answer set programming : abridged report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {On the relation between Reiter{\"i}s default logic and its (major) variants},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten H.},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeGharibMerceretal.2003,
  author    = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten H.},
  title     = {Lukaszewicz-style answer set programming : a preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{Schaub2003,
  author    = {Schaub, Torsten H.},
  title     = {Antwortmengenprogrammierung},
  year      = {2003},
  language  = {de}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with preferences},
  issn      = {0169-2968},
  year      = {2003},
  abstract  = {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},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2003,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten H. and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Wang, Kewen},
  title     = {Towards a classification of preference handling approaches in nonmonotonic reasoning},
  isbn      = {1-577-35166-5},
  year      = {2002},
  language  = {en}
}
@article{BesnardMercerSchaub2002,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten H.},
  title     = {Optimality Theory via Default Logic},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeSchaub2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeHunterSchaub2002,
  author    = {Delgrande, James Patrick and Hunter, Anthony and Schaub, Torsten H.},
  title     = {COBA: a consistency-based belief revision system},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{SchaubWang2002,
  author    = {Schaub, Torsten H. and Wang, T.},
  title     = {Preferred well-founded semantics for logic programming by alternating fixpoints : preliminary report},
  year      = {2002},
  language  = {en}
}
@article{GebserObermeierSchaubetal.2018,
  author    = {Gebser, Martin and Obermeier, Philipp and Schaub, Torsten H. and Ratsch-Heitmann, Michel and Runge, Mario},
  title     = {Routing driverless transport vehicles in car assembly with answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {18},
  journal   = {Theory and practice of logic programming},
  number    = {3-4},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068418000182},
  pages     = {520 -- 534},
  year      = {2018},
  abstract  = {Automated storage and retrieval systems are principal components of modern production and warehouse facilities. In particular, automated guided vehicles nowadays substitute human-operated pallet trucks in transporting production materials between storage locations and assembly stations. While low-level control systems take care of navigating such driverless vehicles along programmed routes and avoid collisions even under unforeseen circumstances, in the common case of multiple vehicles sharing the same operation area, the problem remains how to set up routes such that a collection of transport tasks is accomplished most effectively. We address this prevalent problem in the context of car assembly at Mercedes-Benz Ludwigsfelde GmbH, a large-scale producer of commercial vehicles, where routes for automated guided vehicles used in the production process have traditionally been hand-coded by human engineers. Such adhoc methods may suffice as long as a running production process remains in place, while any change in the factory layout or production targets necessitates tedious manual reconfiguration, not to mention the missing portability between different production plants. Unlike this, we propose a declarative approach based on Answer Set Programming to optimize the routes taken by automated guided vehicles for accomplishing transport tasks. The advantages include a transparent and executable problem formalization, provable optimality of routes relative to objective criteria, as well as elaboration tolerance towards particular factory layouts and production targets. Moreover, we demonstrate that our approach is efficient enough to deal with the transport tasks evolving in realistic production processes at the car factory of Mercedes-Benz Ludwigsfelde GmbH.},
  language  = {en}
}
@article{GebserKaminskiKaufmannetal.2018,
  author    = {Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and L{\"u}hne, Patrick and Obermeier, Philipp and Ostrowski, Max and Romero Davila, Javier and Schaub, Torsten H. and Schellhorn, Sebastian and Wanko, Philipp},
  title     = {The Potsdam Answer Set Solving Collection 5.0},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0528-x},
  pages     = {181 -- 182},
  year      = {2018},
  abstract  = {The Potsdam answer set solving collection, or Potassco for short, bundles various tools implementing and/or applying answer set programming. The article at hand succeeds an earlier description of the Potassco project published in Gebser et al. (AI Commun 24(2):107-124, 2011). Hence, we concentrate in what follows on the major features of the most recent, fifth generation of the ASP system clingo and highlight some recent resulting application systems.},
  language  = {en}
}
@article{HaubeltNeubauerSchaubetal.2018,
  author    = {Haubelt, Christian and Neubauer, Kai and Schaub, Torsten H. and Wanko, Philipp},
  title     = {Design space exploration with answer set programming},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0530-3},
  pages     = {205 -- 206},
  year      = {2018},
  abstract  = {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.},
  language  = {en}
}
@misc{LifschitzSchaubWoltran2018,
  author    = {Lifschitz, Vladimir and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Vladimir Lifschitz},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0552-x},
  pages     = {213 -- 218},
  year      = {2018},
  abstract  = {This interview with Vladimir Lifschitz was conducted by Torsten Schaub at the University of Texas at Austin in August 2017. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@misc{BrewkaSchaubWoltran2018,
  author    = {Brewka, Gerhard and Schaub, Torsten H. and Woltran, Stefan},
  title     = {Interview with Gerhard Brewka},
  series = {K{\"u}nstliche Intelligenz},
  volume    = {32},
  journal   = {K{\"u}nstliche Intelligenz},
  number    = {2-3},
  publisher = {Springer},
  address   = {Heidelberg},
  issn      = {0933-1875},
  doi       = {10.1007/s13218-018-0549-5},
  pages     = {219 -- 221},
  year      = {2018},
  abstract  = {This interview with Gerhard Brewka was conducted by correspondance in May 2018. The question set was compiled by Torsten Schaub and Stefan Woltran.},
  language  = {en}
}
@article{DimopoulosGebserLuehneetal.2019,
  author    = {Dimopoulos, Yannis and Gebser, Martin and L{\"u}hne, Patrick and Romero Davila, Javier and Schaub, Torsten H.},
  title     = {plasp 3},
  series = {Theory and practice of logic programming},
  volume    = {19},
  journal   = {Theory and practice of logic programming},
  number    = {3},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068418000583},
  pages     = {477 -- 504},
  year      = {2019},
  abstract  = {We describe the new version of the Planning Domain Definition Language (PDDL)-to-Answer Set Programming (ASP) translator plasp. First, it widens the range of accepted PDDL features. Second, it contains novel planning encodings, some inspired by Satisfiability Testing (SAT) planning and others exploiting ASP features such as well-foundedness. All of them are designed for handling multivalued fluents in order to capture both PDDL as well as SAS planning formats. Third, enabled by multishot ASP solving, it offers advanced planning algorithms also borrowed from SAT planning. As a result, plasp provides us with an ASP-based framework for studying a variety of planning techniques in a uniform setting. Finally, we demonstrate in an empirical analysis that these techniques have a significant impact on the performance of ASP planning.},
  language  = {en}
}
@misc{NeubauerHaubeltWankoetal.2018,
  author    = {Neubauer, Kai and Haubelt, Christian and Wanko, Philipp and Schaub, Torsten H.},
  title     = {Utilizing quad-trees for efficient design space exploration with partial assignment evaluation},
  series = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  journal   = {2018 23rd Asia and South Pacific Design Automation Conference (ASP-DAC)},
  publisher = {IEEE},
  address   = {New York},
  isbn      = {978-1-5090-0602-1},
  issn      = {2153-6961},
  doi       = {10.1109/ASPDAC.2018.8297362},
  pages     = {434 -- 439},
  year      = {2018},
  abstract  = {Recently, it has been shown that constraint-based symbolic solving techniques offer an efficient way for deciding binding and routing options in order to obtain a feasible system level implementation. In combination with various background theories, a feasibility analysis of the resulting system may already be performed on partial solutions. That is, infeasible subsets of mapping and routing options can be pruned early in the decision process, which fastens the solving accordingly. However, allowing a proper design space exploration including multi-objective optimization also requires an efficient structure for storing and managing non-dominated solutions. In this work, we propose and study the usage of the Quad-Tree data structure in the context of partial assignment evaluation during system synthesis. Out experiments show that unnecessary dominance checks can be avoided, which indicates a preference of Quad-Trees over a commonly used list-based implementation for large combinatorial optimization problems.},
  language  = {en}
}
@article{FriouxSchaubSchellhornetal.2019,
  author    = {Frioux, Cl{\´e}mence and Schaub, Torsten H. and Schellhorn, Sebastian and Siegel, Anne and Wanko, Philipp},
  title     = {Hybrid metabolic network completion},
  series = {Theory and practice of logic programming},
  volume    = {19},
  journal   = {Theory and practice of logic programming},
  number    = {1},
  publisher = {Cambridge University Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068418000455},
  pages     = {83 -- 108},
  year      = {2019},
  abstract  = {Metabolic networks play a crucial role in biology since they capture all chemical reactions in an organism. While there are networks of high quality for many model organisms, networks for less studied organisms are often of poor quality and suffer from incompleteness. To this end, we introduced in previous work an answer set programming (ASP)-based approach to metabolic network completion. Although this qualitative approach allows for restoring moderately degraded networks, it fails to restore highly degraded ones. This is because it ignores quantitative constraints capturing reaction rates. To address this problem, we propose a hybrid approach to metabolic network completion that integrates our qualitative ASP approach with quantitative means for capturing reaction rates. We begin by formally reconciling existing stoichiometric and topological approaches to network completion in a unified formalism. With it, we develop a hybrid ASP encoding and rely upon the theory reasoning capacities of the ASP system dingo for solving the resulting logic program with linear constraints over reals. We empirically evaluate our approach by means of the metabolic network of Escherichia coli. Our analysis shows that our novel approach yields greatly superior results than obtainable from purely qualitative or quantitative approaches.},
  language  = {en}
}
@article{BanbaraInoueKaufmannetal.2018,
  author    = {Banbara, Mutsunori and Inoue, Katsumi and Kaufmann, Benjamin and Okimoto, Tenda and Schaub, Torsten H. and Soh, Takehide and Tamura, Naoyuki and Wanko, Philipp},
  title     = {teaspoon},
  series = {Annals of operation research},
  volume    = {275},
  journal   = {Annals of operation research},
  number    = {1},
  publisher = {Springer},
  address   = {Dordrecht},
  issn      = {0254-5330},
  doi       = {10.1007/s10479-018-2757-7},
  pages     = {3 -- 37},
  year      = {2018},
  abstract  = {Answer Set Programming (ASP) is an approach to declarative problem solving, combining a rich yet simple modeling language with high performance solving capacities. We here develop an ASP-based approach to curriculum-based course timetabling (CB-CTT), one of the most widely studied course timetabling problems. The resulting teaspoon system reads a CB-CTT instance of a standard input format and converts it into a set of ASP facts. In turn, these facts are combined with a first-order encoding for CB-CTT solving, which can subsequently be solved by any off-the-shelf ASP systems. We establish the competitiveness of our approach by empirically contrasting it to the best known bounds obtained so far via dedicated implementations. Furthermore, we extend the teaspoon system to multi-objective course timetabling and consider minimal perturbation problems.},
  language  = {en}
}
@article{BrainFaberMarateaetal.2007,
  author    = {Brain, Martin and Faber, Wolfgang and Maratea, Marco and Polleres, Axel and Schaub, Torsten H. and Schindlauer, Roman},
  title     = {What should an ASP solver output? : a multiple position paper},
  year      = {2007},
  language  = {en}
}
@article{BesnardFanselowSchaub2002,
  author    = {Besnard, Philippe and Fanselow, Gisbert and Schaub, Torsten H.},
  title     = {Optimality theory as a family of cumulative logics},
  year      = {2002},
  language  = {en}
}
@article{LindauerHoosLeytonBrownetal.2017,
  author    = {Lindauer, Marius and Hoos, Holger and Leyton-Brown, Kevin and Schaub, Torsten H.},
  title     = {Automatic construction of parallel portfolios via algorithm configuration},
  series = {Artificial intelligence},
  volume    = {244},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2016.05.004},
  pages     = {272 -- 290},
  year      = {2017},
  abstract  = {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.},
  language  = {en}
}
@article{CabalarDieguezSchaubetal.2020,
  author    = {Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten H. and Schuhmann, Anna},
  title     = {Towards metric temporal answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {5},
  publisher = {Cambridge Univ. Press},
  address   = {Cambridge [u.a.]},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000307},
  pages     = {783 -- 798},
  year      = {2020},
  abstract  = {We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.},
  language  = {en}
}
@article{BibelBrueningOttenetal.1998,
  author    = {Bibel, Wolfgang and Br{\"u}ning, Stefan and Otten, Jens and Rath, Thomas and Schaub, Torsten H.},
  title     = {Compressions and extensions},
  year      = {1998},
  language  = {en}
}
@article{DelgrandeSchaub1997,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Compiling specificity into approaches to nonmonotonic reasoning},
  issn      = {0004-3702},
  year      = {1997},
  language  = {en}
}
@article{LinkeSchaub1997,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Towards a classification of default logic},
  year      = {1997},
  language  = {en}
}
@article{SchaubBruening1996,
  author    = {Schaub, Torsten H. and Br{\"u}ning, Stefan},
  title     = {Prolog technology for default reasoning},
  isbn      = {0-471-96809-9},
  year      = {1996},
  language  = {en}
}
@article{BesnardSchaub1996,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {A simple signed system for paraconsistent reasoning},
  isbn      = {3-540-61630-6},
  year      = {1996},
  language  = {en}
}
@article{SchaubThielscher1996,
  author    = {Schaub, Torsten H. and Thielscher, Michael},
  title     = {Skeptical query-answering in constrained default logic},
  isbn      = {3-540-61313-7},
  year      = {1996},
  language  = {en}
}
@article{SchaubBrueningNicolas1996,
  author    = {Schaub, Torsten H. and Br{\"u}ning, Stefan and Nicolas, Pascal},
  title     = {XRay : a prolog technology theorem prover for default reasoning: a system description},
  isbn      = {3-540-61511-3},
  year      = {1996},
  language  = {en}
}
@article{LinkeSchaub1996,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Putting default logics in perspective},
  isbn      = {3-540-61708-6},
  year      = {1996},
  language  = {en}
}