@article{BenhammadiNicolasSchaub1998, author = {Benhammadi, Farid and Nicolas, Pascal and Schaub, Torsten H.}, title = {Extension calculus and query answering in prioritized default logic}, isbn = {3-540- 64993-X}, year = {1998}, language = {en} } @article{BesnardSchaub1998, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {Signed systems for paraconsistent reasoning}, year = {1998}, language = {en} } @article{NicolasSchaub1998, author = {Nicolas, Pascal and Schaub, Torsten H.}, title = {The XRay system : an implementation platform for local query-answering in default logics}, isbn = {3-540-65312-0}, year = {1998}, language = {en} } @article{NicolasSchaub1998, author = {Nicolas, Pascal and Schaub, Torsten H.}, title = {Un cadre g{\´e}n{\´e}ral pour l'interrogation automatique en logiques des d{\´e}fauts}, year = {1998}, language = {fr} } @article{BesnardSchaub1998, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {Characterization of non-monotone non-constructive systems}, issn = {1012-2443}, year = {1998}, language = {en} } @article{SchaubBruening1998, author = {Schaub, Torsten H. and Br{\"u}ning, Stefan}, title = {Prolog technology for default reasoning : proof theory and compilation techniques}, year = {1998}, language = {en} } @article{BesnardSchaub1998, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {Signed systems for paraconsistent reasoning}, issn = {0168-7433}, year = {1998}, language = {en} } @article{Schaub1998, author = {Schaub, Torsten H.}, title = {The family of default logics}, year = {1998}, language = {en} } @article{DelgrandeSchaub1998, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {Reasoning with sets of preferences in default logic}, isbn = {3-540- 65271-x}, year = {1998}, language = {en} } @article{GebserGharibMerceretal.2009, author = {Gebser, Martin and Gharib, Mona and Mercer, Robert E. and Schaub, Torsten H.}, 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{GharibSchaubMercer2007, author = {Gharib, Mona and Schaub, Torsten H. and Mercer, Robert E.}, title = {Incremental answer set programming : a preliminary report}, year = {2007}, language = {en} } @article{DelgrandeSchaub1997, author = {Delgrande, James Patrick and Schaub, Torsten H.}, title = {Compiling reasoning with and about preferences into default logic}, isbn = {1-558-60480-4}, issn = {1045-0823}, year = {1997}, language = {en} } @article{LinkeSchaub1995, author = {Linke, Thomas and Schaub, Torsten H.}, title = {Lemma handling in default logic theorem provers}, isbn = {3540601120}, year = {1995}, language = {en} } @article{BesnardSchaub1995, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {An approach to context-based default reasoning}, issn = {0169-2968}, year = {1995}, language = {en} } @article{ThielscherSchaub1995, author = {Thielscher, Michael and Schaub, Torsten H.}, title = {Default reasoning by deductive planning}, year = {1995}, language = {en} } @article{KaminskiSchaubSiegeletal.2013, author = {Kaminski, Roland and Schaub, Torsten H. 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{SchaubNicolas1997, author = {Schaub, Torsten H. 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 H. 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{BesnardSchaub1997, author = {Besnard, Philippe and Schaub, Torsten H.}, title = {Circumscribing inconsistency}, isbn = {1-558-60480-4}, issn = {1045-0823}, year = {1997}, language = {en} } @article{HermenegildoSchaub2010, author = {Hermenegildo, Manuel and Schaub, Torsten H.}, 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{MileoSchaubMericoetal.2011, author = {Mileo, Alessandra and Schaub, Torsten H. and Merico, Davide and Bisiani, Roberto}, title = {Knowledge-based multi-criteria optimization to support indoor positioning}, series = {Annals of mathematics and artificial intelligence}, volume = {62}, journal = {Annals of mathematics and artificial intelligence}, number = {3-4}, publisher = {Springer}, address = {Dordrecht}, issn = {1012-2443}, doi = {10.1007/s10472-011-9241-2}, pages = {345 -- 370}, year = {2011}, abstract = {Indoor position estimation constitutes a central task in home-based assisted living environments. Such environments often rely on a heterogeneous collection of low-cost sensors whose diversity and lack of precision has to be compensated by advanced techniques for localization and tracking. Although there are well established quantitative methods in robotics and neighboring fields for addressing these problems, they lack advanced knowledge representation and reasoning capacities. Such capabilities are not only useful in dealing with heterogeneous and incomplete information but moreover they allow for a better inclusion of semantic information and more general homecare and patient-related knowledge. We address this problem and investigate how state-of-the-art localization and tracking methods can be combined with Answer Set Programming, as a popular knowledge representation and reasoning formalism. We report upon a case-study and provide a first experimental evaluation of knowledge-based position estimation both in a simulated as well as in a real setting.}, language = {en} } @article{DurzinskyMarwanOstrowskietal.2011, author = {Durzinsky, Markus and Marwan, Wolfgang and Ostrowski, Max and Schaub, Torsten H. and Wagler, Annegret}, title = {Automatic network reconstruction using ASP}, series = {Theory and practice of logic programming}, volume = {11}, journal = {Theory and practice of logic programming}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068411000287}, pages = {749 -- 766}, year = {2011}, abstract = {Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the degree of automation. However, available approaches often yield a single model only, rely on specific assumptions, and/or use dedicated, heuristic algorithms that are intolerant to changing circumstances or requirements in the view of the rapid progress made in Biotechnology. Our aim is to provide a declarative solution to the problem by appeal to Answer Set Programming (ASP) overcoming these difficulties. We build upon an existing approach to Automatic Network Reconstruction proposed by part of the authors. This approach has firm mathematical foundations and is well suited for ASP due to its combinatorial flavor providing a characterization of all models explaining a set of experiments. The usage of ASP has several benefits over the existing heuristic algorithms. First, it is declarative and thus transparent for biological experts. Second, it is elaboration tolerant and thus allows for an easy exploration and incorporation of biological constraints. Third, it allows for exploring the entire space of possible models. Finally, our approach offers an excellent performance, matching existing, special-purpose systems.}, language = {en} } @article{GebserKaminskiSchaub2011, author = {Gebser, Martin and Kaminski, Roland and Schaub, Torsten H.}, 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{GebserKaufmannSchaub2012, author = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten H.}, 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} } @article{OstrowskiSchaub2012, author = {Ostrowski, Max and Schaub, Torsten H.}, title = {ASP modulo CSP The clingcon system}, series = {Theory and practice of logic programming}, volume = {12}, journal = {Theory and practice of logic programming}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068412000142}, pages = {485 -- 503}, year = {2012}, abstract = {We present the hybrid ASP solver clingcon, combining the simple modeling language and the high performance Boolean solving capacities of Answer Set Programming (ASP) with techniques for using non-Boolean constraints from the area of Constraint Programming (CP). The new clingcon system features an extended syntax supporting global constraints and optimize statements for constraint variables. The major technical innovation improves the interaction between ASP and CP solver through elaborated learning techniques based on irreducible inconsistent sets. A broad empirical evaluation shows that these techniques yield a performance improvement of an order of magnitude.}, language = {en} } @article{GebserKaufmannSchaub2012, author = {Gebser, Martin and Kaufmann, Benjamin and Schaub, Torsten H.}, 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{HoosLindauerSchaub2014, author = {Hoos, Holger and Lindauer, Marius and Schaub, Torsten H.}, title = {claspfolio 2}, series = {Theory and practice of logic programming}, volume = {14}, journal = {Theory and practice of logic programming}, publisher = {Cambridge Univ. Press}, address = {New York}, issn = {1471-0684}, doi = {10.1017/S1471068414000210}, pages = {569 -- 585}, year = {2014}, abstract = {Building on the award-winning, portfolio-based ASP solver claspfolio, we present claspfolio 2, a modular and open solver architecture that integrates several different portfolio-based algorithm selection approaches and techniques. The claspfolio 2 solver framework supports various feature generators, solver selection approaches, solver portfolios, as well as solver-schedule-based pre-solving techniques. The default configuration of claspfolio 2 relies on a light-weight version of the ASP solver clasp to generate static and dynamic instance features. The flexible open design of claspfolio 2 is a distinguishing factor even beyond ASP. As such, it provides a unique framework for comparing and combining existing portfolio-based algorithm selection approaches and techniques in a single, unified framework. Taking advantage of this, we conducted an extensive experimental study to assess the impact of different feature sets, selection approaches and base solver portfolios. In addition to gaining substantial insights into the utility of the various approaches and techniques, we identified a default configuration of claspfolio 2 that achieves substantial performance gains not only over clasp's default configuration and the earlier version of claspfolio, but also over manually tuned configurations of clasp.}, 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 H. 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{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} }