99 search results - page 5 / 20 » Extending Classical Theorem Proving for the Semantic Web |
COMBINATORICS
1998
14 years 9 months ago
1998
We discuss some problems of lattice tiling via Harmonic Analysis methods. We consider lattice tilings of Rd by the unit cube in relation to the Minkowski Conjecture (now a theorem...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
EPEW
2005
Springer
15 years 3 months ago
2005
Springer
webπ is a recent process calculus introduced to formally specify Web Services composition. It extends the π-calculus with timed workunits, namely an asynchronous and temporized m...
FROCOS
2000
Springer
15 years 1 months ago
2000
Springer
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
WWW
2009
ACM
15 years 4 months ago
2009
ACM
Most of the approaches for dealing with uncertainty in the Semantic Web rely on the principle that this uncertainty is already asserted. In this paper, we propose a new approach t...