In reasoning tasks involving logical formulas, high expressiveness is desirable, although it often leads to high computational complexity. We study a simple measure of expressiven...
This paper argues for new computational mechanisms to aid specification of requirements for composite systems. It presents mechanisms for storing specification fragments, or viewp...
Neil A. M. Maiden, Alistair G. Sutcliffe, Petia As...
A dialogue game based approach to the problem of providing a deeper semantic foundation for t-norm based fuzzy logics is explored. In particular, various versions, extensions and ...
ODRL is a popular XML-based language for stating the conditions under which resources can be accessed. The language is underspecified, and can be reasonably interpreted in a number...
This article presents the formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C and compiler intermediate languages. Be...