default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRolf Socher
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2007
[b4]Ingo Boersch, Jochen Heinsohn, Rolf Socher:
Wissensverarbeitung - eine Einführung in die künstliche Intelligenz für Informatiker und Ingenieure, 2. Auflage. Elsevier Spektrum Akademischer Verlag 2007, pp. I-XVI, 1-379- 1997
- [b3]Rolf Socher-Ambrosius, Patricia Johann:
Deduction systems. Graduate Texts in Computer Science, Springer 1997, ISBN 978-0-387-94847-8, pp. I-XII, 1-206 - 1994
- [b2]Rolf Socher-Ambrosius:
Deduktionssysteme. BI-Wissenschaftsverlag 1994, ISBN 978-3-411-17171-2, pp. 1-186 - 1990
- [b1]Rolf Socher:
Simplification and reduction for automated theorem proving. Kaiserslautern University of Technology, Germany, SEKI Report 90-10, 1990, pp. 1-146
Journal Articles
- 1992
- [j5]Rolf Socher-Ambrosius:
How to Avoid the Derivation of Redundant Clauses in Reasoning Systems. J. Autom. Reason. 9(1): 77-97 (1992) - 1991
- [j4]Rolf Socher:
Optimizing the Clausal Normal Form Transformation. J. Autom. Reason. 7(3): 325-336 (1991) - [j3]Rolf Socher:
On the Relation Between Resolution Based and Completion Based Theorem Proving. J. Symb. Comput. 11(1/2): 129-147 (1991) - 1990
- [j2]Rolf Socher-Ambrosius:
Another Technique for Proving Completeness of Ground Resolution. Bull. EATCS 42: 187-189 (1990) - 1989
- [j1]Jürgen Müller, Rolf Socher-Ambrosius:
Workshop on Automated Reasoning. Künstliche Intell. 3(4): 20-21 (1989)
Conference and Workshop Papers
- 1994
- [c11]Rolf Socher-Ambrosius:
A Refined Version of General E-Unification. CADE 1994: 665-677 - [c10]Patricia Johann, Rolf Socher-Ambrosius:
Solving Simplification Ordering Constraints. CCL 1994: 352-367 - 1993
- [c9]Rolf Socher-Ambrosius:
Unification in Order-Sorted Logic With Term Declarations. LPAR 1993: 301-308 - 1992
- [c8]Rolf Socher-Ambrosius:
A Goal Oriented Strategy Based on Completion. ALP 1992: 435-445 - 1991
- [c7]Rolf Socher-Ambrosius:
Boolean Algebra Admits No Convergent Term Rewriting System. RTA 1991: 264-274 - 1989
- [c6]Rolf Socher-Ambrosius:
Reducing the Derivation of Redundant Clauses in Reasoning Systems. IJCAI 1989: 401-406 - [c5]Rolf Socher-Ambrosius:
Detecting Redundancy Caused by Congruent Links in Clause Graphs. GWAI 1989: 74-82 - [c4]Jürgen Müller, Rolf Socher-Ambrosius:
A Resolution Calculus Extende by Equivalence. GWAI 1989: 102-106 - 1988
- [c3]Rolf Socher:
A Subsumption Algorithm Based on Characteristic Matrices. CADE 1988: 573-581 - [c2]Jürgen Müller, Rolf Socher-Ambrosius:
On the Unnecessity of Multiple Overlaps in Completion Theorem Proving. GWAI 1988: 169-178 - [c1]Rolf Socher-Ambrosius:
Using Theory Resolution to Simplify Interpreted Formulae. GWAI 1988: 179-185
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:
