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

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets
description / endescription / en
 
scientific article; zbMATH DE number 6197760
Property / title
 
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (English)
Property / title: On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1273.03050 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-31612-8_21 / rank
 
Normal rank
Property / published in
 
Property / published in: Theory and Applications of Satisfiability Testing – SAT 2012 / rank
 
Normal rank
Property / publication date
 
12 August 2013
Timestamp+2013-08-12T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 12 August 2013 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F20 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6197760 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3099604183 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Refutations and Horn Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subclasses of minimal unsatisfiable formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds on the complexity of generalised resolution and generalised constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Variables with Few Occurrences in Conjunctive Normal Forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Davis-Putnam reductions for minimally unsatisfiable clause-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution-based lower bounds in MaxSAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4583686 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Extraction of High-Level Minimal Unsatisfiable Cores / rank
 
Normal rank
Property / cites work
 
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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two tractable subclasses of minimal unsatisfiable formulas / rank
 
Normal rank

Latest revision as of 05: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

Statements

On Davis-Putnam reductions for minimally unsatisfiable clause-sets (English)
0 references
On Davis-Putnam Reductions for Minimally Unsatisfiable Clause-Sets (English)
0 references
0 references
0 references
0 references
0 references
10 January 2014
0 references
12 August 2013
0 references
0 references
0 references
clause-sets (CNFs)
0 references
minimal unsatisfiability
0 references
Davis-Putnam reduction
0 references
variable elimination
0 references
confluence
0 references
isomorphism
0 references
singular variables
0 references
singular DP-reduction
0 references
deficiency
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references