Set Based Analysis is an e cient and accurate program analysis for higher order lan guages It exploits an intuitive notion of approximation that treats program variables as sets of values We present a new derivation of set based analysis based on a reduc tion semantics that substantially simpli es previous formulations Most importantly the derivation easily extends from a functional core langua...

This paper describes the Syrinx Spoken Language Sys tem (Sylan), an automated dialogue system that is fully integrated with the Syrinx Large Voca bulary Speech Recogniser (Sycon) into the Syrinx SpeechMaster platform. This platform combines speech recognit ion, natural language processing, dialogue management, telephony and database integra tion into a robust and flexible Voice User Interface t...

We present a compiler that translates a problem speciica-tion into a propositional satissability test (SAT). Problems are speciied in a logic-based language, called np-spec, which allows the deenition of complex problems in a highly declarative way, and whose expressive power is such to capture exactly all problems which belong to the complexity class NP. The target SAT instance is solved using...

Nominalization is a highly productive phenomena in most languages. The process of nominaliza-tion ejects a verb from its syntactic role into a nominal position. The original verb is often replaced by a semantically emptied support verb (e.g., make a proposal). The choice of a support verb for a given nomi-nalization is unpredictable, causing a problem for language learners as well as for natura...

The functional logic programming language Curry integrates features from functional logic and concurrent programming It combines lazy evaluation higher order functions logic variables partial data struc tures built in search and the concurrent evaluation of equational con straints Curry amalgamates the most important operational principles developed in the area of integrated functional logic la...

We extend the ontology and foundational axioms of the sequential situation calculus to include time. When combined with a view of actions with durations as processes that are initiated and terminated by instantaneous actions, this explicit representation of time yields a very rich account of interleaving concurrency in the situation calculus. Based upon this axiomatiza-tion, we extend the seman...

A proof system for timed automata is presented, based on a CCS-style language for describing timed automata. It consists of the standard monoid laws for bisimula-tion and a set of inference rules. The judgments of the proof system are conditional equations of the form t = u where is a clock constraint and t, u are terms denoting timed automata. It is proved that the proof system is complete ove...

We consider the information modeling issues in en vironments that range from multidatabase manipula tions supporting direct DBMS level interfaces to mul tiple database to multisystem applications involving activities among multiple application systems Infor mation modeling needs in such environments go far beyond the use of traditional data models to develop database schemas or application view...

The LE-3 project ARISE (Automatic Railway Information Sys­ tems for Europe) ran from October 1996 through December 1998. Four prototypes of train timetable information systems for three different languages were developed, tested, and validated: Italian (based on technology developed by CSELT), French (two systems, one based on Philips technology, the other on technology by LIMSI), and Dutch (ba...

The practical application of formal description techniques (FDT's) is becoming increasingly important in computing. However, there remains a gulf in the literature between the language of application developers and the more theoretical language often used to describe formal methods. The aim of this paper is to try to bridge this gap by introducing the formal description technique, LOTOS, in a n...