Bertram Fronhöfer

According to our database1, Bertram Fronhöfer authored at least 30 papers between 1983 and 2006.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2006
Hypothesis finding with proof theoretical appropriateness criteria.
Theor. Comput. Sci., 2006

2003
Probabilistic Aspects of Score Systems.
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2003

2002
Completing Incomplete Bayesian Networks.
Proceedings of the Conditionals, Information, and Inference, International Workshop, 2002

A Theory of Hypothesis Finding in Clausal Logic.
Proceedings of the Progress in Discovery Science, 2002

Minimised Residue Hypotheses in Relevant Logic.
Proceedings of the Algorithmic Learning Theory, 13th International Conference, 2002

2000
Proof Structures and Matrix Graphs.
Proceedings of the Intellectics and Computational Logic (to Wolfgang Bibel on the occasion of his 60th birthday), 2000

Hypotheses Finding via Residue Hypotheses with the Resolution Principle.
Proceedings of the Algorithmic Learning Theory, 11th International Conference, 2000

1997
Connection Cutting for Contraction Free Logic.
Proceedings of the KI-97: Advances in Artificial Intelligence, 1997

1996
Situational Calculus, Linear Connection Proofs and STRIPS-like Planning: An Experimental Comparison.
Proceedings of the Theorem Proving with Analytic Tableaux and Related Methods, 1996

Cyclic Rules in Linear Connection Proofs.
Proceedings of the KI-96: Advances in Artificial Intelligence, 1996

The action-as-implication paradigm - formal systems and application.
Computer science monographs 1, CS Press, ISBN: 978-3-931757-91-5, 1996

1992
Linear Proofs and Linear Logic.
Proceedings of the Logics in AI, European Workshop, 1992

1991
Default Connections in a Modal Planning Framework.
Proceedings of the European Workshop on Planning, 1991

Implementing Exceptions in Inheritance by Concept Transforming Actions.
Proceedings of the Trends in Artificial Intelligence, 1991

1990
Implementing exception in inheritance by concept transforming actions.
Forschungsberichte, TU Munich, 1990

1989
Default connections in a model planning framework
Forschungsberichte, TU Munich, 1989

ALPES: A Programming Environment for Logic Programming.
Proceedings of the Wissensbasierte Systeme, 1989

XPRTS - An Implementation Tool for Program Synthesis.
Proceedings of the GWAI-89, 1989

Plan Generation by Linear Proofs: On Semantics.
Proceedings of the GWAI-89, 1989

1988
Logic oriented program synthesis
Forschungsberichte, TU Munich, 1988

Transformation systems for program synthesis: Knuth-Bendix completion and fold/unfold
Forschungsberichte, TU Munich, 1988

Plan Schemes in PLANLOG.
Proceedings of the Artificial Intelligence III: Methodology, Systems, Applications, 1988

1987
Linearity and Plan Generation.
New Gener. Comput., 1987

ESPRIT Project P973 ALPES: Advanced Logical Programming Environments.
Proceedings of the Wissensbasierte Systeme, 1987

PLANLOG: A Language Framework for the Integration of Procedural and Logical Programming.
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

1986
Knuth-Bendix Completion versus Fold/Unfold: a Comparative Study in Program Synthesis.
Proceedings of the GWAI-86 und 2. Österreichische Artificial-Intelligence-Tagung, 1986

1985
The LOPS-Approach: Towards New Syntheses of Algorithms.
Proceedings of the Österreichische Artificial Intelligence-Tagung, 1985

1984
Improvement of Recursive Programs from a Logic Programming Point of View.
Proceedings of the GWAI-84, 1984

Program Synthesis Through Problem Splitting: A Method for Subproblem Characterization.
Proceedings of the Artificial Intelligence: Methodology, Systems, Applications, 1984

1983
Towards an Advanced Implementation of the Connection Method.
Proceedings of the 8th International Joint Conference on Artificial Intelligence. Karlsruhe, 1983


  Loading...