Biblio Discovery — Demo Discovery Service

11 results for "Martin Grohe"

Showing 1–11 · 0.48 seconds · RSS

  1. Journal Article

    The Descriptive Complexity of Graph Neural Networks

    Martin Grohe

    TheoretiCS, Vol. Volume 3 · 2024 · English · DOAJ Scopus

    We analyse the power of graph neural networks (GNNs) in terms of Boolean circuit complexity and descriptive complexity. We prove that the graph queries that can be computed by a polynomial-size bounded-depth family of GNNs are exactly those definable in the guarded fragment GFO+C of first-order…

  2. Journal Article

    The Complexity of Datalog on Linear Orders

    Martin Grohe; Goetz Schwandtner

    Logical Methods in Computer Science, Vol. Volume 5 No. ue 1 · 2009 · English · DOAJ Scopus

    We study the program complexity of datalog on both finite and infinite linear orders. Our main result states that on all linear orders with at least two elements, the nonemptiness problem for datalog is EXPTIME-complete. While containment of the nonemptiness problem in EXPTIME is known for finite…

  3. Journal Article

    Model-Checking Problems as a Basis for Parameterized Intractability

    Joerg Flum; Martin Grohe

    Logical Methods in Computer Science, Vol. Volume 1 No. ue 1 · 2005 · English · DOAJ Scopus

    Most parameterized complexity classes are defined in terms of a parameterized version of the Boolean satisfiability problem (the so-called weighted satisfiability problem). For example, Downey and Fellow's W-hierarchy is of this form. But there are also classes, for example, the A-hierarchy, that…

  4. Journal Article

    The succinctness of first-order logic on linear orders

    Martin Grohe; Nicole Schweikardt

    Logical Methods in Computer Science, Vol. Volume 1 No. ue 1 · 2005 · English · DOAJ Scopus

    Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the same size, but some properties can be…

  5. Journal Article

    Infinite Probabilistic Databases

    Martin Grohe; Peter Lindner

    Logical Methods in Computer Science, Vol. Volume 18 No. ue 1 · 2022 · English · DOAJ Scopus

    …(Dalvi et al., CACM 2009). We formally introduced infinite PDBs in (Grohe and Lindner, PODS 2019) with a primary focus on countably infinite spaces. However, an extension beyond countable probability spaces raises nontrivial foundational issues concerned with the measurability of events and queries…

  6. Journal Article

    Randomisation and Derandomisation in Descriptive Complexity Theory

    Kord Eickmeyer; Martin Grohe

    Logical Methods in Computer Science, Vol. Volume 7 No. ue 3 · 2011 · English · DOAJ Scopus

    We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic L, which is defined from L in a similar way as the complexity class BPP, bounded error probabilistic polynomial time…

  7. Journal Article

    Hypertree-Width and Related Hypergraph Invariants

    Isolde Adler; Georg Gottlob; Martin Grohe

    Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE… · 2005 · English · DOAJ Scopus

    We study the notion of hypertree-width of hypergraphs. We prove that, up to a constant factor, hypertree-width is the same as a number of other hypergraph invariants that resemble graph invariants such as bramble-number, branch-width, linkedness, and the minimum number of cops required to win…

  8. Journal Article

    Definable decompositions for graphs of bounded linear cliquewidth

    Mikołaj Bojańczyk; Martin Grohe; Michał Pilipczuk

    Logical Methods in Computer Science, Vol. Volume 17 No. ue 1 · 2021 · English · DOAJ Scopus

    We prove that for every positive integer k, there exists an MSO_1-transduction that given a graph of linear cliquewidth at most k outputs, nondeterministically, some cliquewidth decomposition of the graph of width bounded by a function of k. A direct corollary of this result is the equivalence of…

  9. Journal Article

    Graph Neural Networks for Maximum Constraint Satisfaction

    Jan Tönshoff; Martin Ritzert; Hinrikus Wolf et al.

    Frontiers in Artificial Intelligence, Vol. 3 · 2021 · English · DOAJ Scopus

    Many combinatorial optimization problems can be phrased in the language of constraint satisfaction problems. We introduce a graph neural network architecture for solving such optimization problems. The architecture is generic; it works for all binary constraint satisfaction problems. Training is…

  10. Journal Article

    L-Recursion and a new Logic for Logarithmic Space

    Martin Grohe; Berit Grußien; André Hernich et al.

    Logical Methods in Computer Science, Vol. Volume 9 No. ue 1 · 2013 · English · DOAJ Scopus

    We extend first-order logic with counting by a new operator that allows it to formalise a limited form of recursion which can be evaluated in logarithmic space. The resulting logic LREC has a data complexity in LOGSPACE, and it defines LOGSPACE-complete problems like deterministic reachability and…

  11. Journal Article

    A Finite-Model-Theoretic View on Propositional Proof Complexity

    Erich Grädel; Martin Grohe; Benedikt Pago et al.

    Logical Methods in Computer Science, Vol. Volume 15 No. ue 1 · 2022 · English · DOAJ Scopus

    We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the monomial calculus of bounded degree, can be…