Sciweavers

815 search results - page 150 / 163
» Algebraic Recognizability of Languages
Sort
View
66
Voted
CP
2006
Springer
15 years 1 months ago
Approximability of Integer Programming with Generalised Constraints
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
Peter Jonsson, Fredrik Kuivinen, Gustav Nordh
IJCAI
2007
14 years 11 months ago
Tractable Temporal Reasoning
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
Clare Dixon, Michael Fisher, Boris Konev
83
Voted
ROOM
2000
14 years 11 months ago
Checking the Consistency of UML Class Diagrams Using Larch Prover
The Unified Modeling Language (UML) has been designed to be a full standard notation for Object-Oriented Modelling. UML is a rather complete set of notations, but it lacks of form...
Pascal André, Annya Romanczuk, Jean-Claude ...
LFP
1994
129views more  LFP 1994»
14 years 10 months ago
Static Dependent Costs for Estimating Execution Time
We present the rst system for estimating and using datadependent expression execution times in a language with rst-class procedures and imperative constructs. The presence of rst-...
Brian Reistad, David K. Gifford
81
Voted
ACTA
2010
87views more  ACTA 2010»
14 years 9 months ago
On the observational theory of the CPS-calculus
We study the observational theory of Thielecke's CPS-calculus, a distillation of the target language of Continuation-Passing Style transforms. We define a labelled transition...
Massimo Merro