On CNF conversion for disjoint SAT enumeration
From MaRDI portal
Publication:6643091
DOI10.4230/lipics.sat.2023.15MaRDI QIDQ6643091
Roberto Sebastiani, Giuseppe Spallitta, Gabriele Masina
Publication date: 26 November 2024
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
This page was built for publication: On CNF conversion for disjoint SAT enumeration