Ralph Bergmann
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ralph Bergmann has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Wolfgang Wilke
University of Kaiserslautern
4 shared publications - Héctor Muñoz-Avila
University of Kaiserslautern
2 shared publications - Sascha Schmitt
University of Kaiserslautern
2 shared publications - Stefan Wess
Tecinno GmbH
2 shared publications - Armin Stahl
University of Kaiserslautern
1 shared publication - Barry Smyth
University College Dublin, Dublin, Ireland
1 shared publication
Latest Publications
- 27 January 2006
- Published by Springer Nature
- p. 125-133
Knowledge acquisition by generating skeletal plans from real world cases
- 27 January 2006
- Published by Springer Nature
- p. 125-133
Knowledge acquisition by generating skeletal plans from real world cases
- 1 January 2003
- Published by Springer Nature
- p. 87-101
Knowledge-Intensive Product Search and Customization in Electronic Commerce
- 1 January 2003
- Published by Springer Nature
- p. 87-101
Knowledge-Intensive Product Search and Customization in Electronic Commerce
- 1 January 1998
- Published by Springer Nature
- p. 460-470
Collecting experience on the systematic development of CBR applications using the INRECA methodology
- 1 January 1998
- Published by Springer Nature
- p. 460-470
Collecting experience on the systematic development of CBR applications using the INRECA methodology
- 1 January 1998
- Published by Springer Nature
- p. 346-357
The development of HOMER a case-based CAD/CAM help-desk support tool
- 1 January 1998
- Published by Springer Nature
- p. 346-357
The development of HOMER a case-based CAD/CAM help-desk support tool
- 1 January 1996
- Published by Springer Nature
- p. 460-472
Considering decision cost during learning of feature weights
- 1 January 1996
- Published by Springer Nature
- p. 460-472
Considering decision cost during learning of feature weights
- 1 January 1996
- Published by SAGE Publications in AI Communications
- Vol. 9 (3) , 128-137
Case-based planning: selected methods and systems
- 1 January 1996
- Published by SAGE Publications in AI Communications
- Vol. 9 (3) , 128-137
Case-based planning: selected methods and systems
- Open Access
Building and Refining Abstract Planning Cases by Change of Representation Language
ion is one of the most promising approaches to improve the performance of problem solvers. In several domains abstraction by dropping sentences of a domain description -- as used in most hierarchical planners -- has proven useful. In this paper we present examples which illustrate significant drawbacks of abstraction by dropping sentences. To overcome these drawbacks, we propose a more general view of abstraction involving the change of representation language. We have developed a new abstraction methodology and a related sound and complete learning algorithm that allows the complete change of representation language of planning cases from concrete to abstract. However, to achieve a powerful change of the representation language, the abstract language itself as well as rules which describe admissible ways of abstracting states must be provided in the domain model. This new abstraction approach is the core of Paris (Plan Abstraction and Refinement in an Integrated System), a system in which abstract planning cases are automatically learned from given concrete cases. An empirical study in the domain of process planning in mechanical engineering shows significant advantages of the proposed reasoning from abstract cases over classical hierarchical planning.
Open AccessBuilding and Refining Abstract Planning Cases by Change of Representation Language
ion is one of the most promising approaches to improve the performance of problem solvers. In several domains abstraction by dropping sentences of a domain description -- as used in most hierarchical planners -- has proven useful. In this paper we present examples which illustrate significant drawbacks of abstraction by dropping sentences. To overcome these drawbacks, we propose a more general view of abstraction involving the change of representation language. We have developed a new abstraction methodology and a related sound and complete learning algorithm that allows the complete change of representation language of planning cases from concrete to abstract. However, to achieve a powerful change of the representation language, the abstract language itself as well as rules which describe admissible ways of abstracting states must be provided in the domain model. This new abstraction approach is the core of Paris (Plan Abstraction and Refinement in an Integrated System), a system in which abstract planning cases are automatically learned from given concrete cases. An empirical study in the domain of process planning in mechanical engineering shows significant advantages of the proposed reasoning from abstract cases over classical hierarchical planning.