99 search results - page 6 / 20 » Extending Classical Theorem Proving for the Semantic Web |
APLAS
2008
ACM
14 years 11 months ago
2008
ACM
We define a small-step operational semantics for the ECMAScript standard language corresponding to JavaScript, as a basis for analyzing security properties of web applications and ...
TPHOL
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
84
Voted
RANDOM
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...
121
click to vote
ICWS
2004
IEEE
14 years 11 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...
TLCA
2005
Springer
15 years 3 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...