A Method for Constructing Minimally Unsatisfiable CNFs
Logic in Computer Science
2012-12-03 v1 Logic
Authors:
Robert Cowen
Abstract
We generalize a method of Ivor Spence (J. of Experimental Algorithms 15(March 2010)) that produces unsatisfiable cnfs and show experimentally that, for the most part, the resulting cnfs are minimally unsatisfiable.
Cite
@article{arxiv.1211.7152,
title = {A Method for Constructing Minimally Unsatisfiable CNFs},
author = {Robert Cowen},
journal= {arXiv preprint arXiv:1211.7152},
year = {2012}
}
Related papers
View all related →
Discrete Mathematics · Computer Science
Small unsatisfiable $k$-CNFs with bounded literal occurrence
Tianwei Zhang, Tomáš Peitl, Stefan Szeider
2024-07-22
Artificial Intelligence · Computer Science
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization (extended algorithms and examples)
Emilio Gamba, Bart Bogaerts, Tias Guns
2023-11-29
Optimization and Control · Mathematics
Algorithms and Convergence Results of Projection Methods for Inconsistent Feasibility Problems: A Review
Yair Censor, Maroun Zaknoon
2018-04-27
Artificial Intelligence · Computer Science
Testing Unsatisfiability of Constraint Satisfaction Problems via Tensor Products
Daya Gaur, Muhammad Khan
2020-02-11
Logic in Computer Science · Computer Science
A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
Nachum Dershowitz, Ziyad Hanna, Alexander Nadel
2020-06-11
Artificial Intelligence · Computer Science
Efficiently Explaining CSPs with Unsatisfiable Subset Optimization
Emilio Gamba, Bart Bogaerts, Tias Guns
2021-07-06
Discrete Mathematics · Computer Science
Unsatisfiable Linear CNF Formulas Are Large and Complex
Dominik Scheder
2010-10-29
Machine Learning · Computer Science
Flexible and Robust Counterfactual Explanations with Minimal Satisfiable Perturbations
Yongjie Wang, Hangwei Qian, Yongjie Liu, Wei Guo +1
2023-09-12
Machine Learning · Computer Science
Causally Consistent Normalizing Flow
Qingyang Zhou, Kangjie Lu, Meng Xu
2024-12-18
Computational Complexity · Computer Science
Complexity of the CNF-satisfiability problem
Grigoriy V. Bokov
2018-07-23
Neural and Evolutionary Computing · Computer Science
Optimizing Convolutional Neural Networks for Embedded Systems by Means of Neuroevolution
Filip Badan, Lukas Sekanina
2019-10-16
Computation and Language · Computer Science
Could you give me a hint? Generating inference graphs for defeasible reasoning
Aman Madaan, Dheeraj Rajagopal, Niket Tandon, Yiming Yang +1
2021-06-01
Computational Complexity · Computer Science
Lower Bounds on Intermediate Results in Bottom-Up Knowledge Compilation
Alexis de Colnet, Stefan Mengel
2021-12-24
Artificial Intelligence · Computer Science
Solving WCSP by Extraction of Minimal Unsatisfiable Cores
Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary
2013-04-22
Machine Learning · Computer Science
InfoCNF: An Efficient Conditional Continuous Normalizing Flow with Adaptive Solvers
Tan M. Nguyen, Animesh Garg, Richard G. Baraniuk, Anima Anandkumar
2019-12-10
Optimization and Control · Mathematics
Zero-Convex Functions, Perturbation Resilience, and Subgradient Projections for Feasibility-Seeking Methods
Yair Censor, Daniel Reem
2017-03-06
Mathematical Physics · Physics
A Satisfiability algorithm based on Simple Spinors of the Clifford algebra of $\mathbb{R}^{n,n}$
Marco Budinich
2026-04-21
Discrete Mathematics · Computer Science
On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution
Jakob Nordström, Alexander Razborov
2016-09-08
Artificial Intelligence · Computer Science
A New General Method to Generate Random Modal Formulae for Testing Decision Procedures
P. F. Patel-Schneider, R. Sebastiani
2011-06-28
Machine Learning · Computer Science
Generating Interpretable Counterfactual Explanations By Implicit Minimisation of Epistemic and Aleatoric Uncertainties
Lisa Schut, Oscar Key, Rory McGrath, Luca Costabello +3
2021-03-17
Machine Learning · Computer Science
SAFE: Saliency-Aware Counterfactual Explanations for DNN-based Automated Driving Systems
Amir Samadi, Amir Shirian, Konstantinos Koufos, Kurt Debattista +1
2023-08-01
Machine Learning · Computer Science
Iterative Partial Fulfillment of Counterfactual Explanations: Benefits and Risks
Yilun Zhou
2023-06-20
Neural and Evolutionary Computing · Computer Science
Constructing Complexity-efficient Features in XCS with Tree-based Rule Conditions
Trung B. Nguyen, Will N. Browne, Mengjie Zhang
2020-04-24
Logic in Computer Science · Computer Science
Are You Satisfied by This Partial Assignment?
Roberto Sebastiani
2020-03-10
Optimization and Control · Mathematics
"Efficient" Subgradient Methods for General Convex Optimization
James Renegar
2016-05-30