Uwe Keller

Semantic Web Fred - Automated Goal Resolution on the Semantic Web

Semantic Web Fred, SWF for short, is a context-independent, goal-driven system for automated execution of tasks that are delegated to electronic representatives along with dynamic service usage. A task is assigned to an agent for automated resolution, represented as a Goal. This is used to determine potential partners for collaborative task resolution, and for discovery of suitable goal-resolving services that can be internal implementations as well as external Semantic Web Services. The SWF technology integrates agent technology, ontologies, and Semantic Web Service technologies - the technological building blocks identified for the Semantic Web - into a coherent system. This paper describes the architecture of SWF, explains the mechanisms for establishing automated and cooperative goal resolution, and the alignment of SWF with the Web Service Modeling Ontology WSMO, a well-structured overall framework for Semantic Web Services. We also outline the contribution of SWF to the development of Semantic Web technologies.

Fuzzy Description Logic Reasoning Using a Fixpoint Algorithm

We present

Functional Description of Web Services

{\mathbf{FixIt}}{\mathbb{(ALC)}}

What is wrong with Web services Discovery

, a novel procedure for deciding knowledge base (KB) satisfiability in the Fuzzy Description Logic (FDL)

Inferencing Support for Semantic Web Services: Proof Obligations

{\mathbb{ALC}}

Deciding fuzzy description logics by type elimination

.

D2v02. Web Service Modeling Ontology - Standard (WSMO - Standard)

{\mathbf{FixIt}}{\mathbb{(ALC)}}

Behavioral Description of Services

does not search for tree-structured models as in tableau-based proof procedures, but embodies a (greatest) fixpoint-computation of canonical models that are not necessarily tree-structured, based on a type-elimination process. Soundness, completeness and termination are proven and the runtime and space complexity are discussed. We give a precise characterization of the worst-case complexity of deciding KB satisfiability (as well as related terminological and assertional reasoning tasks) in

The Basic WSML Language

{\mathbb{ALC}}

Servicios Web Semánticos con WSMO

in the general case and show that our method yields a worst-case optimal decision procedure (under reasonable assumptions). To the best of our knowledge it is the first fixpoint-based decision procedure for FDLs, hence introducing a new class of inference procedures into FDL reasoning.