Faster Extraction of High-Level Minimal Unsatisfiable Cores (Q3007682): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-21581-0_15
+Normal rank
@@ Property / OpenAlex ID @@
+W144339668
@@ Property / OpenAlex ID: W144339668 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Generation of Unsatisfiability Proofs and Cores in SAT
+Normal rank
@@ Property / cites work @@
+Q5715680
@@ Property / cites work: Q5715680 / rank @@
+Normal rank
@@ Property / cites work @@
+A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
+Normal rank
@@ Property / cites work @@
+Using heuristics to find minimal unsatisfiable subformulas in satisfiability problems
+Normal rank
@@ Property / cites work @@
+Q2845506
@@ Property / cites work: Q2845506 / rank @@
+Normal rank
@@ Property / cites work @@
+An approach for extracting a small unsatisfiable core
+Normal rank
@@ Property / cites work @@
+A branch and bound algorithm for extracting smallest minimal unsatisfiable subformulas
+Normal rank
@@ Property / cites work @@
+Algorithms for computing minimal unsatisfiable subsets of constraints
+Normal rank
@@ Property / cites work @@
+Computer Aided Verification
@@ Property / cites work: Computer Aided Verification / rank @@
+Normal rank
@@ Property / cites work @@
+Q4417909
@@ Property / cites work: Q4417909 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of facets resolved
@@ Property / cites work: The complexity of facets resolved / rank @@
+Normal rank
@@ Property / cites work @@
+Finding Guaranteed MUSes Fast
@@ Property / cites work: Finding Guaranteed MUSes Fast / rank @@
+Normal rank