Sciweavers

455 search results - page 24 / 91
» The Linear Logical Abstract Machine
Sort
View
FORMATS
2009
Springer
15 years 6 months ago
Realizability of Real-Time Logics
Abstract. We study the realizability problem for specifications of reactive systems expressed in real-time linear temporal logics. The logics we consider are subsets of MITL (Metr...
Laurent Doyen, Gilles Geeraerts, Jean-Franç...
CADE
2012
Springer
13 years 2 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
CSCLP
2007
Springer
15 years 6 months ago
Quasi-Linear-Time Algorithms by Generalisation of Union-Find in CHR
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
Thom W. Frühwirth
TCS
2002
14 years 11 months ago
The continuum as a final coalgebra
oole.stanford.edu/pub/ABSTRACTS Pratt, V.R., "Transition and Cancellation in Concurrency and Branching Time", Math. Structures in Comp. Sci., 13:4, 485-529, August 2003. ...
Dusko Pavlovic, Vaughan R. Pratt
ECML
2006
Springer
15 years 3 months ago
TildeCRF: Conditional Random Fields for Logical Sequences
Abstract. Conditional Random Fields (CRFs) provide a powerful instrument for labeling sequences. So far, however, CRFs have only been considered for labeling sequences over flat al...
Bernd Gutmann, Kristian Kersting