Three theses of representation in the semantic web
WWW '03 Proceedings of the 12th international conference on World Wide Web
Proceedings of the fourteenth ACM conference on Hypertext and hypermedia
Augmenting semantic web service descriptions with compositional specification
Proceedings of the 13th international conference on World Wide Web
A proposal for an owl rules language
Proceedings of the 13th international conference on World Wide Web
Ontology-based integration for relational databases
Proceedings of the 2006 ACM symposium on Applied computing
Applying Semantic Web technology to the integration of corporate information
International Journal of Web Engineering and Technology
Constructing a User Preference Ontology for Anti-spam Mail Systems
CAI '07 Proceedings of the 20th conference of the Canadian Society for Computational Studies of Intelligence on Advances in Artificial Intelligence
OWL rules: A proposal and prototype implementation
Web Semantics: Science, Services and Agents on the World Wide Web
An agent-based approach to user-initiated semantic service interconnection
AAMAS'07/SOCASE'07 Proceedings of the 2007 AAMAS international workshop and SOCASE 2007 conference on Service-oriented computing: agents, semantics, and engineering
Ontology translation on the semantic web
Journal on Data Semantics II
Bringing semantics to web services: the OWL-S approach
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
DALT'06 Proceedings of the 4th international conference on Declarative Agent Languages and Technologies
Capturing the functionality of Web services with functional descriptions
Multimedia Tools and Applications
| Hi-index | 0.00 |
The advantage of the RDF/DAML+OIL family of languages over ordinary XML is that it is topic-neutral and composable. However, its expressivity is severely limited. This limitation is well known, and the usual remedy is reification, in which RDF is used to describe formulas in a richer language. We propose a method for encoding typed predicate calculus using reification, which handles bound variables cleanly and causes the size to increase by only a constant multiple. The method generalizes to virtually any system, a claim which we illustrate by describing our program, PDDAML, which encodes domain specifications in PDDL using our technique. We argue that reification, while logically suspect, is in practice benign because any algorithm capable of doing inferences using logical notations can be easily extended to "unreify" those notations as needed. We also argue that the ability to represent predicate calculus on the semantic web is crucial.