A lower complexity bound for propositional dynamic logic with intersection (Q5483005)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5046359
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower complexity bound for propositional dynamic logic with intersection |
scientific article; zbMATH DE number 5046359 |
Statements
15 August 2006
0 references
satisfiability
0 references
0.8474478125572205
0 references
0.8116089105606079
0 references
0.7744647860527039
0 references
0.7681615948677063
0 references
0.7526236176490784
0 references
