Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bernhard Hollunder

dblp:40/3444 · DBLP profile ↗
← Back
16ranked-venue papers
6as first author
0since 2021 · last 2010
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 13 · 4 first-authorSoftware engineering, systems software and programming languages · 3 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 1 first-authorTheory of computation · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
4 papers
Knowledge representation and reasoning · 75% Planning, search and constraint satisfaction · 16% Optimization for machine learning · 9%
Theoretical computer science
2 papers
Logic in computer science · 65% Computational complexity · 35%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Knowledge representation and reasoning
description logic
0.031996
Cardinality Restrictions on Concepts · Artif. Intell. 1996
An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On · KR 1992
Embedding Defaults into Terminological Knowledge Representation Formalisms · KR 1992
Logic in computer science › knowledge representation and reasoning
description logic
0.021992
The Complexity of Existential Quantification in Concept Languages · Artif. Intell. 1992
Qualifying Number Restrictions in Concept Languages · KR 1991
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › global constraints
cardinality constraints
0.011996
Cardinality Restrictions on Concepts · Artif. Intell. 1996
Knowledge, reasoning and agents › Knowledge representation and reasoning › nonmonotonic reasoning
default reasoning
0.011992
Embedding Defaults into Terminological Knowledge Representation Formalisms · KR 1992
Machine learning › Optimization for machine learning
optimization
0.011992
An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On · KR 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning › description logic
terminological knowledge representation
0.011992
Embedding Defaults into Terminological Knowledge Representation Formalisms · KR 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning › description logic
terminological reasoning
0.011992
An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On · KR 1992
Computational complexity › complexity of reasoning
description logic complexity
0.011992
The Complexity of Existential Quantification in Concept Languages · Artif. Intell. 1992
Knowledge, reasoning and agents › Knowledge representation and reasoning
nonmonotonic reasoning
0.011993
How to Prefer More Specific Defaults in Terminological Default Logic · IJCAI 1993

Methods — techniques the papers use, named apart from their topics

concept languages · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
2010 Quality of Service Attributes in Web Services
abstract
As Web Services development grew rapidly since 2002, the need for Quality of Services (QoS) has become a significant factor for building a trustworthy service application. There have been many proposals and frameworks which adds QoS to Web Services. However, few technologies have survived the race and forced their way to standardization. This paper will explore some of what has been done in Web Services QoS in the last decade. Some of the questions answered in this paper are: Where exactly do we stand now in supporting QoS attributes representing non-functional requirements for Web Services? What technologies as well as QoS attributes have proven themselves to be worthy for standardization? Three main models and two main technologies will be discussed, i.e., Web Services Publishing & Discovery, Web Services Description & Handling, and the combination of both. These models are combined with two technologies: Universal Description Discovery and Integration (UDDI) and WS-Policy. This paper will show that many approaches introducing non-functional characteristics to Web Services have mainly considered security, reliable messaging, transaction, accounting, availability and response time as major quality characteristics for Web Services. This paper will conclude that policies has found popularity and acceptance among industry vendors.
Ahmed Al-Moayed, Bernhard Hollunder
ICSEA2
2009 Domain-Specific Processing of Policies or: WS-Policy Intersection Revisited
abstract
We present a new approach for checking the compatibility of policy descriptions. At present, policies are widely used for explicitly expressing non-functional properties, capabilities, constraints and requirements of Web services. Policies are crucial in the negotiation phase of service discovery and selection. Typically, a potential service consumer has its own policy that specifies the conditions the service has to fulfill. Ideally, an automatic negotiation process identifies a mutually agreeable policy for both the Web service consumer and provider. WS-Policy defines policy intersection as a "first approximation" for determining the compatibility of policies. However, policy intersection has a major weakness: It is a purely syntactic approach neglecting the semantics of the involved policy assertions. In addition, it is unspecific on how to include domain-specific processing. In this paper we present a new solution that overcomes these deficits by introducing an entailment relation that reflects the semantics of assertions and policies. This paper not only discusses the formal foundations but also introduces the required algorithms such as "semantic policy differencing".
Bernhard Hollunder
ICWS1
2009 WS-Policy: On Conditional and Custom Assertions
abstract
Today, Web services play a dominant role in Enterprise Application Integration (EAI) and for realizing Service Oriented Architectures (SOA), which define the architectural foundation for various kinds of distributed applications. In many business domains, Web services must exhibit quality attributes such as robustness, security, and maintainability. As a consequence, there is a high demand to develop Web services with Quality of Service (QoS) properties. Several specifications of the WS-* family, e.g. WS-Security and WS-Reliable Messaging, aim at simplifying the development and deployment of QoS-aware Web services. Although these approaches cover some typical application scenarios, their expressivity and flexibility are limited by the underlying WS-Policy framework. This paper proposes the syntax and semantics of a new WS-Policy operator that enables the introduction of conditional assertions. Secondly, a framework for managing different types of custom assertions is presented. Finally, this paper describes a proof of concept implementation demonstrating the practical feasibility of both extensions.
Bernhard Hollunder
ICWS1
1996 Cardinality Restrictions on Concepts
Franz Baader, Martin Buchheit, Bernhard Hollunder
Artif. Intell.3
1995 An alternative proof method for possibilistic logic and its application to terminological logics
Bernhard Hollunder
Int. J. Approx. Reason.1
1995 Embedding Defaults into Terminological Knowledge Representation Formalisms
Franz Baader, Bernhard Hollunder
J. Autom. Reason.2
1995 Priorities on Defaults with Prerequisites, and Their Application in Treating Specificity in Terminological Default Logic
Franz Baader, Bernhard Hollunder
J. Autom. Reason.2
1994 Concept Logics with Function Symbols
Hans-Jürgen Bürckert, Bernhard Hollunder, Armin Laux
ECAI2
1994 An Alternative Proof Method for Possibilistic Logic and its Application to Terminological Logics
Bernhard Hollunder
UAI1
1994 Am empirical analysis of optimization techniques for terminological representation systems
Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi
Appl. Intell.2
1993 How to Prefer More Specific Defaults in Terminological Default Logic
Franz Baader, Bernhard Hollunder
IJCAI2
1992 Embedding Defaults into Terminological Knowledge Representation Formalisms
Franz Baader, Bernhard Hollunder
KR2
1992 An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On
Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, Enrico Franconi
KR2
1992 The Complexity of Existential Quantification in Concept Languages
Francesco M. Donini, Maurizio Lenzerini, Daniele Nardi, Bernhard Hollunder, Werner Nutt, Alberto Marchetti-Spaccamela
Artif. Intell.4
1991 Qualifying Number Restrictions in Concept Languages
Bernhard Hollunder, Franz Baader
KR1
1990 Subsumption Algorithms for Concept Description Languages
Bernhard Hollunder, Werner Nutt, Manfred Schmidt-Schauß
ECAI1