@article{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Two approaches to merging knowledge bases},
  isbn      = {3-540-23242-7},
  year      = {2004},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Wang, Kewen},
  title     = {Towards a classification of preference handling approaches in nonmonotonic reasoning},
  isbn      = {1-577-35166-5},
  year      = {2002},
  language  = {en}
}
@article{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{DelgrandeSchaub2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning with sets of preferences in default logic},
  issn      = {0824-7935},
  year      = {2004},
  abstract  = {We present a general approach for representing and reasoning with sets of defaults in default logic, focusing on reasoning about preferences among sets of defaults. First, we consider how to control the application of a set of defaults so that either all apply (if possible) or none do (if not). From this, an approach to dealing with preferences among sets of default rules is developed. We begin with an ordered default theory, consisting of a standard default theory, but with possible preferences on sets of rules. This theory is transformed into a second, standard default theory wherein the preferences are respected. The approach differs from other work, in that we obtain standard default theories and do not rely on prioritized versions of default logic. In practical terms this means we can immediately use existing default logic theorem provers for an implementation. Also, we directly generate just those extensions containing the most preferred applied rules; in contrast, most previous approaches generate all extensions, then select the most preferred. In a major application of the approach, we show how semimonotonic default theories can be encoded so that reasoning can be carried out at the object level. With this, we can reason about default extensions from within the framework of a standard default logic. Hence one can encode notions such as skeptical and credulous conclusions, and can reason about such conclusions within a single extension},
  language  = {en}
}
@article{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{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaub2002,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {Reasoning credulously and skeptically within a single extension},
  year      = {2002},
  language  = {en}
}
@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {On the relation between Reiter{\"i}s default logic and its (major) variants},
  isbn      = {3-540- 409494-5},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2001,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan},
  title     = {On computing solutions to belief change scenarios},
  isbn      = {3-540- 42464-4},
  year      = {2001},
  language  = {en}
}
@article{DelgrandeSchaubTompitsetal.2004,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. 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}
}