Sciweavers

619 search results - page 102 / 124
» Paraconsistent Reasoning for the Semantic Web
Sort
View
AAAI
2007
13 years 10 months 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
CORR
2010
Springer
180views Education» more  CORR 2010»
13 years 5 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
12 years 11 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
DASFAA
2007
IEEE
156views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient and Scalable Management of Ontology
Abstract. OWL is a recommended language for publishing and sharing ontologies on the Semantic Web. To manage the ontologies, several OWL data management systems have been proposed....
Myung-Jae Park, Jihyun Lee, Chun-Hee Lee, Jiexi Li...
COMMA
2008
13 years 9 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