default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBertram Fronhöfer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j3]Bertram Fronhöfer, Akihiro Yamamoto:
Hypothesis finding with proof theoretical appropriateness criteria. Theor. Comput. Sci. 350(1): 140-162 (2006)- 2003
- [j2]Manfred Schramm, Bertram Fronhöfer:
Probabilistic Aspects of Score Systems. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 11(Supplement-2): 51-74 (2003) - 2002
- [c22]Bertram Fronhöfer, Akihiro Yamamoto:
Minimised Residue Hypotheses in Relevant Logic. ALT 2002: 278-292 - [c21]Akihiro Yamamoto, Bertram Fronhöfer:
A Theory of Hypothesis Finding in Clausal Logic. Progress in Discovery Science 2002: 246-257 - [c20]Manfred Schramm, Bertram Fronhöfer:
Completing Incomplete Bayesian Networks. WCII 2002: 200-218 - 2000
- [c19]Akihiro Yamamoto, Bertram Fronhöfer:
Hypotheses Finding via Residue Hypotheses with the Resolution Principle. ALT 2000: 156-165 - [c18]Bertram Fronhöfer:
Proof Structures and Matrix Graphs. Intellectics and Computational Logic 2000: 159-173
1990 – 1999
- 1997
- [c17]Bertram Fronhöfer:
Connection Cutting for Contraction Free Logic. KI 1997: 385-388 - 1996
- [b1]Bertram Fronhöfer:
The action-as-implication paradigm - formal systems and application. Computer science monographs 1, CS Press 1996, ISBN 978-3-931757-91-5, pp. 1-293 - [c16]Bertram Fronhöfer:
Cyclic Rules in Linear Connection Proofs. KI 1996: 67-70 - [c15]Bertram Fronhöfer:
Situational Calculus, Linear Connection Proofs and STRIPS-like Planning: An Experimental Comparison. TABLEAUX 1996: 193-209 - 1992
- [c14]Bertram Fronhöfer:
Linear Proofs and Linear Logic. JELIA 1992: 106-125 - [e2]Bertram Fronhöfer, Graham Wrightson:
Parallelization in Inference Systems, International Workshop, Dagstuhl Castle, Germany, December 17-18, 1990, Proceedings. Lecture Notes in Computer Science 590, Springer 1992, ISBN 3-540-55425-4 [contents] - [e1]Bertram Fronhöfer, Reiner Hähnle, Thomas Käufl:
Workshop Theorem Proving with Analytic Tableaux and Related Methods, Lautenbach. Universität Karlsruhe, Fakultät für Informatik, Institut für Logik, Komplexität und Deduktionssysteme, Interner Bericht 8/92, March 18-20, 1992. 1992 [contents] - 1991
- [c13]Bertram Fronhöfer:
Implementing Exceptions in Inheritance by Concept Transforming Actions. AI*IA 1991: 58-67 - [c12]Bertram Fronhöfer:
Default Connections in a Modal Planning Framework. EWSP 1991: 39-52 - 1990
- [i4]Bertram Fronhöfer:
Implementing exception in inheritance by concept transforming actions. Forschungsberichte, TU Munich FKI 141 90: 1-20 (1990)
1980 – 1989
- 1989
- [c11]Wolfgang Bibel, Luis Fariñas del Cerro, Bertram Fronhöfer, Andreas Herzig:
Plan Generation by Linear Proofs: On Semantics. GWAI 1989: 49-62 - [c10]Gerd Neugebauer, Bertram Fronhöfer, Christoph Kreitz:
XPRTS - An Implementation Tool for Program Synthesis. GWAI 1989: 348-357 - [c9]Bertram Fronhöfer, Ulrich Furbach:
ALPES: A Programming Environment for Logic Programming. Wissensbasierte Systeme 1989: 496-506 - [i3]Bertram Fronhöfer:
Default connections in a model planning framework. Forschungsberichte, TU Munich FKI 108 89: 1-22 (1989) - 1988
- [c8]Bertram Fronhöfer:
Plan Schemes in PLANLOG. AIMSA 1988: 169-176 - [i2]Bertram Fronhöfer, Ulrich Furbach:
Transformation systems for program synthesis: Knuth-Bendix completion and fold/unfold. Forschungsberichte, TU Munich FKI 87 88: 1-17 (1988) - [i1]Christoph Kreitz, Gerd Neugebauer, Bertram Fronhöfer:
Logic oriented program synthesis. Forschungsberichte, TU Munich FKI 90 88: 1-9 (1988) - 1987
- [j1]Bertram Fronhöfer:
Linearity and Plan Generation. New Gener. Comput. 5(3): 213-225 (1987) - [c7]Bertram Fronhöfer:
PLANLOG: A Language Framework for the Integration of Procedural and Logical Programming. IJCAI 1987: 15-17 - [c6]Bertram Fronhöfer, Gerd Neugebauer:
ESPRIT Project P973 ALPES: Advanced Logical Programming Environments. Wissensbasierte Systeme 1987: 388-394 - 1986
- [c5]Bertram Fronhöfer, Ulrich Furbach:
Knuth-Bendix Completion versus Fold/Unfold: a Comparative Study in Program Synthesis. GWAI 1986: 289-300 - 1985
- [c4]Bertram Fronhöfer:
The LOPS-Approach: Towards New Syntheses of Algorithms. ÖGAI 1985: 164-172 - 1984
- [c3]Ramon Brena, Ricardo Caferra, Bertram Fronhöfer, Christian Gresse, Philippe Jacquet, Marie-Laure Potet:
Program Synthesis Through Problem Splitting: A Method for Subproblem Characterization. AIMSA 1984: 113-120 - [c2]Bertram Fronhöfer, Ricardo Caferra, Philippe Jacquet:
Improvement of Recursive Programs from a Logic Programming Point of View. GWAI 1984: 229-237 - 1983
- [c1]Wolfgang Bibel, Elmar Eder, Bertram Fronhöfer:
Towards an Advanced Implementation of the Connection Method. IJCAI 1983: 920-922
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:57 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:
