activity
20082020
most citedQuerying the Guarded Fragment

76 citations · 82 across the 4 of their papers we have counts for

collaborators

6 papers

cs.LO2020

Some Model Theory of Guarded Negation

Vince Barany, Michael Benedikt, Balder ten Cate

The Guarded Negation Fragment (GNFO) is a fragment of first-order logic that contains all positive existential formulas, can express the first-order translations of basic modal log…

cs.DB2015

Declarative Statistical Modeling with Datalog

Vince Barany, Balder ten Cate, Benny Kimelfeld +2

Formalisms for specifying statistical models, such as probabilistic-programming languages, typically consist of two components: a specification of a stochastic process (the prior),…

cs.LO2013★ 76 cited

Querying the Guarded Fragment

Vince Bárány, Georg Gottlob, Martin Otto

Evaluating a Boolean conjunctive query Q against a guarded first-order theory F is equivalent to checking whether "F and not Q" is unsatisfiable. This problem is relevant to the ar…

cs.DB2012★ 6 cited

Queries with Guarded Negation (full version)

Vince Barany, Balder ten Cate, Martin Otto

A well-established and fundamental insight in database theory is that negation (also known as complementation) tends to make queries difficult to process and difficult to reason ab…

cs.LO2011

Finite Satisfiability for Guarded Fixpoint Logic

Vince Bárány, Mikołaj Bojańczyk

The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).

cs.LO2008

Cardinality and counting quantifiers on omega-automatic structures

Lukasz Kaiser, Sasha Rubin, Vince Bárány

We investigate structures that can be represented by omega-automata, so called omega-automatic structures, and prove that relations defined over such structures in first-order logi…