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...

Representing clinical guidelines is a very complex knowledge-representation task, requiring a lot of expertise and efforts. Nevertheless, guideline representations often contain several kinds of errors. Therefore, checking the well-formedness and correctness of a guideline representation is an important task, which can be drastically improved with the adoption of computer programs. In this pape...

The aim of this paper is to propose a natural definition of a winding number for a m-note mode, generalizing the concept of well formedness (proposed by Carey and Clampitt) providing and discussing some aspects regarding the Stern-Brocot trees. We start by giving an algebraic definition of a m-notes mode in a chromatic set of n elements as a composed map between Zm and Zn. Then we introduce the...

This paper describes two experiments conducted to identify the role of synchronization in the perception of ‘speech and gesture’ communication and to isolate the parameters that determine the perception of temporal alignment. The results of the first experiment show that the synchronization between audio and visual signals determines the felicitousness of a multimodal utterance. With the second...

Java `ight is a large sequential sublanguage of Java. We formalize its abstract syntax, type system, well-formedness conditions, and an operational evaluation semantics. Based on this formalization, we can express and prove type soundness. All de nitions and proofs have been done formally in the theorem prover Isabelle/HOL. Thus this paper demonstrates that machine-checking the design of non-tr...