In this paper we prove that a transitive fuzzy relation R on a set X can be extended to a total transitive fuzzy relation Q on X preserving the irreflexivity of R. This generaliz...
We describe KAT-ML, an implementation of an interactive theorem prover for Kleene algebra with tests (KAT). The system is designed to reflect the natural style of reasoning with K...
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
We introduce a resource adaptive agent mechanism which supports the user of an interactive theorem proving system. The mechanism, an extension of 5 , uses a two layered architectur...