Abstract
In this paper general mechanisms and syntactic restrictions are explored in order to specify and merge rule bases in the Semantic Web. Rule bases are expressed by extended logic programs having two forms of negation, namely strong (or explicit) and weak (also known as default negation or negation-as-failure). The proposed mechanisms are defined by very simple modular program transformations, and integrate both open and closed world reasoning. These program transformations are shown to be appropriate for the two major semantics for extended logic programs: answer set semantics and well-founded semantics with explicit negation. Moreover, the results obtained by both semantics are compared.
| Original language | English |
|---|---|
| Title of host publication | Principles and Practice of Semantic Web Reasoning |
| Subtitle of host publication | 4th International Workshop, PPSWR 2006, Revised Selected Papers |
| Editors | Jóse Júlio Alferes, James Bailey, Wolfgang May, Uta Schwertel |
| Publisher | Springer-Verlag Berlin Heidelberg |
| Pages | 149-163 |
| Number of pages | 15 |
| Volume | 4187 LNCS |
| ISBN (Electronic) | 9783540395874 |
| ISBN (Print) | 3540395865, 9783540395867 |
| DOIs | |
| Publication status | Published - 2006 |
| Externally published | Yes |
| Event | 4th International Workshop on Principles and Practice of Semantic Web Reasoning - Buda, Hungary Duration: 10 Jun 2006 → 11 Jun 2006 Conference number: 4 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 4187 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 4th International Workshop on Principles and Practice of Semantic Web Reasoning |
|---|---|
| Abbreviated title | PPSWR 2006 |
| Country/Territory | Hungary |
| City | Buda |
| Period | 10/06/06 → 11/06/06 |