default search action
Stefan Brüning
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
- [c17]Stefan Brüning, Stephan Weißleder, Miroslaw Malek:
A Fault Taxonomy for Service-Oriented Architecture. HASE 2007: 367-368 - [c16]Stefan Brüning, Johannes Zapotoczky, Peter Ibach, Vladimir Stantchev:
Cooperative Positioning with MagicMap. WPNC 2007: 17-22 - 2001
- [c15]Stefan Brüning:
Exploiting Conditional Equivalences in Connection Calculi. KI/ÖGAI 2001: 122-137 - 2000
- [c14]Stefan Brüning, Torsten Schaub:
A Connection Calculus for Handling Incomplete Information. Intellectics and Computational Logic 2000: 47-66
1990 – 1999
- 1999
- [c13]Stefan Brüning, Torsten Schaub:
Avoiding Non-ground Variables. ESCQARU 1999: 92-103 - 1998
- [j4]Torsten Schaub, Stefan Brüning:
Prolog Technology for Default Reasoning: Proof Theory and Compilation Techniques. Artif. Intell. 106(1): 1-75 (1998) - 1997
- [j3]Peter Baumgartner, Stefan Brüning:
A Disjunctive Positive Refinement of Model Elimination and its Application to Subsumption Deletion. J. Autom. Reason. 19(2): 205-262 (1997) - [j2]Stefan Brüning:
Globally Linear Connection Method. New Gener. Comput. 15(4): 369-402 (1997) - 1996
- [c12]Torsten Schaub, Stefan Brüning, Pascal Nicolas:
XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description. CADE 1996: 293-297 - [c11]Torsten Schaub, Stefan Brüning:
Prolog Technology for Default Reasoning (An Abridged Report). ECAI 1996: 105-109 - [c10]Stefan Brüning, Torsten Schaub:
A Model-Based Approach to Consistency-Checking. ISMIS 1996: 315-324 - 1995
- [j1]Stefan Brüning:
Exploiting Equivalences in Connection Calculi. Log. J. IGPL 3(6): 857-886 (1995) - [c9]Wolfgang Bibel, Stefan Brüning, Uwe Egly, Daniel S. Korn, Thomas Rath:
Issues in Theorem Proving Based on the Connection Method. TABLEAUX 1995: 1-16 - 1994
- [b1]Stefan Brüning:
Techniques for avoiding redundancy in theorem proving based on the connection method. Darmstadt University of Technology, Germany, 1994, pp. I-XII, 1-202 - [c8]Stefan Brüning:
Detecting Non-Provable Goals. CADE 1994: 222-236 - [c7]Wolfgang Bibel, Stefan Brüning, Uwe Egly, Thomas Rath:
KoMeT. CADE 1994: 783-787 - [c6]Stefan Brüning, Torsten Schaub:
Using Classical Theorem-Proving Techniques for Approximate Reasoning: Revised Report. IPMU 1994: 389-398 - [c5]Stefan Brüning:
Towards Efficient Calculi for Resource-Oriented Deductive Planning. LPAR 1994: 174-188 - 1993
- [c4]Stefan Brüning:
On Loop Detection in Connection Calculi. Kurt Gödel Colloquium 1993: 144-151 - [c3]Stefan Brüning:
Search Space Pruning by Checking Dynamic Term Growth. LPAR 1993: 52-63 - [c2]Stefan Brüning, Gerd Große, Steffen Hölldobler, Josef Schneeberger, Ute Cornelia Sigmund, Michael Thielscher:
Disjunction in Plan Generation by Equational Logic Programming. PuK 1993: 18-26 - [c1]Stefan Brüning, Steffen Hölldobler, Ute Cornelia Sigmund, Michael Thielscher, Josef Schneeberger:
Disjunction In Resource-Oriented Deductive Planning. ILPS 1993: 670
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-25 05:53 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: