default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Linke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c25]Marco Ferrogalini, Thomas Linke, Ulrich Schweiger:
How to Boost the Extended Enterprise Approach in Engineering Using MBSE - A Case Study from the Railway Business. CSDM 2018: 79-96- 2010
- [c24]Andreas Colliander, Kyle McDonald, Reiner Zimmermann, Thomas Linke, Ronny Schroeder, John S. Kimball
, Eni G. Njoku:
Quikscat backscatter sensitivity to landscape freeze/thaw state over ALECTRA sites in Alaska from 2000 to 2007: Application to SMAP validation planning. IGARSS 2010: 1269-1272
2000 – 2009
- 2006
- [j6]Kathrin Konczak, Thomas Linke, Torsten Schaub:
Graphs and colorings for answer set programming. Theory Pract. Log. Program. 6(1-2): 61-106 (2006) - 2005
- [j5]Christian Anger, Kathrin Konczak, Thomas Linke, Torsten Schaub:
A Glimpse of Answer Set Programming. Künstliche Intell. 19(1): 12- (2005) - [c23]Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub:
The nomore++ Approach to Answer Set Solving. Answer Set Programming 2005 - [c22]Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub:
The nomore++ Approach to Answer Set Solving. LPAR 2005: 95-109 - [c21]Christian Anger, Martin Gebser, Thomas Linke, André Neumann, Torsten Schaub:
The nomore++ System. LPNMR 2005: 422-426 - [i1]Kathrin Konczak, Thomas Linke, Torsten Schaub:
Graphs and colorings for answer set programming. CoRR abs/cs/0502082 (2005) - 2004
- [c20]Thomas Linke, Hans Tompits, Stefan Woltran:
On Acyclic and Head-Cycle Free Nested Logic Programs. ICLP 2004: 225-239 - [c19]Andreas Bösel, Thomas Linke, Torsten Schaub:
Profiling Answer Set Programming: The Visualization Component of the noMoRe System. JELIA 2004: 702-705 - [c18]Thomas Linke, Vladimir Sarsakov:
Suitable Graphs for Answer Set Programming. LPAR 2004: 154-168 - [c17]Kathrin Konczak, Thomas Linke, Torsten Schaub:
Graphs and Colorings for Answer Set Programming: Abridged Report. LPNMR 2004: 127-140 - [c16]Thomas Linke, Hans Tompits, Stefan Woltran:
On acyclic and head-cycle free nested logic programs. NMR 2004: 267-275 - 2003
- [j4]Kathrin Konczak, Torsten Schaub, Thomas Linke:
Graphs and Colorings for Answer Set Programming with Preferences. Fundam. Informaticae 57(2-4): 393-421 (2003) - [c15]Kathrin Konczak, Torsten Schaub, Thomas Linke:
Graphs and coloring for answer set programming: Preliminary Report. Answer Set Programming 2003 - [c14]Kathrin Konczak, Torsten Schaub, Thomas Linke:
Graphs and colorings for answer set programming: Abridged Report. Answer Set Programming 2003 - [c13]Thomas Linke:
Suitable Graphs for Answer Set Programming. Answer Set Programming 2003 - [c12]Thomas Linke:
Using Nested Logic Programs for Answer Set Programming. Answer Set Programming 2003 - 2002
- [c11]Thomas Linke, Christian Anger, Kathrin Konczak:
More on noMoRe. JELIA 2002: 468-480 - [c10]Christian Anger, Kathrin Konczak, Thomas Linke:
NoMoRe : Non-monotonic Reasoning with Logic Programs. JELIA 2002: 521-524 - [c9]Thomas Linke, Christian Anger, Kathrin Konczak:
More on noMoRe. NMR 2002: 210-218 - 2001
- [j3]Frank Kose, Wolfram Weckwerth, Thomas Linke, Oliver Fiehn:
Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinform. 17(12): 1198-1208 (2001) - [c8]Christian Anger, Kathrin Konczak, Thomas Linke:
NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics. IJCAR 2001: 325-330 - [c7]Thomas Linke:
Graph Theoretical Characterization and Computation of Answer Sets. IJCAI 2001: 641-648 - [c6]Christian Anger, Kathrin Konczak, Thomas Linke:
NoMoRe : A System for Non-Monotonic Reasoning under Answer Set Semantics. LPNMR 2001: 406-410 - 2000
- [b1]Thomas Linke:
New foundations for automation of default reasoning. Bielefeld University, Germany, DISKI 237, Infix 2000, ISBN 978-3-89838-237-3, pp. I-VII, 1-182 - [j2]Thomas Linke, Torsten Schaub:
Alternative foundations for Reiter's default logic. Artif. Intell. 124(1): 31-86 (2000)
1990 – 1999
- 1999
- [c5]Thomas Linke, Torsten Schaub:
On Bottom-Up Pre-processing Techniques for Automated Default Reasoning. ESCQARU 1999: 268-278 - [c4]Thomas Linke, Torsten Schaub:
Default Reasoning via Blocking Sets. LPNMR 1999: 247-261 - 1998
- [c3]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
- [j1]Thomas Linke, Torsten Schaub:
Towards a classification of Default Logics. J. Appl. Non Class. Logics 7(4): 397-451 (1997) - 1996
- [c2]Thomas Linke, Torsten Schaub:
Putting Default Logics in Perspective. KI 1996: 241-252 - 1995
- [c1]Thomas Linke, Torsten Schaub:
Lemma Handling in Default Logic Theorem Provers. ECSQARU 1995: 285-292
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
