Homomorphism preservation theorems
From MaRDI portal
Recommendations
Cited in
(60)- In praise of homomorphisms
- Arboreal categories and equi-resource homomorphism preservation theorems
- Arboreal Categories: An Axiomatic Theory of Resources
- Action of endomorphism semigroups on definable sets
- Graph partitions with prescribed patterns
- Compact query rewritings for ontology-based query answering
- On the descriptive complexity of temporal constraint satisfaction problems
- On nowhere dense graphs
- A Tutorial on Query Answering and Reasoning over Probabilistic Knowledge Bases
- The price of query rewriting in ontology-based data access
- A polynomial excluded-minor approximation of treedepth
- An algebraic preservation theorem for \(\aleph_0\)-categorical quantified constraint satisfaction
- On Datalog vs. LFP
- On preservation under homomorphisms and unions of conjunctive queries
- Explanations for query answers under existential rules
- scientific article; zbMATH DE number 2015640 (Why is no real title available?)
- Preservation theorems on sparse classes revisited
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem
- Rewritability in monadic disjunctive Datalog, MMSNP, and expressive description logics
- Homomorphism preservation on quasi-wide classes
- An algebraic preservation theorem for aleph-zero categorical quantified constraint satisfaction
- Harmonious logic: Craig's interpolation theorem and its descendants
- SOME MODEL THEORY OF GUARDED NEGATION
- Positive First-order Logic on Words and Graphs
- Relativised homomorphism preservation at the finite level
- Constraint satisfaction, graph isomorphism, and the pebbling comonad
- Symmetric linear arc monadic Datalog and gadget reductions
- Linear arboreal categories
- A tetrachotomy of ontology-mediated queries with a covering axiom
- Preservation theorems through the Lens of topology
- Extension preservation in the finite and prefix classes of first-order logic
- On counting (quantum-)graph homomorphisms in finite fields of prime order
- Arboreal categories and resources
- Structure and Power: an Emerging Landscape
- From Hilbert's program to a logic tool box
- On low tree-depth decompositions
- Schema mappings: a case of logical dynamics in database theory
- A monotone preservation result for Boolean queries expressed as a containment of conjunctive queries
- Promise and infinite-domain constraint satisfaction
- Preservation theorems for Tarski's relation algebra
- On the complexity of existential positive queries
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
- Preservation by homomorphisms and infinitary languages
- Counting homomorphisms to sparse graphs
- Conjunctive query pattern structures: a relational database model for formal concept analysis
- Guarded Ontology-Mediated Queries
- Whither semantics?
- When locality meets preservation
- A generalization of the Łoś-Tarski preservation theorem
- Certain answers as objects and knowledge
- Constraint satisfaction, irredundant axiomatisability and continuous colouring
- scientific article; zbMATH DE number 6866317 (Why is no real title available?)
- A logic-based framework for characterizing nexus of similarity within knowledge bases
- Quasi-equational bases for graphs of semigroups, monoids and groups.
- When do homomorphism counts help in query algorithms?
- Tree-Depth and the Formula Complexity of Subgraph Isomorphism
- Extension preservation theorems on classes of acyclic finite structures
- Obstructions to partitions of chordal graphs
- A preservation theorem for ec-structures with applications
- Forbidden induced subgraphs and the Łoś-Tarski theorem
This page was built for publication: Homomorphism preservation theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546368)
