Imagen de Portada

When do homomorphism counts help in query algorithms?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cate, Balder ten, Dalmau, Víctor, Kolaitis, Phokion G., Wu, Wei-Lin
Formato:	Preprint
Publicado:	2023
Materias:	Logic in Computer Science F.4.1; G.2.2; I.1.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the Power and Limitations of Examples for Description Logic Concepts
por: Cate, Balder ten, et al.
Publicado: (2024)

How Expressive Are Graph Neural Networks in the Presence of Node Identifiers?
por: Soeteman, Arie, et al.
Publicado: (2026)

Constant time testability of first-order logic with modulo counting on finitary graphs
por: Adler, Isolde, et al.
Publicado: (2026)

Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs
por: de Rezende, Susanna F., et al.
Publicado: (2019)

Unravelling Abstract Cyclic Proofs into Proofs by Induction
por: Grotenhuis, Lide, et al.
Publicado: (2026)

$γ(3,4)$ `Attention' in Cognitive Agents: Ontology-Free Knowledge Representations With Promise Theoretic Semantics
por: Burgess, Mark
Publicado: (2025)

A Coq-based Axiomatization of Tarski's Mereogeometry
por: Barlatier, Patrick, et al.
Publicado: (2025)

From Compactifying Lambda-Letrec Terms to Recognizing Regular-Expression Processes
por: Grabmayer, Clemens
Publicado: (2024)

FastLEC: Parallel Datapath Equivalence Checking with Hybrid Engines
por: Zhang, Xindi, et al.
Publicado: (2025)

A Resolution-Based Interactive Proof System for UNSAT
por: Czerner, Philipp, et al.
Publicado: (2024)

Dynamic Boolean Synthesis with Zero-suppressed Decision Diagrams
por: Lin, Yi, et al.
Publicado: (2025)

Formally Verifying the Safety of Pipelined Moonshot Consensus Protocol
por: Praveen, M., et al.
Publicado: (2024)

Locality in Residuated-Lattice Structures
por: Carr, James
Publicado: (2025)

Degree-preserving Godel logics with an involution: intermediate logics and (ideal) paraconsistency
por: Coniglio, M. E., et al.
Publicado: (2026)

Three Fixed-Dimension Satisfiability Semantics for Quantum Logic: Implications and an Explicit Separator
por: Higuchi, Joaquim Reizi
Publicado: (2026)

On The Role of Intentionality in Knowledge Representation: Analyzing Scene Context for Cognitive Agents with a Tiny Language Model
por: Burgess, Mark
Publicado: (2025)

A Sequent Calculus for General Inductive Definitions
por: Eede, Robbe Van den, et al.
Publicado: (2026)

Modal Logics -- RNmatrices vs. Nmatrices
por: Coniglio, Marcelo E., et al.
Publicado: (2024)

Robust Computation Tree Logic
por: Nayak, Satya Prakash, et al.
Publicado: (2022)

On Angels and Demons: Strategic (De)Construction of Dynamic Models
por: Catta, Davide, et al.
Publicado: (2026)

Introducing The Maximum Common Bigraph Problem
por: Burns, Kyle, et al.
Publicado: (2026)

Converting BPMN Diagrams to Privacy Calculus
por: Pitsiladis, Georgios V., et al.
Publicado: (2024)

On the Satisfaction Probabilities of $k$-CNF Formulas
por: Tantau, Till
Publicado: (2022)

Homomorphism Indistinguishability and Game Comonads for Restricted Conjunction and Requantification
por: Schindling, Georg
Publicado: (2025)

Neural networks as fuzzy logic formulas
por: Heiman, Damian, et al.
Publicado: (2026)

Who Wins the Multi-Structural Game?
por: Fagin, Ronald, et al.
Publicado: (2025)

The Fluted Fragment with Transitive Relations
por: Pratt-Hartmann, Ian, et al.
Publicado: (2020)

Mechanized HOL Reasoning in Set Theory
por: Guilloud, Simon, et al.
Publicado: (2024)

Incomplete Descriptions and Qualified Definiteness
por: Więckowski, Bartosz
Publicado: (2024)

Term Orders for Optimistic Lambda-Superposition
por: Bentkamp, Alexander, et al.
Publicado: (2025)

Metric Equational Theories
por: Mardare, Radu, et al.
Publicado: (2025)

Canonical for Automated Theorem Proving in Lean
por: Norman, Chase, et al.
Publicado: (2025)

Implementing Dependent Type Theory Inhabitation and Unification
por: Norman, Chase, et al.
Publicado: (2026)

Agent Semantics, Semantic Spacetime, and Graphical Reasoning
por: Burgess, Mark
Publicado: (2025)

Graph Colouring Is Hard on Average for Polynomial Calculus and Nullstellensatz
por: Conneryd, Jonas, et al.
Publicado: (2025)

On bounded depth proofs for Tseitin formulas on the grid; revisited
por: Håstad, Johan, et al.
Publicado: (2022)

Superpolynomial Length Lower Bounds for Tree-Like Semantic Proof Systems with Bounded Line Size
por: de Rezende, Susanna F., et al.
Publicado: (2026)

Clique Is Hard on Average for Sherali-Adams with Bounded Coefficients
por: de Rezende, Susanna F., et al.
Publicado: (2024)

Supercritical Tradeoffs for Monotone Circuits
por: Göös, Mika, et al.
Publicado: (2024)

Probabilistic Shoenfield Machines
por: Bujok, Maksymilian, et al.
Publicado: (2024)