Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
How to achieve shared meaning is a significant issue when more than one intelligent agent is involved in the same domain. We define the task of concept convergence, by which intell...
In this paper I examine the issue of whether we can trust software systems and put forward an argument that in an absolute sense the answer must necessarily be no for a multitude ...
Abstract. Explanation based learning produces generalized explanations from examples. These explanations are typically built in a deductive manner and they aim to capture the essen...