Knowledge engineering rediscovered: towards reasoning patterns for the semantic web

Authors:
Frank van Harmelen;Annette ten Teije;Holger Wache
Affiliations:
Vrije Universiteit, Amsterdam, Netherlands;Vrije Universiteit, Amsterdam, Netherlands;University of Applied Sciences Northwestern Switzerland, Olten, Switzerland
Venue:
Proceedings of the fifth international conference on Knowledge capture
Year:
2009

Citing 6
Cited 3

Heuristic classification

Artificial Intelligence
Generic tasks for knowledge-based reasoning: the “right” level of abstraction for knowledge acquisition

International Journal of Man-Machine Studies - Knowledge acquisition for knowledge-based systems. Part 2
Object-oriented patterns: lessons from expert systems

Software—Practice & Experience
Knowledge engineering and management: the CommonKADS methodology

Knowledge engineering and management: the CommonKADS methodology
Common KADS Library for Expertise Modelling

Common KADS Library for Expertise Modelling
Towards scalable ontology engineering patterns: lessons learned from an experiment based on W3C's part-whole guidelines

AOW '06 Proceedings of the second Australasian workshop on Advances in ontologies - Volume 72

Enhancing content-based recommendation with the task model of classification

EKAW'10 Proceedings of the 17th international conference on Knowledge engineering and management by the masses
Reflections on 25+ years of knowledge acquisition

International Journal of Human-Computer Studies
Towards a theoretical foundation for the harmonization of linked data

ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part II

Quantified Score

Hi-index	0.00

Visualization

Abstract

The extensive work on Knowledge Engineering in the 1990s has resulted in a systematic analysis of task-types, and the corresponding problem solving methods that can be deployed for different types of tasks. That analysis was the basis for a sound and widely accepted methodology for building knowledge-based systems, and has made it is possible to build libraries of reusable models, methods and code. In this paper, we make a first attempt at a similar analysis for Semantic Web applications. We will show that it is possible to identify a relatively small number of task-types, and that, somewhat surprisingly, a large set of Semantic Web applications can be described in this typology. Secondly, we show that it is possible to decompose these task-types into a small number of primitive ("atomic") inference steps. We give semi-formal definitions for both the task-types and the primitive inference steps that we identify. We substantiate our claim that our task-types are sufficient to cover the vast majority of Semantic Web applications by showing that all entries of the Semantic Web Challenges of the last 3 years can be classified in these task-types.