For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Abstract. There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing con...
Abstract. We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL∗ ) properties of finite state reactive systems. The finite state ...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...
Abstract. In this paper we focus on the problem of testing agent programs written in BUpL, an executable, high-level modelling agent language. Our approach consists of two main ste...
Lacramioara Astefanoaei, Frank S. de Boer, M. Birn...
— Predicting oil recovery efficiency of deepwater reservoirs is a challenging task. One approach to characterize and predict the producibility of a reservoir is by analyzing its...
Tina Yu, Dave Wilkinson, Julian Clark, Morgan Sull...