On Davis-Putnam reductions for minimally unsatisfiable clause-sets (Q391124): Difference between revisions

← Older edit

@@ aliases / en / 0 / aliases / en / 0 @@
+On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
@@ description / en / description / en @@
-scientific article
+scientific article; zbMATH DE number 6197760
@@ Property / title @@
+On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (English)
+Normal rank
@@ Property / zbMATH Open document ID @@
+.03050
@@ Property / zbMATH Open document ID: 1273.03050 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/978-3-642-31612-8_21
@@ Property / DOI: 10.1007/978-3-642-31612-8_21 / rank @@
+Normal rank
@@ Property / author @@
+Zhao, Xishun
@@ Property / author: Zhao, Xishun / rank @@
+Normal rank
@@ Property / published in @@
+Theory and Applications of Satisfiability Testing – SAT 2012
+Normal rank
@@ Property / publication date @@
+August 2013Timestamp +2013-08-12T00:00:00Z
Timezone +00:00
Calendar Gregorian
Precision 1 day
Before 0
After 0
-Timestamp
++2013-08-12T00:00:00Z
-Timezone
++00:00
-Calendar
+Gregorian
-Precision
+day
 Before
 After
@@ Property / publication date: 12 August 2013 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+F20
@@ Property / Mathematics Subject Classification ID: 03F20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6197760
@@ Property / zbMATH DE Number: 6197760 / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MiniSat
@@ Property / describes a project that uses: MiniSat / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+JBool
@@ Property / describes a project that uses: JBool / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+NiVER
@@ Property / describes a project that uses: NiVER / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W4246030944
@@ Property / OpenAlex ID: W4246030944 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3099604183
@@ Property / OpenAlex ID: W3099604183 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2600
@@ Property / arXiv ID: 1202.2600 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas
+Normal rank
@@ Property / cites work @@
+Q3077976
@@ Property / cites work: Q3077976 / rank @@
+Normal rank
@@ Property / cites work @@
+A Computing Procedure for Quantification Theory
@@ Property / cites work: A Computing Procedure for Quantification Theory / rank @@
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF
+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 @@
+Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
+Normal rank
@@ Property / cites work @@
+Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms
+Normal rank
@@ Property / cites work @@
+Q2741518
@@ Property / cites work: Q2741518 / rank @@
+Normal rank
@@ Property / cites work @@
+Unit Refutations and Horn Sets
@@ Property / cites work: Unit Refutations and Horn Sets / rank @@
+Normal rank
@@ Property / cites work @@
+On subclasses of minimal unsatisfiable formulas
@@ Property / cites work: On subclasses of minimal unsatisfiable formulas / rank @@
+Normal rank
@@ Property / cites work @@
+Q5503674
@@ Property / cites work: Q5503674 / rank @@
+Normal rank
@@ Property / cites work @@
+Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency
+Normal rank
@@ Property / cites work @@
+On Variables with Few Occurrences in Conjunctive Normal Forms
+Normal rank
@@ Property / cites work @@
+On Davis-Putnam reductions for minimally unsatisfiable clause-sets
+Normal rank
@@ Property / cites work @@
+Resolution-based lower bounds in MaxSAT
@@ Property / cites work: Resolution-based lower bounds in MaxSAT / rank @@
+Normal rank
@@ Property / cites work @@
+Q4583686
@@ Property / cites work: Q4583686 / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Extraction of High-Level Minimal Unsatisfiable Cores
+Normal rank
@@ Property / cites work @@
+Theory and applications of satisfiability testing -- SAT 2011. 14th international conference, SAT 2011, Ann Arbor, MI, USA, June 19--22, 2011. Proceedings
+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 @@
+Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Two tractable subclasses of minimal unsatisfiable formulas
+Normal rank

Latest revision as of 04:44, 7 July 2024

scientific article; zbMATH DE number 6197760

On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets

Language	Label	Description	Also known as
English	On Davis-Putnam reductions for minimally unsatisfiable clause-sets	scientific article; zbMATH DE number 6197760	On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets