Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
We present a general approach for representing and reasoning with sets of defaults in default logic, focussing on reasoning about preferences among sets of defaults. First, we con...
This paper provides general information about research at the University of Auckland into autonomous agents in highly dynamic environments, in particular in RoboCup. The paper desc...
In this paper we are interested in argument based reasoning for access control, for example in the context of agents negotiating access to resources or web services in virtual orga...
Guido Boella, Joris Hulstijn, Leendert W. N. van d...