@article{GebserSchaubThieleetal.2011,
  author    = {Gebser, Martin and Schaub, Torsten H. and Thiele, Sven and Veber, Philippe},
  title     = {Detecting inconsistencies in large biological networks with answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {11},
  journal   = {Theory and practice of logic programming},
  number    = {5-6},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068410000554},
  pages     = {323 -- 360},
  year      = {2011},
  abstract  = {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.},
  language  = {en}
}
@article{GebserKaufmannKaminskietal.2011,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Kaminski, Roland and Ostrowski, Max and Schaub, Torsten H. and Schneider, Marius},
  title     = {Potassco the Potsdam answer set solving collection},
  series = {AI communications : AICOM ; the European journal on artificial intelligence},
  volume    = {24},
  journal   = {AI communications : AICOM ; the European journal on artificial intelligence},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0921-7126},
  doi       = {10.3233/AIC-2011-0491},
  pages     = {107 -- 124},
  year      = {2011},
  abstract  = {This paper gives an overview of the open source project Potassco, the Potsdam Answer Set Solving Collection, bundling tools for Answer Set Programming developed at the University of Potsdam.},
  language  = {en}
}
@article{GebserSabuncuSchaub2011,
  author    = {Gebser, Martin and Sabuncu, Orkunt and Schaub, Torsten H.},
  title     = {An incremental answer set programming based system for finite model computation},
  series = {AI communications : AICOM ; the European journal on artificial intelligence},
  volume    = {24},
  journal   = {AI communications : AICOM ; the European journal on artificial intelligence},
  number    = {2},
  publisher = {IOS Press},
  address   = {Amsterdam},
  issn      = {0921-7126},
  doi       = {10.3233/AIC-2011-0496},
  pages     = {195 -- 212},
  year      = {2011},
  abstract  = {We address the problem of Finite Model Computation (FMC) of first-order theories and show that FMC can efficiently and transparently be solved by taking advantage of a recent extension of Answer Set Programming (ASP), called incremental Answer Set Programming (iASP). The idea is to use the incremental parameter in iASP programs to account for the domain size of a model. The FMC problem is then successively addressed for increasing domain sizes until an answer set, representing a finite model of the original first-order theory, is found. We implemented a system based on the iASP solver iClingo and demonstrate its competitiveness by showing that it slightly outperforms the winner of the FNT division of CADE's 2009 Automated Theorem Proving (ATP) competition on the respective benchmark collection.},
  language  = {en}
}
@article{LindauerHoosHutteretal.2015,
  author    = {Lindauer, Marius and Hoos, Holger H. and Hutter, Frank and Schaub, Torsten H.},
  title     = {An automatically configured algorithm selector},
  series = {The journal of artificial intelligence research},
  volume    = {53},
  journal   = {The journal of artificial intelligence research},
  publisher = {AI Access Foundation},
  address   = {Marina del Rey},
  issn      = {1076-9757},
  pages     = {745 -- 778},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@article{HoosKaminskiLindaueretal.2015,
  author    = {Hoos, Holger and Kaminski, Roland and Lindauer, Marius and Schaub, Torsten H.},
  title     = {aspeed: Solver scheduling via answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {15},
  journal   = {Theory and practice of logic programming},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068414000015},
  pages     = {117 -- 142},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@article{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaub2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {How to reason credulously and skeptically within a single extension.},
  isbn      = {3-540- 42464-4},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaubTompits2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A generic compiler for ordered logic programs},
  isbn      = {3-540-42593-4},
  year      = {2001},
  language  = {en}
}
@article{SchaubWang2001,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A comparative study of logic programs with preference},
  isbn      = {1-558-60777-3},
  issn      = {1045-0823},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaub2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {How to reason credulously and skeptically within a single extension},
  year      = {2001},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {Significant inferences},
  isbn      = {1-55860-690-4},
  year      = {2000},
  language  = {en}
}
@article{LinkeSchaub2000,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {Alternative foundations for Reiter's default logic.},
  issn      = {0004-3702},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten H.},
  title     = {What is a (non-constructive) non-monotone logical system?},
  issn      = {0304-3975},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {The role of default logic in knowledge representation},
  isbn      = {0-7923-7224-7},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Expressing preferences in default logic},
  issn      = {0004-3702},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compilation of Brewka and Eiter's approach to prioritizationtion},
  isbn      = {3-540-41131-3},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {Logic programs with compiled preferences},
  isbn      = {1-58603-013-2},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {Logic programs with compiled preferences},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A consistency-based model for belief change: preliminary report},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A compiler for ordered logic programs},
  year      = {2000},
  language  = {en}
}
@article{BrueningSchaub2000,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A connection calculus for handling incomplete information},
  year      = {2000},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {Avoiding non-ground variables},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten H.},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@book{Schaub1999,
  author    = {Schaub, Torsten H.},
  title     = {The automation of reasoning with incomplete information : from semantic foundations to efficient computation},
  series = {Lecture notes in computer science},
  volume    = {1409},
  journal   = {Lecture notes in computer science},
  publisher = {Springer},
  address   = {Berlin},
  isbn      = {3-540-64515-2},
  doi       = {10.1007/BFb0054963},
  pages     = {XI, 159 S.},
  year      = {1999},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten H.},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten H.},
  title     = {A voiding non-ground variables},
  year      = {1999},
  language  = {en}
}
@article{LinkeSchaub1999,
  author    = {Linke, Thomas and Schaub, Torsten H.},
  title     = {On bottom-up pre-processing techniques for automated default reasoning},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{BrewkaEllmauthalerKernIsberneretal.2018,
  author    = {Brewka, Gerhard and Ellmauthaler, Stefan and Kern-Isberner, Gabriele and Obermeier, Philipp and Ostrowski, Max and Romero, Javier and Schaub, Torsten H. and Schieweck, Steffen},
  title     = {Advanced solving technology for dynamic and reactive applications},
  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-0538-8},
  pages     = {199 -- 200},
  year      = {2018},
  language  = {en}
}
@article{BanbaraSohTamuraetal.2013,
  author    = {Banbara, Mutsunori and Soh, Takehide and Tamura, Naoyuki and Inoue, Katsumi and Schaub, Torsten H.},
  title     = {Answer set programming as a modeling language for course timetabling},
  series = {Theory and practice of logic programming},
  volume    = {13},
  journal   = {Theory and practice of logic programming},
  number    = {2},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068413000495},
  pages     = {783 -- 798},
  year      = {2013},
  abstract  = {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.},
  language  = {en}
}
@misc{BosserCabalarDieguezetal.2018,
  author    = {Bosser, Anne-Gwenn and Cabalar, Pedro and Dieguez, Martin and Schaub, Torsten H.},
  title     = {Introducing temporal stable models for linear dynamic logic},
  series = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  journal   = {16th International Conference on Principles of Knowledge Representation and Reasoning},
  publisher = {ASSOC Association for the Advancement of Artificial Intelligence},
  address   = {Palo Alto},
  pages     = {12 -- 21},
  year      = {2018},
  abstract  = {We propose a new temporal extension of the logic of Here-and-There (HT) and its equilibria obtained by combining it with dynamic logic over (linear) traces. Unlike previous temporal extensions of HT based on linear temporal logic, the dynamic logic features allow us to reason about the composition of actions. For instance, this can be used to exercise fine grained control when planning in robotics, as exemplified by GOLOG. In this paper, we lay the foundations of our approach, and refer to it as Linear Dynamic Equilibrium Logic, or simply DEL. We start by developing the formal framework of DEL and provide relevant characteristic results. Among them, we elaborate upon the relationships to traditional linear dynamic logic and previous temporal extensions of HT.},
  language  = {en}
}
@article{FandinoLifschitzLuehneetal.2020,
  author    = {Fandi{\~n}o, Jorge and Lifschitz, Vladimir and L{\"u}hne, Patrick and Schaub, Torsten H.},
  title     = {Verifying tight logic programs with Anthem and Vampire},
  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/S1471068420000344},
  pages     = {735 -- 750},
  year      = {2020},
  abstract  = {This paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.},
  language  = {en}
}
@article{CabalarFandinoGareaetal.2020,
  author    = {Cabalar, Pedro and Fandi{\~n}o, Jorge and Garea, Javier and Romero, Javier and Schaub, Torsten H.},
  title     = {Eclingo},
  series = {Theory and practice of logic programming},
  volume    = {20},
  journal   = {Theory and practice of logic programming},
  number    = {6},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068420000228},
  pages     = {834 -- 847},
  year      = {2020},
  abstract  = {We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set Programming system clingo. The input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. The eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. This process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.},
  language  = {en}
}
@article{CabalarFandinoSchaubetal.2019,
  author    = {Cabalar, Pedro and Fandi{\~n}o, Jorge and Schaub, Torsten H. and Schellhorn, Sebastian},
  title     = {Gelfond-Zhang aggregates as propositional formulas},
  series = {Artificial intelligence},
  volume    = {274},
  journal   = {Artificial intelligence},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2018.10.007},
  pages     = {26 -- 43},
  year      = {2019},
  abstract  = {Answer Set Programming (ASP) has become a popular and widespread paradigm for practical Knowledge Representation thanks to its expressiveness and the available enhancements of its input language. One of such enhancements is the use of aggregates, for which different semantic proposals have been made. In this paper, we show that any ASP aggregate interpreted under Gelfond and Zhang's (GZ) semantics can be replaced (under strong equivalence) by a propositional formula. Restricted to the original GZ syntax, the resulting formula is reducible to a disjunction of conjunctions of literals but the formulation is still applicable even when the syntax is extended to allow for arbitrary formulas (including nested aggregates) in the condition. Once GZ-aggregates are represented as formulas, we establish a formal comparison (in terms of the logic of Here-and-There) to Ferraris' (F) aggregates, which are defined by a different formula translation involving nested implications. In particular, we prove that if we replace an F-aggregate by a GZ-aggregate in a rule head, we do not lose answer sets (although more can be gained). This extends the previously known result that the opposite happens in rule bodies, i.e., replacing a GZ-aggregate by an F-aggregate in the body may yield more answer sets. Finally, we characterize a class of aggregates for which GZ- and F-semantics coincide.},
  language  = {en}
}
@misc{CabalarFandinoSchaubetal.2019,
  author    = {Cabalar, Pedro and Fandi{\~n}o, Jorge and Schaub, Torsten H. and Schellhorn, Sebastian},
  title     = {Lower Bound Founded Logic of Here-and-There},
  series = {Logics in Artificial Intelligence},
  volume    = {11468},
  journal   = {Logics in Artificial Intelligence},
  publisher = {Springer},
  address   = {Cham},
  isbn      = {978-3-030-19570-0},
  issn      = {0302-9743},
  doi       = {10.1007/978-3-030-19570-0_34},
  pages     = {509 -- 525},
  year      = {2019},
  abstract  = {A distinguishing feature of Answer Set Programming is that all atoms belonging to a stable model must be founded. That is, an atom must not only be true but provably true. This can be made precise by means of the constructive logic of Here-and-There, whose equilibrium models correspond to stable models. One way of looking at foundedness is to regard Boolean truth values as ordered by letting true be greater than false. Then, each Boolean variable takes the smallest truth value that can be proven for it. This idea was generalized by Aziz to ordered domains and applied to constraint satisfaction problems. As before, the idea is that a, say integer, variable gets only assigned to the smallest integer that can be justified. In this paper, we present a logical reconstruction of Aziz' idea in the setting of the logic of Here-and-There. More precisely, we start by defining the logic of Here-and-There with lower bound founded variables along with its equilibrium models and elaborate upon its formal properties. Finally, we compare our approach with related ones and sketch future work.},
  language  = {en}
}