Gerhard Friedrich

Gerhard Friedrich

Auto-generated profile, based on publicly available information

Gerhard Friedrich

Alpen-Adria-Universität Klagenfurt

Research Focus & Metrics

Academic Career Length

34Years (1993-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2015
Verified
Book Chapter
Closed access
PDF file
AFAlexander Felfernig
Alexander Felfernig
GFGerhard Friedrich
Gerhard Friedrich
DJDietmar Jannach
Dietmar Jannach
MZMarkus Zanker
Markus Zanker

1 January 2008
Verified
Conference Paper
Closed access
PDF file
MQMarkus Quaritsch
Markus Quaritsch
ESEmil Stojanovski
Emil Stojanovski
CBChristian Bettstetter
Christian Bettstetter
GFGerhard Friedrich
Gerhard Friedrich
HHHermann Hellwagner
Hermann Hellwagner
MSMubarak Shah
Mubarak Shah

1 July 2020 in Theory and Practice of Logic Programming
Verified
Journal Article
Open access
PDF file
AWAntonius Weinzierl
Antonius Weinzierl
RTRichard Taupe
Richard Taupe
GFGerhard Friedrich
Gerhard Friedrich
Answer-Set Programming (ASP) is a powerful and expressive knowledge representation paradigm with a significant number of applications in logic-based AI. The traditional ground-and-solve approach, however, requires ASP programs to be grounded upfront and thus suffers from the so-called grounding bottleneck (i.e., ASP programs easily exhaust all available memory and thus become unsolvable). As a remedy, lazy-grounding ASP solvers have been developed, but many state-of-the-art techniques for grounded ASP solving have not been available to them yet. In this work we present, for the first time, adaptions to the lazy-grounding setting for many important techniques, like restarts, phase saving, domain-independent heuristics, and learned-clause deletion. Furthermore, we investigate their effects and in general observe a large improvement in solving capabilities and also uncover negative effects in certain cases, indicating the need for portfolio solving as known from other solvers.

22 December 2007 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
AFAlexander Felfernig
Alexander Felfernig
GFGerhard Friedrich
Gerhard Friedrich
KIKlaus Isak
Klaus Isak
KSKostyantyn Shchekotykhin
Kostyantyn Shchekotykhin
ETErich Teppan
Erich Teppan
DJDietmar Jannach
Dietmar Jannach

30 August 2011 in Electronic Proceedings in Theoretical Computer Science
Verified
Journal Article
Open access
GFGerhard Friedrich
Gerhard Friedrich
ARAnna Ryabokon
Anna Ryabokon
AFAndreas Falkner
Andreas Falkner
AHAlois Haselböck
Alois Haselböck
GSGottfried Schenner
Gottfried Schenner
HSHerwig Schreiner
Herwig Schreiner
Reconfiguration is an important activity for companies selling configurable products or services which have a long life time. However, identification of a set of required changes in a legacy configuration is a hard problem, since even small changes in the requirements might imply significant modifications. In this paper we show a solution based on answer set programming, which is a logic-based knowledge representation formalism well suited for a compact description of (re)configuration problems. Its applicability is demonstrated on simple abstractions of several real-world scenarios. The evaluation of our solution on a set of benchmark instances derived from commercial (re)configuration problems shows its practical applicability.Comment: In Proceedings LoCoCo 2011, arXiv:1108.609

5 January 2023 in Journal of Artificial Intelligence Research
Verified
Journal Article
Closed access
PDF file
RCRichard Comploi-Taupe
Richard Comploi-Taupe
GFGerhard Friedrich
Gerhard Friedrich
KSKonstantin Schekotihin
Konstantin Schekotihin
AWAntonius Weinzierl
Antonius Weinzierl
Domain-specific heuristics are an essential technique for solving combinatorial problems efficiently. Current approaches to integrate domain-specific heuristics with Answer Set Programming (ASP) are unsatisfactory when dealing with heuristics that are specified non-monotonically on the basis of partial assignments. Such heuristics frequently occur in practice, for example, when picking an item that has not yet been placed in bin packing. Therefore, we present novel syntax and semantics for declarative specifications of domain-specific heuristics in ASP. Our approach supports heuristic statements that depend on the partial assignment maintained during solving, which has not been possible before. We provide an implementation in Alpha that makes Alpha the first lazy-grounding ASP system to support declaratively specified domain-specific heuristics. Two practical example domains are used to demonstrate the benefits of our proposal. Additionally, we use our approach to implement informed search with A*, which is tackled within ASP for the first time. A* is applied to two further search problems. The experiments confirm that combining lazy-grounding ASP solving and our novel heuristics can be vital for solving industrial-size problems.