99 search results - page 3 / 20 » Extending Classical Theorem Proving for the Semantic Web |
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...
APSEC
2004
IEEE
13 years 9 months ago
2004
IEEE
Semantic Web is regarded as the next generation of the World Wide Web. It provides not only the structure of the web but also meaningful semantics for the information presented. T...
TARK
2005
Springer
13 years 11 months ago
2005
Springer
s for Multi-Agent Only Knowing (extended abstract) Arild Waaler1,2 and Bjørnar Solhaug3,4 1 Finnmark College, Norway 2 Dep. of Informatics, University of Oslo, Norway 3 SINTEF ICT...
PADL
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. Modern web forms interact with the user in real-time by detecting errors and filling-in implied values, which in terms of automated reasoning amounts to SAT solving and ...
TCC
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...