Searching for "A Lower Complexity Bound for Propositional Dynamic Logic with Intersection." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A lower complexity bound for propositional dynamic logic with intersection
by Martin Lange — 1982 — Automata, Languages and Programming, 9th Colloquium
…A Lower Complexity Bound for Propositional Dynamic Logic with Intersection Martin Lange Institut…
Cited by 1 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB