Cover Image

On CNF formulas irredundant with respect to unit clause propagation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Savický, Petr
Format:	Preprint
Published:	2023
Subjects:	Combinatorics Artificial Intelligence
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Digraphons: connectivity and spectral aspects
by: Hladký, Jan, et al.
Published: (2025)

Inhomogeneous random 2-SAT
by: Hladký, Jan, et al.
Published: (2025)

Zero forcing irredundant sets
by: Curtis, Bryan A., et al.
Published: (2024)

Universal perspectives on irredundance for X-set parameters
by: Curtis, Bryan, et al.
Published: (2025)

Cardinalities of irredundant bases of finite primitive groups
by: Mastrogiacomo, Fabio
Published: (2024)

On the satisfiability of random $3$-SAT formulas with $k$-wise independent clauses
by: Caragiannis, Ioannis, et al.
Published: (2024)

Artificial intelligence and machine learning generated conjectures with TxGraffiti
by: Davila, Randy
Published: (2024)

AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
by: Jha, Piyush, et al.
Published: (2024)

Tangles: a structural approach to artificial intelligence in the empirical sciences (Part I)
by: Diestel, Reinhard
Published: (2020)

BEAM: Bi-level Memory-adaptive Algorithmic Evolution for LLM-Powered Heuristic Design
by: Xiang, Chuyang, et al.
Published: (2026)

Automated conjecturing with \emph{TxGraffiti}
by: Davila, Randy
Published: (2024)

New Bounds for Zarankiewicz Numbers via Reinforced LLM Evolutionary Search
by: Bhan, Jay, et al.
Published: (2026)

Doubly Saturated Ramsey Graphs: A Case Study in Computer-Assisted Mathematical Discovery
by: Przybocki, Benjamin, et al.
Published: (2026)

The \emph{Optimist}: Towards Fully Automated Graph Theory Research
by: Davila, Randy
Published: (2024)

Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)

On the enumeration of signatures of XOR-CNF's
by: Creignou, Nadia, et al.
Published: (2024)

Polymorphic Combinatorial Frameworks (PCF): Guiding the Design of Mathematically-Grounded, Adaptive AI Agents
by: Pearl, David, et al.
Published: (2025)

The Compilability Thresholds of 2-CNF to OBDD
by: de Colnet, Alexis, et al.
Published: (2026)

Asymptotic Bounds for CO-irredundant and Irredundant Ramsey Numbers
by: Ji, Meng, et al.
Published: (2021)

The Packing Chromatic Number of the Infinite Square Grid is 15
by: Subercaseaux, Bernardo, et al.
Published: (2023)

Using Reasoning Models to Generate Search Heuristics that Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025)

Reinforced Generation of Combinatorial Structures: Ramsey Numbers
by: Nagda, Ansh, et al.
Published: (2026)

Semi-Autonomous Mathematics Discovery with Gemini: A Case Study on the Erdős Problems
by: Feng, Tony, et al.
Published: (2026)

In Reverie Together: Ten Years of Mathematical Discovery with a Machine Collaborator
by: Davila, Randy, et al.
Published: (2025)

Graph Neural Networks vs Convolutional Neural Networks for Graph Domination Number Prediction
by: Davila, Randy, et al.
Published: (2025)

Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem
by: Vu, Nguyen Gia Hien, et al.
Published: (2025)

Complement Submodular Information Measures for Balanced and Robust Data Selection
by: Iyer, Rishabh
Published: (2026)

Exact MAP inference in general higher-order graphical models using linear programming
by: Bechar, Ikhlef
Published: (2017)

Compilation and Fast Model Counting beyond CNF
by: de Colnet, Alexis, et al.
Published: (2025)

Lifted Inference beyond First-Order Logic
by: Malhotra, Sagar, et al.
Published: (2023)

Agentic Neurosymbolic Collaboration for Mathematical Discovery: A Case Study in Combinatorial Design
by: Xia, Hai, et al.
Published: (2026)

Empirical Analysis Of Heuristic and Approximation Algorithms for the The Mutual-Visibility Problem
by: Stojanović, Vanja, et al.
Published: (2025)

Using Code Generation to Solve Open Instances of Combinatorial Design Problems
by: Rosin, Christopher D.
Published: (2025)

Toward TransfORmers: Revolutionizing the Solution of Mixed Integer Programs with Transformers
by: Cooper, Joshua F., et al.
Published: (2024)

Trees and Graphs with Non Log-concave Dominating Set Sequence via AI Tools
by: Du, Alina, et al.
Published: (2026)

Automated Discovery of Improved Constant Weight Binary Codes
by: Rosin, Christopher D.
Published: (2026)

Reinforced Generation of Combinatorial Structures: Hardness of Approximation
by: Nagda, Ansh, et al.
Published: (2025)

Where Paths Collide: A Comprehensive Survey of Classic and Learning-Based Multi-Agent Pathfinding
by: Wang, Shiyue, et al.
Published: (2025)

An AI enhanced approach to the tree unimodality conjecture
by: Ramos, Eric, et al.
Published: (2025)

Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics
by: Chau, Herman, et al.
Published: (2025)