|
Size: 1482
Comment:
|
Size: 551
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 7: | Line 7: |
Systems and languages based on ASP are ready for tackling many of the challenges the Semantic Web offers, and in particular, are good candidates for solving a variety of issues which have been delegated to the Rule/Logic Layers in the Semantic Web vision. ASP systems are scalable, allow to mix monotonic with nonmonotonic reasoning, permit to combine rules with ontologies, and can interface external reasoners. Moreover, ASP is especially tailored at solving configuration and matchmaking problems involving reasoning with preferences by featuring easy to use, fully declarative soft & hard constraint specification languages. We introduce the attendees to the ASP basics and its principal extensions tailored at Semantic Web applications. We discuss the current impact of Answer Set Programming in the Semantic Web Area and possible future directions. Applications and exercises are presented. The attendees will practice through an online interface using one of the state-of-the-art ASP solvers and some of its extensions. |
---- Slides, exercises and hands out will be available from this page from around May 15th 2006. |
Budva, Montenegro, June 11th 2006. Co-located with the 3d European Semantic Web Conference
Tutorial
The purpose of this tutorial is to get the audience familiar with the Answer Set Programming (ASP) Paradigm in the perspective of its fruitful usage for Semantic Web applications. ASP is a declarative programming paradigm with its roots in Knowledge Representation and Logic Programming.
- Slides, exercises and hands out will be available from this page from around May 15th 2006.