Cover Image

Introducing The Maximum Common Bigraph Problem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Burns, Kyle, Sevegnani, Michele, McCreesh, Ciaran, Trimble, James
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science Multiagent Systems F.2.2; F.4.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

I Would If I Could: Reasoning about Dynamics of Actions in Multi-Agent Systems
by: Galimullin, Rustam, et al.
Published: (2026)

Comparing State-Representations for DEL Model Checking
by: Behnke, Gregor, et al.
Published: (2025)

Changing the Rules of the Game: Reasoning about Dynamic Phenomena in Multi-Agent Systems
by: Galimullin, Rustam, et al.
Published: (2025)

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

A Note on the Complexity of the Satisfiability Problem for Graded Modal Logics
by: Kazakov, Yevgeny, et al.
Published: (2009)

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

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

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

Deducibility in the full Lambek calculus with weakening is HAck-complete
by: Greati, Vitor, et al.
Published: (2024)

Hypersequent Calculi Have Ackermannian Complexity
by: Balasubramanian, A. R., et al.
Published: (2026)

When do homomorphism counts help in query algorithms?
by: Cate, Balder ten, et al.
Published: (2023)

Complexity Results in Team Semantics: Nonemptiness Is Not So Complex
by: Anttila, Aleksi, et al.
Published: (2025)

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

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Pramana: A Protocol-Layer Treatment of Claim Verification in Autonomous Agent Networks
by: Kadaboina, Ravi Kiran
Published: (2026)

Locality in Residuated-Lattice Structures
by: Carr, James
Published: (2025)

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

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

A Complete Finitary Refinement Type System for Scott-Open Properties
by: Riba, Colin, et al.
Published: (2026)

Interpreting De Finetti's theorem in the Category of Integrable Cones (long version)
by: Raphaëlle, Crubillé
Published: (2026)

One Energy Game for the Spectrum between Branching Bisimilarity and Weak Trace Semantics
by: Bisping, Benjamin, et al.
Published: (2024)

A Fibrational Perspective on Differential Linear Logic
by: Koleilat, Jad
Published: (2026)

On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
by: Lago, Ugo Dal, et al.
Published: (2026)

Relational Dualities and Bisimulation
by: Kozicki, Piotr, et al.
Published: (2026)

Modelling Real-time Systems with Bigraphs
by: Albalwe, Maram, et al.
Published: (2025)

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

Polynomial-time Tractable Problems over the $p$-adic Numbers
by: Fehm, Arno, et al.
Published: (2025)

A Complexity Dichotomy for Temporal Valued Constraint Satisfaction Problems
by: Bodirsky, Manuel, et al.
Published: (2024)

A Proof-Theoretic Approach to the Semantics of Classical Linear Logic
by: Barroso-Nascimento, Victor, et al.
Published: (2025)

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

Notes on CSPs and Polymorphisms
by: Brady, Zarathustra
Published: (2022)

The Lambda Calculus is Quantifiable
by: Maestracci, Valentin, et al.
Published: (2024)

Infinitary Refinement Types for Temporal Properties in Scott Domains
by: Riba, Colin, et al.
Published: (2025)

Two-Level Type Theory and Applications
by: Annenkov, Danil, et al.
Published: (2017)

Abstract clones for abstract syntax
by: Arkor, Nathanael, et al.
Published: (2021)

Automating the Derivation of Unification Algorithms: A Case Study in Deductive Program Synthesis
by: Waldinger, Richard
Published: (2025)

Refactoring-as-Propositions: Proved Refactoring of Hybrid Systems via Proved Refinements
by: Prebet, Enguerrand, et al.
Published: (2026)

Uniform Substitution for Differential Refinement Logic
by: Prebet, Enguerrand, et al.
Published: (2024)

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