Exact approaches for the diverse satisfiability problem

DOI10.1007/978-3-032-04590-4_15MaRDI QIDQ6884710zbMATH OpenFDO

Authors Zhifei Zheng, Sami Cherif, Rui Sá Shibasaki, Chu-Min Li, Jialu Zhang

Publication date 15 December 2025

Full work available at URL https://doi.org/10.1007/978-3-032-04590-4_15

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites work

• Cardinality Networks and Their Applications
• Exact MinSAT Solving
• Generating Diverse Solutions in SAT
• scientific article; zbMATH DE number 3249560 (Why is no real title available?)
• Mixed-integer quadratic programming is in NP
• On the Hamming distance of constraint satisfaction problems.
• PySAT: a Python toolkit for prototyping with SAT oracles
• Recent Advances in Constraints
• SATLIB: An online resource for research on SAT
• The complexity of theorem-proving procedures
• Theory and applications of satisfiability testing -- SAT 2006. 9th international conference, Seattle, WA, USA, August 12--15, 2006. Proceedings.
• Tools and Algorithms for the Construction and Analysis of Systems
• Tools and algorithms for the construction and analysis of systems. 13th international conference, TACAS 2007, held as part of the joint European conferences on theory and practice of software, ETAPS 2007, Braga, Portugal, March 24 -- April 1, 2007. Procee
• Towards universally accessible SAT technology

This page was built for publication: Exact approaches for the diverse satisfiability problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884710)