Being able to declaratively specify control within a planning (or theorem-proving) paradigm is necessary if we are to build intelligent machines. This paper introduces an implemen...
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decisi...
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Abstract. We are designing new data mining techniques on gene expression data, more precisely inductive querying techniques that extract a priori interesting bi-sets, i.e., sets of...