English

A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems

Logic in Computer Science 2025-11-25 v1
Authors: Predrag Janičić
View on arXiv ↗ PDF ↗

Abstract

We propose a novel approach for the development, analysis, and verification of reductions between NP-complete problems. This method uses the URSA system, a SAT-based constraint solver and incorporates features that distinguish it from existing related systems.

Keywords

constraint satisfaction sequence alignment fault tree analysis

Cite

@article{arxiv.2511.18639,
  title  = {A SAT-based Approach for Specification, Analysis, and Justification of Reductions between NP-complete Problems},
  author = {Predrag Janičić},
  journal= {arXiv preprint arXiv:2511.18639},
  year   = {2025}
}

Related papers

View all related →
Artificial Intelligence · Computer Science
URSA: A System for Uniform Reduction to SAT
Predrag Janicic
2015-07-01
Programming Languages · Computer Science
REAS: Combining Numerical Optimization with SAT Solving
Jeevana Priya Inala, Sicun Gao, Soonho Kong, Armando Solar-Lezama
2018-02-14
Computational Complexity · Computer Science
Finding hardness reductions automatically using SAT solvers
Helena Bergold, Manfred Scheucher, Felix Schröder
2024-02-12
Artificial Intelligence · Computer Science
Computing Preferred Extensions in Abstract Argumentation: a SAT-based Approach
Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati
2013-10-24
Logic in Computer Science · Computer Science
SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers
Michael Codish, Igor Gonopolskiy, Amir M. Ben-Amram, Carsten Fuhs +1
2011-08-01
Logic in Computer Science · Computer Science
Generalizing Unit Commitment Problem Solving via SAT-based Decoupling
Yuxin Zhao, Han Huang, Fangji Fu, Zhifeng Hao
2026-04-21
Computational Complexity · Computer Science
An Efficient Method to Transform SAT problems to Binary Integer Linear Programming Problem
Wenxia Guo, Jin Wang, Majun He, Xiaoqin Ren +2
2018-03-28
Quantum Physics · Physics
A stochastic limit approach to the SAT problem
Luigi Accardi, Masanori Ohya
2007-05-23
Logic in Computer Science · Computer Science
Extending Clause Learning SAT Solvers with Complete Parity Reasoning (extended version)
Tero Laitinen, Tommi Junttila, Ilkka Niemelä
2012-09-11
Logic in Computer Science · Computer Science
Logic Optimization Meets SAT: A Novel Framework for Circuit-SAT Solving
Zhengyuan Shi, Tiebing Tang, Jiaying Zhu, Sadaf Khan +4
2025-07-03
Artificial Intelligence · Computer Science
Machine Learning for SAT: Restricted Heuristics and New Graph Representations
Mikhail Shirokikh, Ilya Shenbin, Anton Alekseev, Sergey Nikolenko
2023-07-19
Logic in Computer Science · Computer Science
A Single-Instance Incremental SAT Formulation of Proof- and Counterexample-Based Abstraction
Niklas Een, Alan Mishchenko, Nina Amla
2010-08-13
Artificial Intelligence · Computer Science
diff-SAT -- A Software for Sampling and Probabilistic Reasoning for SAT and Answer Set Programming
Matthias Nickles
2021-01-05
Artificial Intelligence · Computer Science
Machine Learning Methods in Solving the Boolean Satisfiability Problem
Wenxuan Guo, Junchi Yan, Hui-Ling Zhen, Xijun Li +2
2023-10-25
Artificial Intelligence · Computer Science
How To Discover Short, Shorter, and the Shortest Proofs of Unsatisfiability: A Branch-and-Bound Approach for Resolution Proof Length Minimization
Konstantin Sidorov, Koos van der Linden, Gonçalo Homem de Almeida Correia, Mathijs de Weerdt +1
2024-11-13
Logic in Computer Science · Computer Science
Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
Zhiwei Zhang, Samy Wu Fung, Anastasios Kyrillidis, Stanley Osher +1
2025-06-03
Data Structures and Algorithms · Computer Science
satsuma: Structure-based Symmetry Breaking in SAT
Markus Anders, Sofia Brenner, Gaurav Rattan
2024-06-21
Logic in Computer Science · Computer Science
SAT-Based Subsumption Resolution
Robin Coutelier, Laura Kovács, Michael Rawson, Jakob Rath
2024-02-01
Logic in Computer Science · Computer Science
RustSAT: A Library For SAT Solving in Rust
Christoph Jabs
2025-05-22
Artificial Intelligence · Computer Science
Extracting Frequent Gradual Patterns Using Constraints Modeling
Jerry Lonlac, Saïdd Jabbour, Engelbert Mephu Nguifo, Lakhdar Saïs +1
2019-03-21
Logic in Computer Science · Computer Science
A Translational Approach to Constraint Answer Set Solving
Christian Drescher, Toby Walsh
2010-07-26
Software Engineering · Computer Science
Leveraging Transformer-based Language Models to Automate Requirements Satisfaction Assessment
Amrit Poudel, Jinfeng Lin, Jane Cleland-Huang
2023-12-08
Machine Learning · Computer Science
Optimal Decision Trees For Interpretable Clustering with Constraints (Extended Version)
Pouya Shati, Eldan Cohen, Sheila McIlraith
2023-05-17
Artificial Intelligence · Computer Science
Aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming
Mutsunori Banbara, Martin Gebser, Katsumi Inoue, Torsten Schaub +3
2013-12-23
Data Structures and Algorithms · Computer Science
Towards P = NP via k-SAT: A k-SAT Algorithm Using Linear Algebra on Finite Fields
Matt Groff
2015-03-19
R2 v1 2026-07-01T07:51:16.182Z