The first order definability of graphs with separators via the Ehrenfeucht game
Theoretical Computer Science - Game theory meets theoretical computer science
The first order definability of graphs: upper bounds for quantifier depth
Discrete Applied Mathematics
On Complexity of Ehrenfeucht-Fraïssé Games
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Games on Strings with a Limited Order Relation
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
An algorithmic account of ehrenfeucht games on labeled successor structures
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Hi-index | 0.00 |