Abstract. Solvers for satisfiability modulo theories (SMT) check the satisfiability of first-order formulas containing operations from various theories such as the Booleans, bit-ve...
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
Abstract. In the context of Service Oriented Computing, contracts are descriptions of the observable message-passing behavior of services. Contracts have been already successfully ...
Abstract In this paper we describe a form of communication that could be used for lifelong learning as contribution to cultural computing. We call it Kansei Mediation. It is a mult...
: This essay provides a perspective on several issues in valence bond theory: the physical significance of semilocal bonding orbitals, the capability of valence bond concepts to e...