| 2006 |
| 30 | EE | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and colorings for answer set programming.
TPLP 6(1-2): 61-106 (2006) |
| 2005 |
| 29 | EE | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ Approach to Answer Set Solving.
Answer Set Programming 2005 |
| 28 | EE | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ Approach to Answer Set Solving.
LPAR 2005: 95-109 |
| 27 | EE | Christian Anger,
Martin Gebser,
Thomas Linke,
André Neumann,
Torsten Schaub:
The nomore++ System.
LPNMR 2005: 422-426 |
| 26 | EE | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and colorings for answer set programming
CoRR abs/cs/0502082: (2005) |
| 25 | EE | Christian Anger,
Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
A Glimpse of Answer Set Programming.
KI 19(1): 12- (2005) |
| 2004 |
| 24 | EE | Thomas Linke,
Hans Tompits,
Stefan Woltran:
On Acyclic and Head-Cycle Free Nested Logic Programs.
ICLP 2004: 225-239 |
| 23 | EE | Andreas Bösel,
Thomas Linke,
Torsten Schaub:
Profiling Answer Set Programming: The Visualization Component of the noMoRe System.
JELIA 2004: 702-705 |
| 22 | EE | Thomas Linke,
Vladimir Sarsakov:
Suitable Graphs for Answer Set Programming.
LPAR 2004: 154-168 |
| 21 | EE | Kathrin Konczak,
Thomas Linke,
Torsten Schaub:
Graphs and Colorings for Answer Set Programming: Abridged Report.
LPNMR 2004: 127-140 |
| 20 | EE | Thomas Linke,
Hans Tompits,
Stefan Woltran:
On acyclic and head-cycle free nested logic programs.
NMR 2004: 267-275 |
| 2003 |
| 19 | EE | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and coloring for answer set programming: Preliminary Report.
Answer Set Programming 2003 |
| 18 | EE | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and colorings for answer set programming: Abridged Report.
Answer Set Programming 2003 |
| 17 | EE | Thomas Linke:
Suitable Graphs for Answer Set Programming.
Answer Set Programming 2003 |
| 16 | EE | Thomas Linke:
Using Nested Logic Programs for Answer Set Programming.
Answer Set Programming 2003 |
| 15 | EE | Kathrin Konczak,
Torsten Schaub,
Thomas Linke:
Graphs and Colorings for Answer Set Programming with Preferences.
Fundam. Inform. 57(2-4): 393-421 (2003) |
| 2002 |
| 14 | EE | Thomas Linke,
Christian Anger,
Kathrin Konczak:
More on noMoRe.
JELIA 2002: 468-480 |
| 13 | EE | Christian Anger,
Kathrin Konczak,
Thomas Linke:
NoMoRe : Non-monotonic Reasoning with Logic Programs.
JELIA 2002: 521-524 |
| 12 | | Thomas Linke,
Christian Anger,
Kathrin Konczak:
More on noMoRe.
NMR 2002: 210-218 |
| 2001 |
| 11 | | Thomas Linke:
Graph Theoretical Characterization and Computation of Answer Sets.
IJCAI 2001: 641-648 |
| 10 | EE | Christian Anger,
Kathrin Konczak,
Thomas Linke:
NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics.
IJCAR 2001: 325-330 |
| 9 | EE | Christian Anger,
Kathrin Konczak,
Thomas Linke:
NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics.
LPNMR 2001: 406-410 |
| 8 | | Frank Kose,
Wolfram Weckwerth,
Thomas Linke,
Oliver Fiehn:
Visualizing plant metabolomic correlation networks using clique-metabolite matrices.
Bioinformatics 17(12): 1198-1208 (2001) |
| 2000 |
| 7 | EE | Thomas Linke,
Torsten Schaub:
Alternative foundations for Reiter's default logic.
Artif. Intell. 124(1): 31-86 (2000) |
| 1999 |
| 6 | EE | Thomas Linke,
Torsten Schaub:
On Bottom-Up Pre-processing Techniques for Automated Default Reasoning.
ESCQARU 1999: 268-278 |
| 5 | EE | Thomas Linke,
Torsten Schaub:
Default Reasoning via Blocking Sets.
LPNMR 1999: 247-261 |
| 1998 |
| 4 | EE | Thomas Linke,
Torsten Schaub:
An Approach to Query-Answering in Reiter's Default Logic and the Underlying Existence of Extensions Problem.
JELIA 1998: 233-247 |
| 1997 |
| 3 | | Thomas Linke,
Torsten Schaub:
Towards a classification of Default Logics.
Journal of Applied Non-Classical Logics 7(4): (1997) |
| 1996 |
| 2 | | Thomas Linke,
Torsten Schaub:
Putting Default Logics in Perspective.
KI 1996: 241-252 |
| 1995 |
| 1 | | Thomas Linke,
Torsten Schaub:
Lemma Handling in Default Logic Theorem Provers.
ECSQARU 1995: 285-292 |