Sciweavers

677 search results - page 113 / 136
» Uncertainty Reasoning for the Semantic Web
Sort
View
AAAI
2007
15 years 14 hour ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
COMMA
2008
14 years 11 months ago
Arguments in OWL: A Progress Report
Abstract. In previous work, we presented an RDFS ontology, based on the Argument Interchange Format (AIF), for describing arguments and argument schemes. We also implemented a pilo...
Iyad Rahwan, Bita Banihashemi
DLOG
2006
14 years 11 months ago
Extending the SHOIQ(D) Tableaux with DL-safe Rules: First Results
On the Semantic Web, there has been increasing demand for a ruleslike expressivity that goes beyond OWL-DL. Efforts of combining rules languages and description logics usually pro...
Vladimir Kolovski, Bijan Parsia, Evren Sirin
CORR
2010
Springer
180views Education» more  CORR 2010»
14 years 7 months ago
XSB: Extending Prolog with Tabled Logic Programming
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
Terrance Swift, David Scott Warren
DLOG
2011
14 years 1 months ago
Integrity Constraints for Linked Data
Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked da...
Alan Jeffrey, Peter F. Patel-Schneider