90 search results - page 14 / 18 » On the Decidability of the Equivalence Problem for Monadic R... |
130
Voted
ALENEX
2009
15 years 6 months ago
2009
We experimentally compare the two algorithms A and B by Fredman and Khachiyan [FK96] for the problem Monet--given two monotone Boolean formulas in DNF and in CNF, decide whether ...
249
click to vote
POPL
2006
ACM
16 years 5 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
218
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
We study the problem of querying data sources that accept only a limited set of queries, such as sources accessible by Web services which can implement very large (potentially inf...
158
click to vote
VMCAI
2009
Springer
15 years 11 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
243
click to vote
AOSD
2010
ACM
15 years 12 months ago
2010
ACM
Advice is a mechanism, widely used in aspect-oriented languages, that allows one program component to augment or modify the behavior of other components. When advice and other com...