:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Scheidt, Benjamin
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2404.10637
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An Algorithmic Meta Theorem for Homomorphism Indistinguishability
by: Seppelt, Tim
Published: (2024)

Logical Equivalences, Homomorphism Indistinguishability, and Forbidden Minors
by: Seppelt, Tim
Published: (2023)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
by: Černý, Marek, et al.
Published: (2025)

Using Color Refinement to Boost Enumeration and Counting for Acyclic CQs of Binary Schemas
by: Riveros, Cristian, et al.
Published: (2024)

Structural Indexing of Relational Databases for the Evaluation of Free-Connex Acyclic Conjunctive Queries
by: Riveros, Cristian, et al.
Published: (2026)

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

Color Refinement for Relational Structures
by: Scheidt, Benjamin, et al.
Published: (2024)

A Representation of Explicit Knowledge and Epistemic Indistinguishability in a Logic of Awareness
by: Kubono, Yudai, et al.
Published: (2025)

Bridging Computational Notions of Depth
by: Bienvenu, Laurent, et al.
Published: (2024)

Adaptive Query Algorithms for Relational Structures Based on Homomorphism Counts
by: Cate, Balder ten, et al.
Published: (2025)

Graph Homomorphism, Monotone Classes and Bounded Pathwidth
by: Eagling-Vose, Tala, et al.
Published: (2024)

CHAD: Combinatory Homomorphic Automatic Differentiation
by: Vákár, Matthijs, et al.
Published: (2021)

Distinguishing Graphs by Counting Homomorphisms from Sparse Graphs
by: Neuen, Daniel, et al.
Published: (2026)

Shininess, strong politeness, and unicorns
by: Przybocki, Benjamin, et al.
Published: (2025)

Characterizing Sets of Theories That Can Be Disjointly Combined
by: Przybocki, Benjamin, et al.
Published: (2025)

Bringing closure to theory combination properties
by: Toledo, Guilherme V., et al.
Published: (2026)

Being polite is not enough (and other limits of theory combination)
by: Toledo, Guilherme V., et al.
Published: (2025)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

The nonexistence of unicorns and many-sorted Löwenheim-Skolem theorems
by: Przybocki, Benjamin, et al.
Published: (2024)

Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)

From Quantifier Depth to Quantifier Number: Separating Structures with k Variables
by: Vinall-Smeeth, Harry
Published: (2023)

Homomorphic Encryption of Intuitionistic Logic Proofs and Functional Programs: A Categorical Approach Inspired by Composite-Order Bilinear Groups
by: Goertzel, Ben
Published: (2025)

Lower Bounds in Algebraic Complexity via Symmetry and Homomorphism Polynomials
by: Dwivedi, Prateek, et al.
Published: (2026)

Expressive Power of Deep Homomorphism Networks over Relational Databases
by: Schönherr, Moritz, et al.
Published: (2026)

A Dynamic Logic for Information Evaluation in Intelligence
by: Icard, Benjamin
Published: (2024)

Sequent Calculi for Data-Aware Modal Logics
by: Areces, Carlos, et al.
Published: (2025)

Beyond the Spell: A Dynamic Logic Analysis of Misdirection
by: Icard, Benjamin, et al.
Published: (2024)

A framework for computing upper bounds in passive learning settings
by: Bordais, Benjamin, et al.
Published: (2025)

Traces via Strategies in Two-Player Games
by: Plummer, Benjamin, et al.
Published: (2025)

Delay-Optimum Adder Circuits with Linear Size
by: Brenner, Ulrich, et al.
Published: (2024)

Programming and Reasoning in Partially Observable Probabilistic Environments
by: Gürtler, Tobias, et al.
Published: (2025)

Multi-Environment MDPs with Prior and Universal Semantics
by: Bordais, Benjamin, et al.
Published: (2026)

noDice: Inference for Discrete Probabilistic Programs with Nondeterminism and Conditioning
by: Gürtler, Tobias, et al.
Published: (2026)

Learning Branching-Time Properties in CTL and ATL via Constraint Solving
by: Bordais, Benjamin, et al.
Published: (2024)

The Complexity of Learning Temporal Properties
by: Bordais, Benjamin, et al.
Published: (2024)

Distributed Transition System with Tags and Value-wise Metric, for Privacy Analysis
by: Anantharaman, Siva, et al.
Published: (2025)

Reasoning about Quality in Hyperproperties
by: Graepler, Samuel, et al.
Published: (2025)

Demystifying $μ$
by: Afshari, Bahareh, et al.
Published: (2024)

Cut elimination for Cyclic Proofs: A Case Study in Temporal Logic
by: Afshari, Bahareh, et al.
Published: (2024)