formal point of view. In this paper, we propose a formal foundation for lexical functions based on two complementary encoding devices which we believe are computationally tractable and fill the gaps of the traditional formal language of lexical functions. 1

point of view. In this paper, we propose a formal foundation for lexi-cal functions based on two complemen-tary encoding devices which we believe are computationally tractable and fill the gaps of the traditional formal language of lexical functions.

Over the recent decades there has been a trend towards formalized mathematics, and a number of sophisticated systems have been developed to support the formalization process and mechanically verify its result. However, each tool is based on a speci c foundation of mathematics, and formalizations

ODRL is a popular XML-based language for stating the conditions under which resources can be accessed legitimately. The language is described in English and, as a result, agreements written in ODRL are open to interpretation. To address this problem, we propose a formal semantics for a

Combining information from the current utterance with its context in some discourse is a very general task for which many dierent approaches have been proposed. For dialog systems with frame-based representations, we present a single, well-formalized operation, called overlay that computes

We would like to know with very high confidence that private data in computers is not unintentionally disclosed and that only authorized persons or processes can modify it. Proving security properties of software systems has always been hard because we are trying to show that something bad cannot happen no matter what a hostile adversary tries

This paper develops the formal foundations of semantic theories dealing with various kinds of nominalisations. It introduces a combination of an event-calculus with a type-free theory which allows a compositional description to be given of such phenomena like Vendler‘s distinction between perfect

Abstract. In this paper we discuss a formal foundation of systems engineering based on category theory. The main difference with other categorical approaches is the choice of the structure of the base category (symmetric monoidal or compact closed) which is, on the one hand, much better adapted

of the system. However, it is not desired that the evolution influences one or more modules of the system that are functionally or logically not related to the evolution; the behavior and structure of these modules should be preserved. In this position paper, we introduce an algebra as a formal foundation

One of the strengths of scientific inquiry is that it can progress with any mixture of empiricism, intuition, and formal theory that suits the convenience of the investigator.