@article{BibelBrueningOttenetal.1998,
  author    = {Bibel, Wolfgang and Br{\"u}ning, Stefan and Otten, Jens and Rath, Thomas and Schaub, Torsten},
  title     = {Compressions and extensions},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Characterization of non-monotone non-constructive systems},
  issn      = {1012-2443},
  year      = {1998},
  language  = {en}
}
@article{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Signed systems for paraconsistent reasoning},
  issn      = {0168-7433},
  year      = {1998},
  language  = {en}
}
@article{SchaubBruening1998,
  author    = {Schaub, Torsten and Br{\"u}ning, Stefan},
  title     = {Prolog technology for default reasoning : proof theory and compilation techniques},
  year      = {1998},
  language  = {en}
}
@article{Schaub1998,
  author    = {Schaub, Torsten},
  title     = {The family of default logics},
  year      = {1998},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2013,
  author    = {Delgrande, James and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {A model-theoretic approach to belief change in answer set programming},
  series = {ACM transactions on computational logic},
  volume    = {14},
  journal   = {ACM transactions on computational logic},
  number    = {2},
  publisher = {Association for Computing Machinery},
  address   = {New York},
  issn      = {1529-3785},
  doi       = {10.1145/2480759.2480766},
  pages     = {46},
  year      = {2013},
  abstract  = {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.},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A general framework for expressing preferences in causal reasoning and planning},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exm046},
  year      = {2007},
  abstract  = {We consider the problem of representing arbitrary preferences in causal reasoning and planning systems. In planning, a preference may be seen as a goal or constraint that is desirable, but not necessary, to satisfy. To begin, we define a very general query language for histories, or interleaved sequences of world states and actions. Based on this, we specify a second language in which preferences are defined. A single preference defines a binary relation on histories, indicating that one history is preferred to the other. From this, one can define global preference orderings on the set of histories, the maximal elements of which are the preferred histories. The approach is very general and flexible; thus it constitutes a base language in terms of which higher-level preferences may be defined. To this end, we investigate two fundamental types of preferences that we call choice and temporal preferences. We consider concrete strategies for these types of preferences and encode them in terms of our framework. We suggest how to express aggregates in the approach, allowing, e.g. the expression of a preference for histories with lowest total action costs. Last, our approach can be used to express other approaches and so serves as a common framework in which such approaches can be expressed and compared. We illustrate this by indicating how an approach due to Son and Pontelli can be encoded in our approach, as well as the language PDDL3.},
  language  = {en}
}
@article{GebserSchaubThieleetal.2011,
  author    = {Gebser, Martin and Schaub, Torsten 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{GebserKaminskiSchaub2011,
  author    = {Gebser, Martin and Kaminski, Roland and Schaub, Torsten},
  title     = {Complex optimization in answer set programming},
  series = {Theory and practice of logic programming},
  volume    = {11},
  journal   = {Theory and practice of logic programming},
  number    = {3},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068411000329},
  pages     = {821 -- 839},
  year      = {2011},
  abstract  = {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.},
  language  = {en}
}
@article{GebserGharibMerceretal.2009,
  author    = {Gebser, Martin and Gharib, Mona and Mercer, Robert E. and Schaub, Torsten},
  title     = {Monotonic answer set programming},
  issn      = {0955-792X},
  doi       = {10.1093/logcom/exn040},
  year      = {2009},
  abstract  = {Answer set programming (ASP) does not allow for incrementally constructing answer sets or locally validating constructions like proofs by only looking at a part of the given program. In this article, we elaborate upon an alternative approach to ASP that allows for incremental constructions. Our approach draws its basic intuitions from the area of default logics. We investigate the feasibility of the concept of semi-monotonicity known from default logics as a basis of incrementality. On the one hand, every logic program has at least one answer set in our alternative setting, which moreover can be constructed incrementally based on generating rules. On the other hand, the approach may produce answer sets lacking characteristic properties of standard answer sets, such as being a model of the given program. We show how integrity constraints can be used to re-establish such properties, even up to correspondence with standard answer sets. Furthermore, we develop an SLD-like proof procedure for our incremental approach to ASP, which allows for query-oriented computations. Also, we provide a characterization of our definition of answer sets via a modification of Clarks completion. Based on this notion of program completion, we present an algorithm for computing the answer sets of a logic program in our approach.},
  language  = {en}
}
@article{GebserKaufmannSchaub2012,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten},
  title     = {Multi-threaded ASP solving with clasp},
  series = {Theory and practice of logic programming},
  volume    = {12},
  journal   = {Theory and practice of logic programming},
  number    = {8},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068412000166},
  pages     = {525 -- 545},
  year      = {2012},
  abstract  = {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.},
  language  = {en}
}
@article{HermenegildoSchaub2010,
  author    = {Hermenegildo, Manuel and Schaub, Torsten},
  title     = {Introduction to the technical communications of the 26th International Conference on Logic Programming : special issue},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068410000153},
  year      = {2010},
  language  = {en}
}
@article{DelgrandeLiuSchaubetal.2007,
  author    = {Delgrande, James Patrick and Liu, Daphne H. and Schaub, Torsten and Thiele, Sven},
  title     = {COBA 2.0 : a consistency-based belief change system},
  year      = {2007},
  language  = {en}
}
@article{GharibSchaubMercer2007,
  author    = {Gharib, Mona and Schaub, Torsten and Mercer, Robert E.},
  title     = {Incremental answer set programming : a preliminary report},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaubTompits2006,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {An Extended Query language for action languages (and its application to aggregates and preferences)},
  year      = {2006},
  language  = {en}
}
@article{KonczakLinkeSchaub2003,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {Graphs and colorings for answer set programming : abridged report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{AngerGebserSchaub2006,
  author    = {Anger, Christian and Gebser, Martin and Schaub, Torsten},
  title     = {Approaching the core of unfounded sets},
  year      = {2006},
  language  = {en}
}
@article{MileoSchaub2006,
  author    = {Mileo, Alessandra and Schaub, Torsten},
  title     = {Extending ordered disjunctions for policy enforcement : preliminary report},
  year      = {2006},
  language  = {en}
}
@article{DelgrandeSchaubTompits2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A preference-based framework for updating logic programs},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2006,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten and Thiele, Sven and Tichy, Richard},
  title     = {On probing and multi-threading in platypus},
  year      = {2006},
  language  = {en}
}
@article{GrellSchaubSelbig2006,
  author    = {Grell, Susanne and Schaub, Torsten and Selbig, Joachim},
  title     = {Modelling biological networks by action languages via set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Tableau calculi for answer set programming},
  issn      = {0302-9743},
  doi       = {10.1007/11799573},
  year      = {2006},
  language  = {en}
}
@article{GerbserSchaub2006,
  author    = {Gerbser, Martin and Schaub, Torsten},
  title     = {Characterizing (ASP) inferences by unit propagation},
  year      = {2006},
  language  = {en}
}
@phdthesis{Kaufmann2015,
  author    = {Kaufmann, Benjamin},
  title     = {High performance answer set solving},
  pages     = {182},
  year      = {2015},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {On Computing belief change operations using quantifield boolean formulas},
  issn      = {0955-792X},
  year      = {2004},
  abstract  = {In this paper, we show how an approach to belief revision and belief contraction can be axiomatized by means of quantified Boolean formulas. Specifically, we consider the approach of belief change scenarios, a general framework that has been introduced for expressing different forms of belief change. The essential idea is that for a belief change scenario (K, R, C), the set of formulas K, representing the knowledge base, is modified so that the sets of formulas R and C are respectively true in, and consistent with the result. By restricting the form of a belief change scenario, one obtains specific belief change operators including belief revision, contraction, update, and merging. For both the general approach and for specific operators, we give a quantified Boolean formula such that satisfying truth assignments to the free variables correspond to belief change extensions in the original approach. Hence, we reduce the problem of determining the results of a belief change operation to that of satisfiability. This approach has several benefits. First, it furnishes an axiomatic specification of belief change with respect to belief change scenarios. This then leads to further insight into the belief change framework. Second, this axiomatization allows us to identify strict complexity bounds for the considered reasoning tasks. Third, we have implemented these different forms of belief change by means of existing solvers for quantified Boolean formulas. As well, it appears that this approach may be straightforwardly applied to other specific approaches to belief change},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2004,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten 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{DelgrandeGharibMerceretal.2003,
  author    = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten},
  title     = {Lukaszewicz-style answer set programming : a preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {On the relation between Reiter{\"i}s default logic and its (major) variants},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{BesnardMercerSchaub2003,
  author    = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten},
  title     = {Optimality theory throught default logic},
  isbn      = {3-540-20059-2},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten 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},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  title     = {Query-answering in prioritized default logic},
  isbn      = {3-540-66131-X},
  year      = {1999},
  language  = {en}
}
@article{LinkeSchaub1999,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {On bottom-up pre-processing techniques for automated default reasoning},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{BenhammadiNicolasSchaub1999,
  author    = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten},
  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},
  title     = {Avoiding non-ground variables},
  isbn      = {3-540-66131-x},
  year      = {1999},
  language  = {en}
}
@article{NicolasSchaub1998,
  author    = {Nicolas, Pascal and Schaub, Torsten},
  title     = {The XRay system : an implementation platform for local query-answering in default logics},
  isbn      = {3-540-65312-0},
  year      = {1998},
  language  = {en}
}
@article{BrueningSchaub1999,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten},
  title     = {A voiding non-ground variables},
  year      = {1999},
  language  = {en}
}
@book{Schaub1999,
  author    = {Schaub, Torsten},
  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{BesnardSchaub1998,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Signed systems for paraconsistent reasoning},
  year      = {1998},
  language  = {en}
}
@article{BrainGebserPuehreretal.2007,
  author    = {Brain, Martin and Gebser, Martin and P{\"u}hrer, J{\"o}rg and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {"That is illogical, Captain!" : the debugging support tool spock for answer-set programs ; system description},
  year      = {2007},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten},
  title     = {Conflict-driven answer set enumeration},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{LinkeSchaub1996,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {Putting default logics in perspective},
  isbn      = {3-540-61708-6},
  year      = {1996},
  language  = {en}
}
@article{LinkeSchaub1995,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {Lemma handling in default logic theorem provers},
  isbn      = {3540601120},
  year      = {1995},
  language  = {en}
}
@article{GebserKaufmannNeumannetal.2007,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Neumann, Andr{\´e} and Schaub, Torsten},
  title     = {Conflict-driven answer set solving},
  isbn      = {978-1-57735-323-2},
  year      = {2007},
  language  = {en}
}
@article{BesnardSchaub1993,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {A context-based framework for default logics},
  isbn      = {0-262-51071-5},
  year      = {1993},
  language  = {en}
}
@article{GebserGharibSchaub2007,
  author    = {Gebser, Martin and Gharib, Mona and Schaub, Torsten},
  title     = {Incremental answer sets and their computation},
  year      = {2007},
  language  = {en}
}
@article{GebserSchaub2007,
  author    = {Gebser, Martin and Schaub, Torsten},
  title     = {Generic tableaux for answer set programming},
  year      = {2007},
  language  = {en}
}
@article{DelgrandeSchaub2007,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {A consistency-based framework for merging knowledge bases},
  issn      = {1570-8683},
  year      = {2007},
  language  = {en}
}
@article{KonczakLinkeSchaub2006,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {Graphs and colorings for answer set programming},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068405002528},
  year      = {2006},
  abstract  = {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},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2006,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten and Thiele, Sven and Tichy, Richard},
  title     = {On probing and multi-threading in platypus},
  year      = {2006},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{GressmannJanhunenMerceretal.2005,
  author    = {Gressmann, Jean and Janhunen, Tomi and Mercer, Robert E. and Schaub, Torsten and Thiele, Sven and Tichy, Richard},
  title     = {Platypus : a platform for distributed answer set solving},
  year      = {2005},
  language  = {en}
}
@article{SarsakovSchaubTompitsetal.2004,
  author    = {Sarsakov, Vladimir and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {A compiler for nested logic programming},
  isbn      = {3-540- 20721-x},
  year      = {2004},
  language  = {en}
}
@article{GebserLiuNamasivayametal.2007,
  author    = {Gebser, Martin and Liu, Lengning and Namasivayam, Gayathri and Neumann, Andr{\´e} and Schaub, Torsten and Truszczynski, Miroslaw},
  title     = {The first answer set programming system competition},
  isbn      = {978-3-540- 72199-4},
  year      = {2007},
  language  = {en}
}
@article{AngerGebserLinkeetal.2005,
  author    = {Anger, Christian and Gebser, Martin and Linke, Thomas and Neumann, Andre and Schaub, Torsten},
  title     = {The nomore++ approach to answer set solving},
  year      = {2005},
  language  = {en}
}
@article{AngerKonczakLinkeetal.2005,
  author    = {Anger, Christian and Konczak, Kathrin and Linke, Thomas and Schaub, Torsten},
  title     = {A Glimpse of Answer Set Programming},
  issn      = {0170-4516},
  year      = {2005},
  language  = {en}
}
@article{GrellKonczakSchaub2005,
  author    = {Grell, Susanne and Konczak, Kathrin and Schaub, Torsten},
  title     = {nomore) : a system for computing preferred Answer Sets},
  issn      = {0302-9743},
  year      = {2005},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten 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{BesnardSchaubTompitsetal.2003,
  author    = {Besnard, Philippe and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeHunterSchaub2002,
  author    = {Delgrande, James Patrick and Hunter, Anthony and Schaub, Torsten},
  title     = {COBA: a consistency-based belief revision system},
  isbn      = {3-540-44190-5},
  year      = {2002},
  language  = {en}
}
@article{FloeterNicolasSchaubetal.2003,
  author    = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten and Selbig, Joachim},
  title     = {Threshold extraction in metabolite concentration data},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2002,
  author    = {Schaub, Torsten and Wang, T.},
  title     = {Preferred well-founded semantics for logic programming by alternating fixpoints : preliminary report},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{BesnardFanselowSchaub2002,
  author    = {Besnard, Philippe and Fanselow, Gisbert and Schaub, Torsten},
  title     = {Optimality theory as a family of cumulative logics},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeSchaub2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2002},
  language  = {en}
}
@article{Schaub2003,
  author    = {Schaub, Torsten},
  title     = {Antwortmengenprogrammierung},
  year      = {2003},
  language  = {de}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A compilation of Brewka and Eiter's approach to prioritizationtion},
  isbn      = {3-540-41131-3},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {Logic programs with compiled preferences},
  isbn      = {1-58603-013-2},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {A consistency-based model for belief change: preliminary report},
  isbn      = {0-262-51112-6},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Significant inferences},
  isbn      = {1-55860-690-4},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {Logic programs with compiled preferences},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaubTompits2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten and Tompits, Hans},
  title     = {A compiler for ordered logic programs},
  year      = {2000},
  language  = {en}
}
@article{BesnardSchaub2000,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {What is a (non-constructive) non-monotone logical system?},
  issn      = {0304-3975},
  year      = {2000},
  language  = {en}
}
@article{BrueningSchaub2000,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten},
  title     = {A connection calculus for handling incomplete information},
  year      = {2000},
  language  = {en}
}
@article{DelgrandeSchaub2000,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Expressing preferences in default logic},
  issn      = {0004-3702},
  year      = {2000},
  language  = {en}
}
@article{SchaubNicolas1997,
  author    = {Schaub, Torsten and Nicolas, Pascal},
  title     = {An implementation platform for query-answering in default logics : the XRay system, its implementation and evaluation},
  isbn      = {3-540-63255-7},
  year      = {1997},
  language  = {en}
}
@article{SchaubNicolas1997,
  author    = {Schaub, Torsten and Nicolas, Pascal},
  title     = {An implementation platform for query-answering in default logics : theoretical underpinnings},
  isbn      = {3-540-63614-5},
  year      = {1997},
  language  = {en}
}
@article{DelgrandeSchaub1997,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Compiling reasoning with and about preferences into default logic},
  isbn      = {1-558-60480-4},
  issn      = {1045-0823},
  year      = {1997},
  language  = {en}
}
@article{SchaubThielscher1996,
  author    = {Schaub, Torsten and Thielscher, Michael},
  title     = {Skeptical query-answering in constrained default logic},
  isbn      = {3-540-61313-7},
  year      = {1996},
  language  = {en}
}
@article{BrueningSchaub1996,
  author    = {Br{\"u}ning, Stefan and Schaub, Torsten},
  title     = {A model-based approach to consistency-checking},
  isbn      = {3-540-61286-6},
  year      = {1996},
  language  = {en}
}
@article{BesnardSchaub1997,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {Circumscribing inconsistency},
  isbn      = {1-558-60480-4},
  issn      = {1045-0823},
  year      = {1997},
  language  = {en}
}
@article{SchaubBruening1996,
  author    = {Schaub, Torsten and Br{\"u}ning, Stefan},
  title     = {Prolog technology for default reasoning},
  isbn      = {0-471-96809-9},
  year      = {1996},
  language  = {en}
}
@article{DelgrandeSchaub1997,
  author    = {Delgrande, James Patrick and Schaub, Torsten},
  title     = {Compiling specificity into approaches to nonmonotonic reasoning},
  issn      = {0004-3702},
  year      = {1997},
  language  = {en}
}
@article{LinkeSchaub1997,
  author    = {Linke, Thomas and Schaub, Torsten},
  title     = {Towards a classification of default logic},
  year      = {1997},
  language  = {en}
}
@article{VidelaGuziolowskiEduatietal.2015,
  author    = {Videla, Santiago and Guziolowski, Carito and Eduati, Federica and Thiele, Sven and Gebser, Martin and Nicolas, Jacques and Saez-Rodriguez, Julio and Schaub, Torsten and Siegel, Anne},
  title     = {Learning Boolean logic models of signaling networks with ASP},
  series = {Theoretical computer science},
  volume    = {599},
  journal   = {Theoretical computer science},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0304-3975},
  doi       = {10.1016/j.tcs.2014.06.022},
  pages     = {79 -- 101},
  year      = {2015},
  abstract  = {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.},
  language  = {en}
}
@article{HoosKaminskiLindaueretal.2015,
  author    = {Hoos, Holger and Kaminski, Roland and Lindauer, Marius and Schaub, Torsten},
  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{GebserKaufmannKaminskietal.2011,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Kaminski, Roland and Ostrowski, Max and Schaub, Torsten 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{CabalarFandinoSchaubetal.2019,
  author    = {Cabalar, Pedro and Fandi{\~n}o, Jorge and Schaub, Torsten 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}
}
@phdthesis{Videla2014,
  author    = {Videla, Santiago},
  title     = {Reasoning on the response of logical signaling networks with answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-71890},
  school      = {Universit{\"a}t Potsdam},
  year      = {2014},
  abstract  = {Deciphering the functioning of biological networks is one of the central tasks in systems biology. In particular, signal transduction networks are crucial for the understanding of the cellular response to external and internal perturbations. Importantly, in order to cope with the complexity of these networks, mathematical and computational modeling is required. We propose a computational modeling framework in order to achieve more robust discoveries in the context of logical signaling networks. More precisely, we focus on modeling the response of logical signaling networks by means of automated reasoning using Answer Set Programming (ASP). ASP provides a declarative language for modeling various knowledge representation and reasoning problems. Moreover, available ASP solvers provide several reasoning modes for assessing the multitude of answer sets. Therefore, leveraging its rich modeling language and its highly efficient solving capacities, we use ASP to address three challenging problems in the context of logical signaling networks: learning of (Boolean) logical networks, experimental design, and identification of intervention strategies. Overall, the contribution of this thesis is three-fold. Firstly, we introduce a mathematical framework for characterizing and reasoning on the response of logical signaling networks. Secondly, we contribute to a growing list of successful applications of ASP in systems biology. Thirdly, we present a software providing a complete pipeline for automated reasoning on the response of logical signaling networks.},
  language  = {en}
}
@article{DimopoulosGebserLuehneetal.2019,
  author    = {Dimopoulos, Yannis and Gebser, Martin and L{\"u}hne, Patrick and Romero Davila, Javier and Schaub, Torsten},
  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}
}
@article{KaminskiSchaubSiegeletal.2013,
  author    = {Kaminski, Roland and Schaub, Torsten and Siegel, Anne and Videla, Santiago},
  title     = {Minimal intervention strategies in logical signaling networks with ASP},
  series = {Theory and practice of logic programming},
  volume    = {13},
  journal   = {Theory and practice of logic programming},
  publisher = {Cambridge Univ. Press},
  address   = {New York},
  issn      = {1471-0684},
  doi       = {10.1017/S1471068413000422},
  pages     = {675 -- 690},
  year      = {2013},
  abstract  = {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.},
  language  = {en}
}
@article{SchaubBrueningNicolas1996,
  author    = {Schaub, Torsten 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{BesnardSchaub1996,
  author    = {Besnard, Philippe and Schaub, Torsten},
  title     = {A simple signed system for paraconsistent reasoning},
  isbn      = {3-540-61630-6},
  year      = {1996},
  language  = {en}
}
@article{GebserSchaubTompitsetal.2007,
  author    = {Gebser, Martin and Schaub, Torsten and Tompits, Hans and Woltran, Stefan},
  title     = {Alternative characterizations for program equivalence under aswer-set semantics : a preliminary report},
  year      = {2007},
  language  = {en}
}
@phdthesis{Konczak2007,
  author    = {Konczak, Kathrin},
  title     = {Preferences in answer set programming},
  url       = {http://nbn-resolving.de/urn:nbn:de:kobv:517-opus-12058},
  school      = {Universit{\"a}t Potsdam},
  year      = {2007},
  abstract  = {Answer Set Programming (ASP) emerged in the late 1990s as a new logic programming paradigm, having its roots in nonmonotonic reasoning, deductive databases, and logic programming with negation as failure. The basic idea of ASP is to represent a computational problem as a logic program whose answer sets correspond to solutions, and then to use an answer set solver for finding answer sets of the program. ASP is particularly suited for solving NP-complete search problems. Among these, we find applications to product configuration, diagnosis, and graph-theoretical problems, e.g. finding Hamiltonian cycles. On different lines of ASP research, many extensions of the basic formalism have been proposed. The most intensively studied one is the modelling of preferences in ASP. They constitute a natural and effective way of selecting preferred solutions among a plethora of solutions for a problem. For example, preferences have been successfully used for timetabling, auctioning, and product configuration. In this thesis, we concentrate on preferences within answer set programming. Among several formalisms and semantics for preference handling in ASP, we concentrate on ordered logic programs with the underlying D-, W-, and B-semantics. In this setting, preferences are defined among rules of a logic program. They select preferred answer sets among (standard) answer sets of the underlying logic program. Up to now, those preferred answer sets have been computed either via a compilation method or by meta-interpretation. Hence, the question comes up, whether and how preferences can be integrated into an existing ASP solver. To solve this question, we develop an operational graph-based framework for the computation of answer sets of logic programs. Then, we integrate preferences into this operational approach. We empirically observe that our integrative approach performs in most cases better than the compilation method or meta-interpretation. Another research issue in ASP are optimization methods that remove redundancies, as also found in database query optimizers. For these purposes, the rather recently suggested notion of strong equivalence for ASP can be used. If a program is strongly equivalent to a subprogram of itself, then one can always use the subprogram instead of the original program, a technique which serves as an effective optimization method. Up to now, strong equivalence has not been considered for logic programs with preferences. In this thesis, we tackle this issue and generalize the notion of strong equivalence to ordered logic programs. We give necessary and sufficient conditions for the strong equivalence of two ordered logic programs. Furthermore, we provide program transformations for ordered logic programs and show in how far preferences can be simplified. Finally, we present two new applications for preferences within answer set programming. First, we define new procedures for group decision making, which we apply to the problem of scheduling a group meeting. As a second new application, we reconstruct a linguistic problem appearing in German dialects within ASP. Regarding linguistic studies, there is an ongoing debate about how unique the rule systems of language are in human cognition. The reconstruction of grammatical regularities with tools from computer science has consequences for this debate: if grammars can be modelled this way, then they share core properties with other non-linguistic rule systems.},
  language  = {en}
}
@article{GebserObermeierSchaubetal.2018,
  author    = {Gebser, Martin and Obermeier, Philipp and Schaub, Torsten 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{LindauerHoosLeytonBrownetal.2017,
  author    = {Lindauer, Marius and Hoos, Holger and Leyton-Brown, Kevin and Schaub, Torsten},
  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{GebserKaufmannSchaub2012,
  author    = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten},
  title     = {Conflict-driven answer set solving: From theory to practice},
  series = {Artificial intelligence},
  volume    = {187},
  journal   = {Artificial intelligence},
  number    = {8},
  publisher = {Elsevier},
  address   = {Amsterdam},
  issn      = {0004-3702},
  doi       = {10.1016/j.artint.2012.04.001},
  pages     = {52 -- 89},
  year      = {2012},
  abstract  = {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.},
  language  = {en}
}