Sciweavers

3 search results - page 1 / 1
» dimacs 1996
Sort
View
DIMACS
1996
14 years 5 days ago
On the Expression of Graph Properties in some Fragments of Monadic Second-Order Logic
: We review the expressibility of some basic graph properties in certain fragments of Monadic Second-Order logic, like the set of Monadic-NP formulas. We focus on cases where a pro...
Bruno Courcelle
DIMACS
1996
14 years 5 days ago
Model Checking and the Mu-calculus
There is a growing recognition of the need to apply formal mathematical methods in the design of \high con dence" computing systems. Such systems operate in safety critical co...
E. Allen Emerson
DIMACS
1996
14 years 5 days ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin