4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.LO2014
Quantified Conjunctive Queries on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
We study the computational problem of checking whether a quantified conjunctive query (a first-order sentence built using only conjunction as Boolean connective) is true in a finit…
cs.LO2014★ 1 cited
Model Checking Existential Logic on Partially Ordered Sets
Simone Bova, Robert Ganian, Stefan Szeider
We study the problem of checking whether an existential sentence (that is, a first-order sentence in prefix form built using existential quantifiers and all Boolean connectives) is…
cs.DM2010★ 4 cited
Better algorithms for satisfiability problems for formulas of bounded rank-width
Robert Ganian, Petr Hliněný, Jan Obdržálek
We provide a parameterized polynomial algorithm for the propositional model counting problem #SAT, the runtime of which is single-exponential in the rank-width of a formula. Previo…