2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.AI2014
Tree-like Queries in OWL 2 QL: Succinctness and Complexity Results
Meghyn Bienvenu, Stanislav Kikot, Vladimir Podolskii
This paper investigates the impact of query topology on the difficulty of answering conjunctive queries in the presence of OWL 2 QL ontologies. Our first contribution is to clarify…
cs.DM2012
Patience of Matrix Games
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii +1
For matrix games we study how small nonzero probability must be used in optimal strategies. We show that for nxn win-lose-draw games (i.e. (-1,0,1) matrix games) nonzero probabilit…
cs.CC2012★ 2 cited
Complexity of tropical and min-plus linear prevarieties
Dima Grigoriev, Vladimir V. Podolskii
A tropical (or min-plus) semiring is a set (or ) endowed with two operations: , which is just usual minimum, and , which is…