Simplifying clausal satisfiability problems (Q5096298): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4282501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4264722 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution vs. cutting plane solution of inference problems: Some computational experience / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized resolution for 0--1 linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-cut solution of inference problems in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Running time experiments on some algorithms for solving propositional satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank

Latest revision as of 22:18, 29 July 2024

scientific article; zbMATH DE number 7572105
Language Label Description Also known as
English
Simplifying clausal satisfiability problems
scientific article; zbMATH DE number 7572105

    Statements

    Simplifying clausal satisfiability problems (English)
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    integer programming
    0 references
    propositional logic
    0 references
    minimal support
    0 references
    linear programming relaxation
    0 references
    satisfiability problem
    0 references