scientific article; zbMATH DE number 3819693
From MaRDI portal
Publication:3666827
Cited in
(89)- Infinitary logics and 0-1 laws
- Computing with graph rewriting systems with priorities
- On winning strategies in Ehrenfeucht-Fraïssé games
- Verifiable properties of database transactions
- The monadic second order logic of graphs. VI: On several representations of graphs by relational structures
- Reachability and the power of local ordering
- Query languages for bags and aggregate functions
- Finitely representable databases
- Queries with arithmetical constraints
- Analysis and application of adaptive sampling
- Expressive power of SQL.
- Incremental recomputation in local languages.
- On the power of tree-walking automata.
- Local properties of query languages
- Conjunctive-query containment and constraint satisfaction
- Compositional entailment checking for a fragment of separation logic
- Expressive power of entity-linking frameworks
- Logical limit laws for minor-closed classes of graphs
- Expressive power of existential first-order sentences of Büchi's sequential calculus
- A technique for proving decidability of containment and equivalence of linear constraint queries
- Logic, semigroups and automata on words
- Lower bounds for invariant queries in logics with counting.
- Towards a language theory for infinite N-free pomsets.
- Shrinking games and local formulas
- Describing parameterized complexity classes
- Modal and guarded characterisation theorems over finite transition systems
- An existential locality theorem
- Generalized quantifiers and pebble games on finite structures
- Decision problems in a logic for reasoning about reconfigurable distributed systems
- Constructing decidable graphs from decidable structures
- Modeling limits in hereditary classes: reduction and application to trees
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- A logical approach to locality in pictures languages
- Language games
- Probabilities of First-Order Sentences about Unary Functions
- Efficient First-Order Model-Checking Using Short Labels
- Solutions and query rewriting in data exchange
- Model-checking hierarchical structures
- Locality and modular Ehrenfeucht-Fraïssé games
- An optimal construction of Hanf sentences
- Practical algorithms for MSO model-checking on tree-decomposable graphs
- Convergence in homogeneous random graphs
- Gaifman normal forms for counting extensions of first-order logic
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract)
- Additive first-order queries
- Enumerating answers to first-order queries over databases of low degree
- Iterating on multiple collections in synchrony
- A unified approach to structural limits and limits of graphs with bounded tree-depth
- Infinitary logic for computer science
- Existence of modeling limits for sequences of sparse structures
- Conversation and games
- Parametrised complexity of satisfiability in temporal logic
- First-Order Model-Checking in Random Graphs and Complex Networks
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Enumeration for FO Queries over Nowhere Dense Graphs
- First-order Logic with Connectivity Operators
- On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic
- Lacon-, Shrub- and Parity-Decompositions: Characterizing Transductions of Bounded Expansion Classes
- Non-parametric learning of embeddings for relational data using Gaifman locality theorem
- On the existential fragments of local first-order logics with data
- On testability of first-order properties in bounded-degree graphs and connections to proximity-oblivious testing
- When locality meets preservation
- Model checking on interpretations of classes of bounded local cliquewidth
- Monadic partition logics and finite automata
- On the expressive power of counting
- Learning concepts described by weight aggregation logic
- Guarded hybrid team logics
- On classes of bounded tree rank, their interpretations, and efficient sparsification
- Characterizations of two basic hybrid logics
- Learning concepts definable in first-order logic with counting
- Finite automata for efficient graph recognition
- Inherent complexity of recursive queries
- A characterisation theorem for two-way bisimulation-invariant monadic least fixpoint logic over finite structures
- Elementary first-order model checking for sparse graphs
- Gadget construction and structural convergence
- An algorithmic meta-theorem for graph modification to planarity and FOL
- Compound logics for modification problems
- Logical aspects of Cayley-graphs: the group case
- An intensional expressiveness gap of comprehension syntax
- Learning aggregate queries defined by first-order logic with counting
- The parameterized complexity of k-edge induced subgraphs
- Modal characterisation theorems over special classes of frames
- Locality in residuated-lattice structures
- On the expressive power of inquisitive epistemic logic
- Categoricity over P for first order T or categoricity for \(\phi\) \(\in {\mathcal L}_{\omega_ 1\omega}\) can stop at \(\aleph_ k\) while holding for \(\aleph_ 0,\dots ,\aleph_{k-1}\)
- On the complexity of reasoning about opinion diffusion under majority dynamics
- Computational complexity of logical theories of one successor and another unary function
- First-order limits, an analytical perspective
- First-order spectra with one variable
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3666827)
