Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems (Q1037449): Difference between revisions

@@ Property / describes a project that uses @@
+BerkMin
@@ Property / describes a project that uses: BerkMin / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-008-9142-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2081776044
@@ Property / OpenAlex ID: W2081776044 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263701
@@ Property / cites work: Q4263701 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247437
@@ Property / cites work: Q4247437 / rank @@
+Normal rank
@@ Property / cites work @@
+A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
+Normal rank
@@ Property / cites work @@
+Approximating minimal unsatisfiable subformulae by means of adaptive core search
+Normal rank
@@ Property / cites work @@
+Finding a Useful Subset of Constraints for Analysis in an Infeasible Linear Program
+Normal rank
@@ Property / cites work @@
+A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for finding critical subgraphs
+Normal rank
@@ Property / cites work @@
+Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
+Normal rank
@@ Property / cites work @@
+Solution techniques for the large set covering problem
+Normal rank
@@ Property / cites work @@
+Identifying Minimally Infeasible Subsystems of Inequalities
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the maximum satisfiability problem
@@ Property / cites work: Algorithms for the maximum satisfiability problem / rank @@
+Normal rank
@@ Property / cites work @@
+Relational concept learning by cooperative evolution
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for computing a representation for minimal unsatisfiable formulas with fixed deficiency.
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank
@@ Property / cites work @@
+Boosting complete techniques thanks to local search methods
+Normal rank
@@ Property / cites work @@
+Guided local search for solving SAT and weighted MAX-SAT problems
+Normal rank
@@ Property / cites work @@
+Theory and Applications of Satisfiability Testing
@@ Property / cites work: Theory and Applications of Satisfiability Testing / rank @@
+Normal rank