Sciweavers

1168 search results - page 64 / 234
» cases 2000
Sort
View
ECAI
2000
Springer
14 years 1 months ago
Verification Programs for Abduction
Abstract. We call verification the process of finding the actual explanation of a given set of manifestations. We consider an abductive setting, in which explanations are sets of a...
Paolo Liberatore, Francesco M. Donini
ICDE
2000
IEEE
120views Database» more  ICDE 2000»
14 years 11 months ago
Query Planning with Limited Source Capabilities
In information-integration systems, sources may have diverse and limited query capabilities. In this paper we show that because sources have restrictions on retrieving their infor...
Chen Li, Edward Y. Chang
PODS
2000
ACM
112views Database» more  PODS 2000»
14 years 2 months ago
Auditing Boolean Attributes
We study the problem of auditing databases which support statistical sum queries to protect the security of sensitive information; we focus on the special case in which the sensit...
Jon M. Kleinberg, Christos H. Papadimitriou, Prabh...
ICALP
1994
Springer
14 years 2 months ago
On the Cost of Recomputing: Tight Bounds on Pebbling with Faults
We introduce a formal framework to study the time and space complexity of computing with faulty memory. For the fault-free case, time and space complexities were studied using the...
Yonatan Aumann, Judit Bar-Ilan, Uriel Feige
PTS
2000
58views Hardware» more  PTS 2000»
13 years 11 months ago
Formal Test Automation: The Conference Protocol with PHACT
We discuss a case study of automatic test generation and test execution based on formal methods. The case is the Conference Protocol, a simple, chatbox-like protocol, for which (fo...
Lex Heerink, Jan Feenstra, Jan Tretmans