Sciweavers

5128 search results - page 51 / 1026
» When Abstraction Fails
Sort
View
CORR
2011
Springer
135views Education» more  CORR 2011»
14 years 1 months ago
On the Limitations of Provenance for Queries With Difference
The annotation of the results of database transformations was shown to be very effective for various applications. Until recently, most works in this context focused on positive q...
Yael Amsterdamer, Daniel Deutch, Val Tannen
CSL
2007
Springer
15 years 4 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby
CEEMAS
2005
Springer
15 years 3 months ago
Diagnosis of Plans and Agents
Abstract. We discuss the application of Model-Based Diagnosis in (agentbased) planning. Here, a plan together with its executing agent is considered as a system to be diagnosed. It...
Nico Roos, Cees Witteveen
COMPSAC
2011
IEEE
13 years 9 months ago
Precise Propagation of Fault-Failure Correlations in Program Flow Graphs
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
Zhenyu Zhang, W. K. Chan, T. H. Tse, Bo Jiang
FLAIRS
2006
14 years 11 months ago
A Hill-Climbing Approach for Planning with Temporal Uncertainty
We present a hill-climbing algorithm to solve planning problems with temporal uncertainty. First an optimistic plan that is valid when all actions complete quickly is found. Then ...
Janae N. Foss, Nilufer Onder