Imagen de Portada

The Model Counting Competition 2020

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Fichte, Johannes K., Hecher, Markus, Hamiti, Florim
Formato:	Preprint
Publicado:	2020
Materias:	Logic in Computer Science Artificial Intelligence Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Model Counting Competitions 2021-2023
por: Fichte, Johannes K., et al.
Publicado: (2025)

Epistemic Logic Programs: Non-Ground and Counting Complexity
por: Eiter, Thomas, et al.
Publicado: (2025)

Asymptotically Smaller Encodings for Graph Problems and Scheduling
por: Subercaseaux, Bernardo
Publicado: (2025)

Approximate Model Counting, Sparse XOR Constraints and Minimum Distance
por: Boreale, Michele, et al.
Publicado: (2019)

SAT Encoding of Partial Ordering Models for Graph Coloring Problems
por: Faber, Daniel, et al.
Publicado: (2024)

Rejection in Abstract Argumentation: Harder Than Acceptance?
por: Fichte, Johannes K., et al.
Publicado: (2024)

Finding hardness reductions automatically using SAT solvers
por: Bergold, Helena, et al.
Publicado: (2024)

Model checking with temporal graphs and their derivative
por: Bui-Xuan, Binh-Minh, et al.
Publicado: (2026)

Algorithms and Complexity of Difference Logic
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Subgraph Isomorphism: Prolog vs. Conventional
por: Yin, Claire Y., et al.
Publicado: (2025)

The Sherali-Adams and Weisfeiler-Leman hierarchies in (Promise Valued) Constraint Satisfaction Problems
por: Barto, Libor, et al.
Publicado: (2024)

Efficient Coalgebraic Partition Refinement
por: Dorsch, Ulrich, et al.
Publicado: (2017)

Derivation and Verification of Array Sorting by Merging, and its Certification in Dafny
por: Carbonell, Juan Pablo, et al.
Publicado: (2025)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
por: Kleest-Meißner, Sarah, et al.
Publicado: (2022)

Discovering Expert-Level Nash Equilibrium Algorithms with Large Language Models
por: Li, Hanyu, et al.
Publicado: (2025)

Foundations for an Abstract Proof Theory in the Context of Horn Rules
por: Lyon, Tim S., et al.
Publicado: (2023)

Exact Exploration
por: Blass, Andreas, et al.
Publicado: (2024)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
por: Amarilli, Antoine, et al.
Publicado: (2023)

Direct Access for Answers to Conjunctive Queries with Aggregation
por: Eldar, Idan, et al.
Publicado: (2023)

Factorised Representations of Join Queries: Tight Bounds and a New Dichotomy
por: Berkholz, Christoph, et al.
Publicado: (2025)

From Width-Based Model Checking to Width-Based Automated Theorem Proving
por: Oliveira, Mateus de Oliveira, et al.
Publicado: (2022)

First Order Logic on Pathwidth Revisited Again
por: Lampis, Michael
Publicado: (2022)

Toward a Uniform Algorithm and Uniform Reduction for Constraint Problems
por: Barto, Libor, et al.
Publicado: (2026)

Fine-grained Meta-Theorems for Vertex Integrity
por: Lampis, Michael, et al.
Publicado: (2021)

New Algorithms and Hardness Results for Robust Satisfiability of (Promise) CSPs
por: Brakensiek, Joshua, et al.
Publicado: (2026)

Elementary first-order model checking for sparse graphs
por: Gajarský, Jakub, et al.
Publicado: (2024)

On merge-models
por: Buffière, Hector, et al.
Publicado: (2026)

CNFs and DNFs with Exactly $k$ Solutions
por: Chandran, L. Sunil, et al.
Publicado: (2025)

Flipper games for monadically stable graph classes
por: Gajarský, Jakub, et al.
Publicado: (2023)

Formal Primal-Dual Algorithm Analysis
por: Abdulaziz, Mohammad, et al.
Publicado: (2026)

Color Refinement for Relational Structures
por: Scheidt, Benjamin, et al.
Publicado: (2024)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
por: de Colnet, Alexis, et al.
Publicado: (2026)

The Iteration Number of the Weisfeiler-Leman Algorithm
por: Grohe, Martin, et al.
Publicado: (2023)

Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
por: Grohe, Martin, et al.
Publicado: (2023)

A bargain for mergesorts -- How to prove your mergesort correct and stable, almost for free
por: Cohen, Cyril, et al.
Publicado: (2024)

Automated Expected Amortised Cost Analysis of Probabilistic Data Structures
por: Leutgeb, Lorenz, et al.
Publicado: (2022)

On classes of bounded tree rank, their interpretations, and efficient sparsification
por: Gajarský, Jakub, et al.
Publicado: (2024)

Beyond Value Iteration for Parity Games: Strategy Iteration with Universal Trees
por: Koh, Zhuan Khye, et al.
Publicado: (2021)

Solving Partial Dominating Set and Related Problems Using Twin-Width
por: Balabán, Jakub, et al.
Publicado: (2025)

SDPs and Robust Satisfiability of Promise CSP
por: Brakensiek, Joshua, et al.
Publicado: (2022)