300 search results - page 41 / 60 » An extension of the Cayley-Sylvester formula |
136
click to vote
CSCLP
2008
Springer
14 years 11 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
63
Voted
CORR
2007
Springer
14 years 9 months ago
2007
Springer
We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), ex...
CONCUR
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checki...
ICGI
1998
Springer
15 years 2 months ago
1998
Springer
In this paper, we propose a new framework for the computational learning of formal grammars with positive data. In this model, both syntactic and semantic information are taken int...
ICTL
1994
15 years 1 months ago
1994
In this paper we present a survey of work relating to the Concurrent METATEM programming language. In addition to a description of the basic Concurrent METATEM system, which incorp...