Metamodels precisely define the constructs and underlying well-formedness rules for modelling languages. They are vital for tool vendors, who aim to provide support so that concrete models can be checked formally and automatically against a metamodel for conformance. This paper describes how an executable metamodel – which supports fully automated conformance checking – was developed using a mo...

In this paper, parsing with dependency grammar is modeled as a constraint satisfaction problem. A restricted kind of constraints is proposed, which is simple enough to be implemented efficiently, but which is also rich enough to express a wide variety of grammatical well-formedness conditions. We give a number of examples to demonstrate how different kinds of linguistic knowledge can be encoded...

The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper we show how to get message boundedness “for free” under a reasonable (s...

In this paper, we present the foundations and the properties of the Dislog language, a logic-based language designed to describe and implement discourse structure analysis. Dislog has the flexibility and the expressiveness of a rule-based system, it offers the possibility to include knowledge and reasoning capabilities and the expression a variety of well-formedness constraints proper to discou...

Generative grammarians have relied on introspective intuitions of well-formedness as their primary source of data. The overreliance on this one type of data and the unsystematic manner in which they are collected cast doubt on the empirical basis of a great deal of syntactic theorizing. These concerns are illustrated with examples and one more detailed case study, concerning the English verb-pa...

The survey of related work on ontological studies in the IT services domain, allowed us to identify some serious limitations on the current state-of-the-art across a set of six maturity dimensions. To mitigate that shortcoming this paper proposes a formal ontology for IT services. To grant preciseness to this ontology we have expressed well-formedness rules with the OCL constraint language. The...

• Pragmatic competition must be sensitive to the grammatical well-formedness of alternatives: alternatives must be grammatical in order to compete. • In cases where meanings are not associated with particular morphemes but with complex constructions, deriving certain implicatures must involve comparison between syntactically complex expressions. • For such cases, comparing themeanings of isolat...

We present an operational framework allowing to express a large scale Tree Adjoining Grammar (TAG) by using higher level operational constraints on tree descriptions. These constraints first meant to guarantee the well formedness of the grammatical units may also be viewed as a way to put model theoretic syntax at work through an efficient offline grammatical compilation process. Our strategy p...

We propose a formal system for representing the available readings of sentences displaying quan-tiier scope ambiguity, in which partial scopes may be expressed. We show that using a theory of scope availability based upon the function-argument structure of a sentence allows a deter-ministic, polynomial time test for the availability of a reading, while solving the same problem within theories b...

The verification of security protocols has been proven to be undecidable in general. Different approaches use simplifying hypotheses in order to obtain decidability for interesting subclasses. Amongst the most common is type abstraction, i.e. considering only well-typed runs, therefore bounding message length. In this paper we show how to get message boundedness “for free” under a reasonable (s...