Sciweavers

52 search results - page 7 / 11
» Pict Correctness Revisited
Sort
View
TPLP
2008
89views more  TPLP 2008»
13 years 7 months ago
Theory of finite or infinite trees revisited
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...
AMW
2010
13 years 9 months ago
On the Decidability of Consistent Query Answering
Abstract. Consistent query answering (CQA) is about formally characterizing and computing semantically correct answers to queries posed to a database that may fail to satisfy certa...
Marcelo Arenas, Leopoldo E. Bertossi
EATCS
1998
250views more  EATCS 1998»
13 years 7 months ago
Human Visual Perception and Kolmogorov Complexity: Revisited
Experiments have shown [2] that we can only memorize images up to a certain complexity level, after which, instead of memorizing the image itself, we, sort of, memorize a probabil...
Vladik Kreinovich, Luc Longpré
FAST
2009
13 years 5 months ago
Tiered Fault Tolerance for Long-Term Integrity
Fault-tolerant services typically make assumptions about the type and maximum number of faults that they can tolerate while providing their correctness guarantees; when such a fau...
Byung-Gon Chun, Petros Maniatis, Scott Shenker, Jo...
ER
2008
Springer
99views Database» more  ER 2008»
13 years 9 months ago
Relaxed Compliance Notions in Adaptive Process Management Systems
The capability to dynamically evolve process models over time and to migrate process instances to a modified model version are fundamental requirements for any process-aware inform...
Stefanie Rinderle-Ma, Manfred Reichert, Barbara We...