Abstract. We present an approach to increasing the effectiveness of rankedoutput retrieval systems that relies on graphical display and user manipulation of “views” of retrieva...
Abstract. We consider the problem of verifying the safety of wellstructured transition systems (WSTS) with auxiliary storage. WSTSs with storage are automata that have (possibly) i...
Abstract. Robots need to ground their external vocabulary and internal symbols in observations of the world. In recent works, this problem has been approached through combinations ...
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
Abstract. In this paper, we investigate how an IA network can be effectively encoded into the SAT domain. We propose two basic approaches to modelling an IA network as a CSP: one r...