Querying the Guarded Fragment

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

Publikováno v: Logical Methods in Computer Science, Vol Volume 10, Issue 2 (2014)

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 areas of database theory and description logic. Since Q may not be guard

Externí odkaz: https://doaj.org/article/dd387192917446c8a9a75671f92b4464

Declarative probabilistic programming with datalog

Autor: Vince Bárány, Zografoula Vagena, Dan Olteanu, Balder ten Cate, Benny Kimelfeld

Probabilistic programming languages are used for developing statistical models. They typically consist of two components: a specification of a stochastic process (the prior), and a specification of observations that restrict the probability space to

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a21eeb8f06ad7d3eb5faca4254d68baf
https://ora.ox.ac.uk/objects/uuid:2fe5f470-d6d1-402c-aa56-d4d172b7bce5

Expressing Cardinality Quantifiers in Monadic Second-Order Logic over Trees

Autor: Alexander Rabinovich, Łukasz Kaiser, Vince Bárány

Publikováno v: Fundamenta Informaticae. 100:1-17

We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of finitely branching trees, this extension is equally expressive to plain monadic seco

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bd9f0b87fb8c2fe0de3a4d7762f36c4a
https://doi.org/10.3233/fi-2010-260

Access patterns and integrity constraints revisited

Autor: Michael Benedikt, Vince Bárány, Pierre Bourhis

Publikováno v: ICDT

We consider which queries are answerable in the presence of access restrictions and integrity constraints, and which portions of the schema are accessible in the presence of access restrictions and constraints. Unlike prior work, we focus on integrit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c275cd44b7f0320041b25581a749c20a
https://doi.org/10.1145/2448496.2448522

Decidable classes of documents for XPath

Autor: Vince Bárány, Mikołaj Bojańczyk, Diego Figueira, Paweł Parys

Publikováno v: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2012, Hyderabad, India. 18, pp.99-111
IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2012, Hyderabad, India. pp.99-111
HAL

International audience; We study the satisfiability problem for XPath over XML documents of bounded depth. We define two parameters, called match width and braid width, that assign a number to any class of documents. We show that for all k, satisfiab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50b4dfa4713e5a5c5919e7b45a5cafd4
https://hal.archives-ouvertes.fr/hal-01799733/document