TY - JOUR A1 - Gerbser, Martin A1 - Schaub, Torsten H. T1 - Tableau calculi for answer set programming Y1 - 2006 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/gebsch06c.pdf U6 - https://doi.org/10.1007/11799573 SN - 0302-9743 ER - TY - JOUR A1 - Anger, Christian A1 - Gebser, Martin A1 - Janhunen, Tomi A1 - Schaub, Torsten H. T1 - What's a head without a body? Y1 - 2006 ER - TY - JOUR A1 - Gerbser, Martin A1 - Schaub, Torsten H. T1 - Characterizing (ASP) inferences by unit propagation Y1 - 2006 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - A preference-based framework for updating logic programs Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - JOUR A1 - Mileo, Alessandra A1 - Schaub, Torsten H. T1 - Qualitative constraint enforcement in advanced policy specification Y1 - 2007 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Lang, Jérôme A1 - Schaub, Torsten H. T1 - Belief change based on global minimisation Y1 - 2007 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Graphs and colorings for answer set programming N2 - We investigate the usage of rule dependency graphs and their colorings for characterizing and computing answer sets of logic programs. This approach provides us with insights into the interplay between rules when inducing answer sets. We start with different characterizations of answer sets in terms of totally colored dependency graphs that differ ill graph-theoretical aspects. We then develop a series of operational characterizations of answer sets in terms of operators on partial colorings. In analogy to the notion of a derivation in proof theory, our operational characterizations are expressed as (non-deterministically formed) sequences of colorings, turning an uncolored graph into a totally colored one. In this way, we obtain an operational framework in which different combinations of operators result in different formal properties. Among others, we identify the basic strategy employed by the noMoRe system and justify its algorithmic approach. Furthermore, we distinguish operations corresponding to Fitting's operator as well as to well-founded semantics Y1 - 2006 UR - http://www.cs.kuleuven.ac.be/~dtai/projects/ALP//TPLP/ U6 - https://doi.org/10.1017/S1471068405002528 SN - 1471-0684 ER - TY - JOUR A1 - Gebser, Martin A1 - Schaub, Torsten H. A1 - Thiele, Sven T1 - GrinGo : a new grounder for answer set programming Y1 - 2007 SN - 978-3-540- 72199-4 ER - TY - JOUR A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Graphs and cologings for answer set programming : adridged report Y1 - 2004 SN - 3-540- 20721-x ER - TY - JOUR A1 - Boesel, Andreas A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - Profiling answer set programming : the visualization component of the noMoRe System Y1 - 2004 SN - 3-540-23242-7 ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - On probing and multi-threading in platypus Y1 - 2006 ER - TY - JOUR A1 - Mileo, Alessandra A1 - Schaub, Torsten H. T1 - Extending ordered disjunctions for policy enforcement : preliminary report Y1 - 2006 UR - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Liu, Daphne H. A1 - Schaub, Torsten H. A1 - Thiele, Sven T1 - COBA 2.0 : a consistency-based belief change system Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. A1 - Tompits, Hans T1 - An Extended Query language for action languages (and its application to aggregates and preferences) Y1 - 2006 UR - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf ER - TY - JOUR A1 - Anger, Christian A1 - Gebser, Martin A1 - Linke, Thomas A1 - Neumann, Andre A1 - Schaub, Torsten H. T1 - The nomore++ approach to answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf ER - TY - JOUR A1 - Gressmann, Jean A1 - Janhunen, Tomi A1 - Mercer, Robert E. A1 - Schaub, Torsten H. A1 - Thiele, Sven A1 - Tichy, Richard T1 - Platypus : a platform for distributed answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/grjamescthti05a.pdf ER - TY - JOUR A1 - Anger, Christian A1 - Gebser, Martin A1 - Linke, Thomas A1 - Neumann, Andre A1 - Schaub, Torsten H. T1 - The nomore++ approach to answer set solving Y1 - 2005 UR - http://www.cs.uni-potsdam.de/wv/pdfformat/angelinesc05c.pdf ER - TY - JOUR A1 - Grell, Susanne A1 - Konczak, Kathrin A1 - Schaub, Torsten H. T1 - nomore) : a system for computing preferred Answer Sets Y1 - 2005 SN - 0302-9743 ER - TY - JOUR A1 - Anger, Christian A1 - Konczak, Kathrin A1 - Linke, Thomas A1 - Schaub, Torsten H. T1 - A Glimpse of Answer Set Programming Y1 - 2005 UR - http://www.cs.uni-potsdam.de/~konczak/Papers/ankolisc05.pdf SN - 0170-4516 ER - TY - JOUR A1 - Delgrande, James Patrick A1 - Schaub, Torsten H. T1 - Expressing default logic variants in default logic N2 - Reiter's default logic is one of the best known and most studied of the approaches to nonmonotonic reasoning. Several variants of default logic have subsequently been proposed to give systems with properties differing from the original. In this paper, we examine the relationship between default logic and its major variants. We accomplish this by translating a default theory under a variant interpretation into a second default theory, under the original Reiter semantics, wherein the variant interpretation is respected. That is, in each case we show that, given an extension of a translated theory, one may extract an extension of the original variant default logic theory. We show how constrained, rational, justified, and cumulative default logic can be expressed in Reiter's default logic. As well, we show how Reiter's default logic can be expressed in rational default logic. From this, we suggest that any such variant can be similarly treated. Consequently, we provide a unification of default logics, showing how the original formulation of default logic may express its variants. Moreover, the translations clearly express the relationships between alternative approaches to default logic. The translations themselves are shown to generally have good properties. Thus, in at least a theoretical sense, we show that these variants are in a sense superfluous, in that for any of these variants of default logic, we can exactly mimic the behaviour of a variant in standard default logic. As well, the translations lend insight into means of classifying the expressive power of default logic variants; specifically we suggest that the property of semi-monotonicity represents a division with respect to expressibility, whereas regularity and cumulativity do not Y1 - 2005 SN - 0955-792X ER -