Showing papers in "Journal of Web Semantics in 2005"
••
TL;DR: This work describes the method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications and presents the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks.
1,446 citations
••
TL;DR: A decidable combination of OWL-DL and function-free Horn rules where rules are required to be DL-safe: each variable in the rule is required to occur in a non-DL-atom in therule body.
598 citations
••
TL;DR: The Flink system for the extraction, aggregation and visualization of online social networks is presented and a novel method to social science based on electronic data is demonstrated using the example of the Semantic Web research community.
416 citations
••
TL;DR: The Semantic Web Rule Language (SWRL), a Horn clause rules extension to OWL that overcomes many of these limitations, is presented and the ontology consistency problem is undecidable.
346 citations
••
TL;DR: It is proved that entailment for RDF Schema (RDFS) is decidable, NP-complete, and in P if the target graph does not contain blank nodes, and that consistency is in P.
337 citations
••
TL;DR: A number of debugging cues generated from the authors' reasoner, Pellet, are integrated in their hypertextual ontology development environment, Swoop, and it is demonstrated that these debugging cues significantly improve the OWL debugging experience, and point the way to more general improvements in the presentation of an ontology to users.
252 citations
••
TL;DR: It is proved that reasoning in r-hybrid KBs whose structural component is specified in the Web Ontology Language OWL-DL is decidable.
200 citations
••
[...]
TL;DR: In this paper, the authors extend the syntax and semantics of RDF to cover named graphs, which enables RDF statements that describe graphs, useful in many Semantic Web application areas.
196 citations
••
TL;DR: The Semantic Web portal MuseumFinland as mentioned in this paper is a semantic portal for publishing heterogeneous museum collections on the Semantic web, and it is shown how museums with their semantically rich and interrelated collection content can create a large, consolidated semantic collection portal together on the web.
174 citations
••
TL;DR: This paper developed a framework for (semi-)automatic ontology learning from textual sources attached to Web services that exploits the fact that these sources are expressed in a specific sublanguage, making them amenable to automatic analysis.
124 citations
••
IBM1
TL;DR: The proposed solution is based on a novel two-staged composition approach that addresses the information modeling aspects of web services, provides support for contextual information while composing services, employs efficient decoupling of functional and non-functional requirements, and leads to improved scalability and failure handling.
••
TL;DR: This paper presents ENQUIRER, an HTN-planning algorithm designed for planning domains in which the information about the initial state of the world may not be complete, but it is discoverable through plan-time information-gathering queries.
••
TL;DR: It is argued that with tools such as Haystack, semantic blogging will be an important paradigm by which metadata authoring will occur in the future and proposed means to bring blogging into the mainstream of the Semantic Web, including ontologies that extend the RSS 1.0 specification.
••
TL;DR: The key features of the current implementation of OntoTrack are described and future work is discussed, as well as some development issues.
••
TL;DR: The ec(h)o proved that ontologies and rules provide an excellent platform for building a highly-responsive context-aware interactive application and the lessons learned that provide a transferable generic knowledge for similar type of applications.
••
TL;DR: An approach for automatic generation of F-Logic frames out of tables which subsequently supports the automatic population of ontologies from table-like structures is presented.
••
TL;DR: G-ToPSS is introduced, a scalable publish/subscribe system for selective information dissemination that provides an expressive, efficient, and convenient update notification dissemination system and results demonstrating its scalability are provided.