Cover Image

Bridging Weighted First Order Model Counting and Graph Polynomials

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kuang, Qipeng, Kuželka, Ondřej, Wang, Yuanhong, Wang, Yuyi
Format:	Preprint
Published:	2024
Subjects:	Logic in Computer Science Artificial Intelligence 03C13, 68T27, 05A15 (Primary) F.4.0
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Tractable Weighted First-Order Model Counting with Bounded Treewidth Binary Evidence
by: Kůla, Václav, et al.
Published: (2025)

Weighted First Order Model Counting for Two-variable Logic with Axioms on Two Relations
by: Kuang, Qipeng, et al.
Published: (2025)

A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
by: Sun, Shixin, et al.
Published: (2026)

Solving Combinatorial Counting Problems with Weighted First-Order Model Counting
by: Wang, Yuanhong, et al.
Published: (2026)

Lifted Algorithms for Symmetric Weighted First-Order Model Sampling
by: Wang, Yuanhong, et al.
Published: (2023)

The Solver's Paradox in Formal Problem Spaces
by: Rosko, Milan
Published: (2025)

Different Theories of Parts
by: Pietruszczak, Andrzej
Published: (2024)

Higher-Order Pattern Unification Modulo Similarity Relations
by: Dundua, Besik, et al.
Published: (2025)

Algebraic Proof Theory for Infinitary Action Logic
by: Fussner, Wesley, et al.
Published: (2025)

A proof complexity conjecture and the Incompleteness theorem
by: Krajicek, Jan
Published: (2023)

Quantitative Linear Logic
by: Capucci, Matteo, et al.
Published: (2026)

Why the classes P and NP are not well-defined finitarily
by: Anand, Bhupinder Singh
Published: (2024)

The Fractal Logic of Phi-adic Recursion
by: Rosko, Milan
Published: (2025)

Description Complexity of Unary Structures in First-Order Logic with Links to Entropy
by: Jaakkola, Reijo, et al.
Published: (2024)

Finitary Simulation of Infinitary $β$-Reduction via Taylor Expansion, and Applications
by: Cerda, Rémy, et al.
Published: (2022)

Normalization properties of $λμ$-calculus using realizability semantics
by: Battyanyi, Peter, et al.
Published: (2023)

A Bisimulation-Invariance-Based Approach to the Separation of Polynomial Complexity Classes
by: Bruse, Florian, et al.
Published: (2026)

Simply-typed constant-domain modal lambda calculus I: distanced beta reduction and combinatory logic
by: Walsh, Sean
Published: (2024)

On the relative asymptotic expressivity of inference frameworks
by: Koponen, Vera, et al.
Published: (2022)

Measurability in the Fundamental Theorem of Statistical Learning
by: Krapp, Lothar Sebastian, et al.
Published: (2024)

Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics
by: Japaridze, Giorgi
Published: (2026)

Exploring P versus NP
by: Tang, Jian-Gang
Published: (2022)

A propositional cirquent calculus for computability logic
by: Japaridze, Giorgi
Published: (2024)

Provability in BI's Sequent Calculus is Decidable
by: Gheorghiu, Alexander, et al.
Published: (2021)

Serial Properties, Selector Proofs, and the Provability of Consistency
by: Artemov, Sergei
Published: (2024)

Non-Compact Proofs
by: Artemov, Sergei
Published: (2025)

Consistency formula is strictly stronger in PA than PA-consistency
by: Artemov, Sergei
Published: (2025)

Psi-Turing Machines: Bounded Introspection for Complexity Barriers and Oracle Separations
by: Huseynzade, Rafig
Published: (2025)

Adversarial Barrier in Uniform Class Separation
by: Rosko, Milan
Published: (2025)

On a Theorem by Bezboruah & Shepherdson
by: Visser, Albert
Published: (2026)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
by: Golovach, Petr A., et al.
Published: (2022)

Artifical intelligence and inherent mathematical difficulty
by: Dean, Walter, et al.
Published: (2024)

A correspondence between the time and space complexity
by: Latkin, Ivan V.
Published: (2023)

Domain size asymptotics for Markov logic networks
by: Koponen, Vera
Published: (2025)

Paradox on the Countable Axiom of Choice
by: Nezhad, Babak Jabbar
Published: (2024)

Complexities of Well-Quasi-Ordered Substructural Logics
by: Galatos, Nikolaos, et al.
Published: (2025)

#P is Sandwiched by One and Two #2DNF Calls: Is Subtraction Stronger Than We Thought?
by: Bannach, Max, et al.
Published: (2025)

Random expansions of trees with bounded height
by: Koponen, Vera, et al.
Published: (2024)

A Cut-Free Sequent Calculus for the Analysis of Finite-Trace Properties in Concurrent Systems
by: Fusco, Ludovico, et al.
Published: (2025)

A Logspace Constructive Proof of L=SL
by: Buss, Sam, et al.
Published: (2025)