We present an efficient algorithm for the redundancy elimination problem: Given an underspecified semantic representation (USR) of a scope ambiguity, compute an USR with fewer mut...
We describe a method for interpreting abstract fiat syntactic representations, LFG fstructures, as underspecified semantic representations, here Underspecified Discourse Represent...
Abstract. This paper presents a feature constraint system that, compared with the well-known systems OSF 1] and CFT 5], incorporates several interesting characteristics. The new sy...
We present a stochastic version of Concurrent Constraint Programming (CCP), where we associate a rate to each basic instruction that interacts with the constraint store. We give a...
Current critical systems often use a lot of floating-point computations, and thus the testing or static analysis of programs containing floatingpoint operators has become a priori...