TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - A concictency-based paradigm for belief change Y1 - 2003 SN - 0004-3702 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - A framework for compiling preferences in logic programs Y1 - 2003 ER - TY - BOOK A1 - Sogomonyan, Egor S. A1 - Marienfeld, Daniel A1 - Ocheretnij, V. A1 - Gössel, Michael T1 - A new self-checking sum-bit duplicated carry-select adder T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 5 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Schaub, Torsten H. A1 - Wang, Kewen T1 - A semantic framework for prefernce handling in answer set programming Y1 - 2003 ER - TY - JOUR A1 - Schneidenbach, Lars A1 - Schnor, Bettina A1 - Petri, Stefan T1 - Architecture and Implementation of the Socket Interface on Top of GAMMA Y1 - 2003 SN - 0-7695-2037-5 ER - TY - JOUR A1 - Lanfermann, Gerd A1 - Schnor, Bettina A1 - Seidel, Edward T1 - Characterizing Grids N2 - 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. Y1 - 2003 SN - 1-4020-7418-2 ER - TY - BOOK A1 - Calame, Jens R. T1 - Considerations on object oriented software testing T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 4 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Graphs and colorings for answer set programming : abridged report Y1 - 2003 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/kolisch03a.pdf SN - 1613-0073 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Schaub, Torsten H. A1 - Linke, Thomas T1 - Graphs and colorings for answer set programming with preferences N2 - 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 Y1 - 2003 SN - 0169-2968 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Schaub, Torsten H. A1 - Linke, Thomas T1 - Graphs and colorings for answer set programming with prefernces : preliminary report Y1 - 2003 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/koschli03a.pdf SN - 1613-0073 ER - TY - JOUR A1 - Feider, Henryk A1 - Schnor, Bettina A1 - Dramlitsch, Thomas T1 - Gridmake : the missing link for compilation in the Grid N2 - In order to take full advantage of Grid environments, applications need to be able to run on various heterogeneous platforms. Distributed runs across several clusters or supercomputers for example, require matching binaries at each site. Thus, at some stage, each Grid enabled application needs to be recompiled for every platform. Up to now, creating matching binaries on different platforms was a manual, sequential, slow, and very error-prone process. Developers had to log into each machine, transfer source code, check consistency and recompile if necessary. This cumbersome procedure is surely one reason for the (still existing) lack of production Grid computing. Gridmake, a tool to automate and speed up this procedure is presented in this paper. Y1 - 2003 ER - TY - BOOK A1 - Wu, K. A1 - Karri, R. A1 - Kuznetsov, Grigory A1 - Gössel, Michael T1 - Low Cost Concurrent Error Detection for the Advanced Encryption Standart T3 - Preprint / Universität Potsdam, Institut für Informatik Y1 - 2003 SN - 0946-7580 VL - 2003, 8 PB - Univ. CY - Potsdam ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Gharib, Mona A1 - Mercer, Robert E. A1 - Risch, V. A1 - Schaub, Torsten H. T1 - Lukaszewicz-style answer set programming : a preliminary report Y1 - 2003 UR - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/ SN - 1613-0073 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - On the relation between Reiterïs default logic and its (major) variants Y1 - 2003 SN - 3-540- 409494-5 ER - TY - JOUR A1 - Besnard, Philippe A1 - Mercer, Robert E. A1 - Schaub, Torsten H. T1 - Optimality theory throught default logic Y1 - 2003 SN - 3-540-20059-2 ER - TY - JOUR A1 - Besnard, Philippe A1 - Schaub, Torsten H. A1 - Tompits, Hans A1 - Woltran, Stefan T1 - Paraconsistent reasoning via quantified boolean formulas : Part II: Circumscribing inconsistent theories Y1 - 2003 SN - 3-540- 409494-5 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Reasoning credulously and skeptically within a single extension Y1 - 2003 ER - TY - JOUR A1 - Linke, Thomas T1 - Suitable graphs for answer set programming Y1 - 2003 UR - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/ SN - 1613-0073 ER - TY - JOUR A1 - Flöter, André A1 - Nicolas, Jacques A1 - Schaub, Torsten H. A1 - Selbig, Joachim T1 - Threshold extraction in metabolite concentration data Y1 - 2003 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/floeterGCB2003.pdf ER - TY - JOUR A1 - Linke, Thomas T1 - Using nested logic programs for answer set programming Y1 - 2003 UR - http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-78/ SN - 1613-0073 ER -