%0 Conference Paper %1 Harmelen09KCAP %A van Harmelen, Frank %A ten Teije, Annette %A Wache, Holger %B Proceedings of The Fifth International Conference on Knowledge Capture %D 2009 %E Noy, N. %I ACM %K engineering knowledge reasoning semantic web %P 81--88 %T Knowledge Engineering Rediscovered: Towards Reasoning Patterns for the Semantic Web %X 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 anal- ysis 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 analy- sis 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 ty- pology. Secondly, we show that it is possible to decom- pose these task-types into a small number of primitive (“atomic”) inference steps. We give semi-formal defini- tions 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 en- tries of the Semantic Web Challenges of the last 3 years can be classified in these task-types

@inproceedings{Harmelen09KCAP, 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 anal- ysis 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 analy- sis 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 ty- pology. Secondly, we show that it is possible to decom- pose these task-types into a small number of primitive (“atomic”) inference steps. We give semi-formal defini- tions 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 en- tries of the Semantic Web Challenges of the last 3 years can be classified in these task-types}, added-at = {2009-11-06T10:47:55.000+0100}, author = {van Harmelen, Frank and ten Teije, Annette and Wache, Holger}, biburl = {https://www.bibsonomy.org/bibtex/2809d45017169871c36b21d00a3fc5e7e/annette@cs.vu.nl}, booktitle = {Proceedings of The Fifth International Conference on Knowledge Capture}, editor = {Noy, N.}, interhash = {2962f24c21458d20678de3371dd0961d}, intrahash = {809d45017169871c36b21d00a3fc5e7e}, keywords = {engineering knowledge reasoning semantic web}, month = {september}, pages = {81--88}, publisher = {ACM}, timestamp = {2009-11-06T16:34:45.000+0100}, title = {Knowledge Engineering Rediscovered: Towards Reasoning Patterns for the Semantic Web}, year = 2009 }