18 search results - page 3 / 4 » Proof explanation for a nonmonotonic Semantic Web rules lang... |
AI
2011
Springer
13 years 9 days ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
JAPLL
2007
13 years 5 months ago
2007
We extend answer set programming (ASP) with, possibly infinite, open domains. Since this leads to undecidable reasoning, we restrict the syntax of programs, while carefully guard...
IS
2006
13 years 5 months ago
2006
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses a Semantic Web service language (DAML-S)...
GCC
2003
Springer
13 years 10 months ago
2003
Springer
This paper introduces a method for automatic composition of semantic web services using linear logic theorem proving. The method uses semantic web service language (DAML-S) for ext...
ICWS
2004
IEEE
13 years 6 months ago
2004
IEEE
This paper introduces a method for automatic composition of Semantic Web services using Linear Logic (LL) theorem proving. The method uses Semantic Web service language (DAML-S) f...