99 search results - page 11 / 20 » Extending Classical Theorem Proving for the Semantic Web |
106
click to vote
LICS
2010
IEEE
14 years 9 months ago
2010
IEEE
Stream circuits are a convenient graphical way to represent streams (or stream functions) computed by finite dimensional linear systems. We present a sound and complete expression...
93
Voted
SLP
1994
15 years 10 days ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
TPHOL
2005
IEEE
15 years 4 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
WWW
2008
ACM
15 years 11 months ago
2008
ACM
Context-awareness is highly desired across several application domains. Semantic Web Services (SWS) enable the automatic discovery of distributed Web services based on comprehensi...
JCT
2002
14 years 10 months ago
2002
In [1], the author generalized Ehrhart's idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vert...