2273 search results - page 86 / 455 » On the Expressiveness and Complexity of ATL |
CC
2007
Springer
14 years 10 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
105
click to vote
RC
2002
14 years 9 months ago
2002
An exact parameterization for the boundary of the Minkowski product of N circular disks in the complex plane is derived. When N > 2, this boundary curve may be regarded as a gen...
156
click to vote
FSTTCS
2010
Springer
14 years 7 months ago
2010
Springer
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
SSDBM
2007
IEEE
15 years 4 months ago
2007
IEEE
High energy physics scientists analyze large amounts of data looking for interesting events when particles collide. These analyses are easily expressed using complex queries that ...