@article{PearceSarsakovSchaubetal.2002, author = {Pearce, David and Sarsakov, Vladimir and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan}, title = {A polynomial translation of logic programs with nested expressions into disjunctive logic programs : preliminary report}, year = {2002}, language = {en} } @article{LinkeAngerKonczak2002, author = {Linke, Thomas and Anger, Christian and Konczak, Kathrin}, title = {More on nomore}, isbn = {3-540-44190-5}, year = {2002}, language = {en} } @article{BesnardSchaubTompitsetal.2002, author = {Besnard, Philippe and Schaub, Torsten H. and Tompits, Hans and Woltran, Stefan}, title = {Paraconsistent reasoning via quantified boolean formulas}, isbn = {3-540-44190-5}, year = {2002}, language = {en} } @article{SchaubWang2002, author = {Schaub, Torsten H. and Wang, T.}, title = {Preferred well-founded semantics for logic programming by alternating fixpoints : preliminary report}, year = {2002}, language = {en} } @article{DelgrandeHunterSchaub2002, author = {Delgrande, James Patrick and Hunter, Anthony and Schaub, Torsten H.}, title = {COBA: a consistency-based belief revision system}, isbn = {3-540-44190-5}, year = {2002}, 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{BesnardFanselowSchaub2002, author = {Besnard, Philippe and Fanselow, Gisbert and Schaub, Torsten H.}, title = {Optimality theory as a family of cumulative logics}, year = {2002}, language = {en} } @article{FloeterNicolasSchaubetal.2003, author = {Fl{\"o}ter, Andr{\´e} and Nicolas, Jacques and Schaub, Torsten H. and Selbig, Joachim}, title = {Threshold extraction in metabolite concentration data}, 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{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{BesnardSchaubTompitsetal.2003, author = {Besnard, Philippe and Schaub, Torsten H. 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{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{SchaubWang2003, author = {Schaub, Torsten H. and Wang, Kewen}, title = {A semantic framework for prefernce handling in answer set programming}, 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 prefernces : preliminary report}, issn = {1613-0073}, year = {2003}, language = {en} } @article{Linke2003, author = {Linke, Thomas}, title = {Using nested logic programs for answer set programming}, issn = {1613-0073}, year = {2003}, language = {en} } @article{DelgrandeGharibMerceretal.2003, author = {Delgrande, James Patrick and Gharib, Mona and Mercer, Robert E. and Risch, V. and Schaub, Torsten H.}, title = {Lukaszewicz-style answer set programming : a preliminary report}, issn = {1613-0073}, year = {2003}, language = {en} } @article{BesnardMercerSchaub2003, author = {Besnard, Philippe and Mercer, Robert E. and Schaub, Torsten H.}, title = {Optimality theory throught default logic}, isbn = {3-540-20059-2}, year = {2003}, language = {en} } @article{Linke2003, author = {Linke, Thomas}, title = {Suitable graphs for answer set programming}, issn = {1613-0073}, year = {2003}, 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{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} }