A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and sy...

A general framework for minimisation-based belief change is presented. A problem instance is made up of an undirected graph, where a formula is associated with each vertex. For example, vertices may represent spatial locations, points in time, or some other notion of locality. Information is shared between vertices via a process of minimisation over the graph. We give equivalent semantic and sy...

We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Minimisation via forward bisimulation is also effective for deterministic automata and faster than the previous algorithm. Minimisation via backward bisimulation generalises the previous algorithm and is thus more effecti...

New terminology and new jargon often conceal the fact that what is being described is not new. This is the case with 'harm-minimisation'. It is only in the last few years that the general term 'harm-minimisation' has been used but in fact agencies have been promoting practices which could be described in this way for some considerable time. For example, in Sexually Transmitted Diseases Clinics ...

A key component of an efficient multipath routing is the optimal traffic allocation strategy that deals with how the traffic should be distributed among the multiple paths. In this study, two intelligent traffic distribution policies that minimise the experienced delay by the end user are proposed. For such delay minimisation, the authors investigate and compare average delay minimisation and m...

We consider the state-minimisation problem for weighted and probabilistic automata. We provide a numerically stable polynomialtime minimisation algorithm for weighted automata, with guaranteed bounds on the numerical error when run with floating-point arithmetic. Our algorithm can also be used for “lossy” minimisation with bounded error. We show an application in image compression. In the secon...

This paper discusses chronological minimisation and the problem of representing common sense explanatory causal reasoning. The background of chronological minimisation is brieey surveyed. Then prioritised chronological minimisation is introduced. Finally, it is shown that this can be used as a basis for representing explanation.