@article{DelgrandeSchaub2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H.},
  title     = {A concictency-based paradigm for belief change},
  issn      = {0004-3702},
  year      = {2003},
  language  = {en}
}
@article{DelgrandeSchaubTompits2003,
  author    = {Delgrande, James Patrick and Schaub, Torsten H. and Tompits, Hans},
  title     = {A framework for compiling preferences in logic programs},
  year      = {2003},
  language  = {en}
}
@book{SogomonyanMarienfeldOcheretnijetal.2003,
  author    = {Sogomonyan, Egor S. and Marienfeld, Daniel and Ocheretnij, V. and G{\"o}ssel, Michael},
  title     = {A new self-checking sum-bit duplicated carry-select adder},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 5},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {10 S.},
  year      = {2003},
  language  = {en}
}
@article{SchaubWang2003,
  author    = {Schaub, Torsten H. and Wang, Kewen},
  title     = {A semantic framework for prefernce handling in answer set programming},
  year      = {2003},
  language  = {en}
}
@article{SchneidenbachSchnorPetri2003,
  author    = {Schneidenbach, Lars and Schnor, Bettina and Petri, Stefan},
  title     = {Architecture and Implementation of the Socket Interface on Top of GAMMA},
  isbn      = {0-7695-2037-5},
  year      = {2003},
  language  = {en}
}
@article{LanfermannSchnorSeidel2003,
  author    = {Lanfermann, Gerd and Schnor, Bettina and Seidel, Edward},
  title     = {Characterizing Grids},
  isbn      = {1-4020-7418-2},
  year      = {2003},
  abstract  = {We present a new data model approach to describe the various objects that either represent the Grid infrastructure or make use of it. The data model is based on the experiences and experiments conducted in heterogeneous Grid environments. While very sophisticated data models exist to describe and characterize e.g. compute capacities or web services, we will show that a general description, which combines {em all} of these aspects, is needed to give an adequate representation of objects on a Grid. The Grid Object Description Language (GODsL)} is a generic and extensible approach to unify the various aspects that an object on a Grid can have. GODsL provides the content for the XML based communication in Grid migration scenarios, carried out in the GridLab project. We describe the data model architecture on a general level and focus on the Grid application scenarios.},
  language  = {en}
}
@book{Calame2003,
  author    = {Calame, Jens R.},
  title     = {Considerations on object oriented software testing},
  series = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  volume    = {2003, 4},
  journal   = {Preprint / Universit{\"a}t Potsdam, Institut f{\"u}r Informatik},
  publisher = {Univ.},
  address   = {Potsdam},
  issn      = {0946-7580},
  pages     = {71 S.},
  year      = {2003},
  language  = {en}
}
@article{KonczakLinkeSchaub2003,
  author    = {Konczak, Kathrin and Linke, Thomas and Schaub, Torsten H.},
  title     = {Graphs and colorings for answer set programming : abridged report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with preferences},
  issn      = {0169-2968},
  year      = {2003},
  abstract  = {The integration of preferences into answer set programming constitutes an important practical device for distinguishing certain preferred answer sets from non-preferred ones. To this end, we elaborate upon rule dependency graphs and their colorings for characterizing different preference handling strategies found in the literature. We start from a characterization of (three types of) preferred answer sets in terms of totally colored dependency graphs. In particular, we demonstrate that this approach allows us to capture all three approaches to preferences in a uniform setting by means of the concept of a height function. In turn, we exemplarily develop an operational characterization of preferred answer sets in terms of operators on partial colorings for one particular strategy. In analogy to the notion of a derivation in proof theory, our operational characterization is expressed as a (non-deterministically formed) sequence of colorings, gradually turning an uncolored graph into a totally colored one},
  language  = {en}
}
@article{KonczakSchaubLinke2003,
  author    = {Konczak, Kathrin and Schaub, Torsten H. and Linke, Thomas},
  title     = {Graphs and colorings for answer set programming with prefernces : preliminary report},
  issn      = {1613-0073},
  year      = {2003},
  language  = {en}
}