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...
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...
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...
Abstract—Statistical fault localization techniques find suspicious faulty program entities in programs by comparing passed and failed executions. Existing studies show that such ...
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 ...