In our research we study rational agents which learn how to choose the best conditional, partial plan in any situation. The agent uses an incomplete symbolic inference engine, emp...
We address the goal of making Delegation Logic (DL) into a practically implementable and tractable trustmanagement system. DL [22] is a logic-based knowledge representation (i.e.,...
These notes discuss formalizing contexts as first class objects. The basic relation is ist(c, p). It asserts that the proposition p is true in the context c. The most important f...
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
Abstract. In recent work, a general framework for specifying program correspondences under the answer-set semantics has been defined. The framework allows to define different not...