5818 search results - page 826 / 1164 » A reasonable Semantic Web |
139
click to vote
COMPSAC
2009
IEEE
15 years 11 months ago
2009
IEEE
Non-terminating programs are programs that legally perform unbounded computations. Though they are ubiquitous in real-world applications, testing these programs requires new theor...
168
click to vote
TACAS
1999
Springer
15 years 11 months ago
1999
Springer
We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order...
202
click to vote
ER
1993
Springer
15 years 11 months ago
1993
Springer
Two major problems in schema integration are to identify correspondences between different conceptual schemas and to verify that the proposed correspondences are consistent with th...
181
click to vote
AUSAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A novel declarative approach of forgetting in answer set programming (ASP) has been proposed recently. In this paper we report a system prototype of forgetting in ASP, ca...
177
click to vote
DSOM
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes an open, extensible control plane for a global event service, based on semantically rich messages. This is based on the novel application of control plane separ...