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  -