TY  - JOUR
A1  - Mileo, Alessandra
A1  - Schaub, Torsten
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  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - On probing and multi-threading in platypus
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Grell, Susanne
A1  - Schaub, Torsten
A1  - Selbig, Joachim
T1  - Modelling biological networks by action languages via 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  - Gerbser, Martin
A1  - Schaub, Torsten
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  - Gerbser, Martin
A1  - Schaub, Torsten
T1  - Characterizing (ASP) inferences by unit propagation
Y1  - 2006
ER  - 
TY  - JOUR
A1  - Konczak, Kathrin
A1  - Linke, Thomas
A1  - Schaub, Torsten
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  - Gressmann, Jean
A1  - Janhunen, Tomi
A1  - Mercer, Robert E.
A1  - Schaub, Torsten
A1  - Thiele, Sven
A1  - Tichy, Richard
T1  - On probing and multi-threading in platypus
Y1  - 2006
UR  - http://www2.in.tu-clausthal.de/~tmbehrens/NMR_Proc_TR4.pdf
ER  - 
TY  - JOUR
A1  - Delgrande, James Patrick
A1  - Schaub, Torsten
A1  - Tompits, Hans
T1  - A Preference-Based Framework for Updating logic Programs : preliminary reports
Y1  - 2006
UR  - http://www.easychair.org/FLoC-06/PREFS-preproceedings.pdf
ER  -