Abstract. Bayesian nets (BNs) appeared in the 1980s as a solution to computational and representational problems encountered in knowledge representation of uncertain information. S...
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...
Xingyuan Zhang, Malcolm Munro, Mark Harman, Lin Hu
Abstract. Formal grammars are well established for specifying the syntax of programming languages. However, the formal specification of programming language semantics has proven mo...
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
Abstract. This work focuses on characterizing scenery images. We semantically divide the objects in natural landscape scenes into background and foreground and show that the shapes...