The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
Representing and reasoning about time dependent information is a key research issue in many areas of computer science and artificial intelligence. One of the best known and widely...
In the paper "Extensional PERs" by P. Freyd, P. Mulry, G. Rosolini and D. Scott, a category C of "pointed complete extensional PERs" and computable maps is int...
Peter J. Freyd, P. Mulry, Giuseppe Rosolini, Dana ...
Abstract. Argument-based formalisms are gaining popularity as models of nonmonotonic reasoning. Central in such formalisms is a notion of argument. Arguments are formal reconstruct...
We report on our experience implementing a lightweight, fully verified relational database management system (RDBMS). The functional specification of RDBMS behavior, RDBMS impleme...
Avraham Shinnar, Greg Morrisett, J. Gregory Malech...