About some UP-based polynomial fragments of SAT (Q513329): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Properties of SLUR Formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Horn sets in propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of tractable satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Boolean Constraint Propagation for Sub-clauses Deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time algorithms for testing the satisfiability of propositional horn formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eliminating Redundant Clauses in SAT Instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: A perspective on certain polynomial-time solvable classes of satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for testing the satisfiability of propositional formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Refutations and Horn Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2741514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renaming a Set of Clauses as a Horn Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for unique Horn satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplified NP-complete satisfiability problem / rank
 
Normal rank

Latest revision as of 12:07, 13 July 2024

scientific article
Language Label Description Also known as
English
About some UP-based polynomial fragments of SAT
scientific article

    Statements

    About some UP-based polynomial fragments of SAT (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 March 2017
    0 references
    SAT
    0 references
    unit propagation
    0 references
    polynomial classes
    0 references
    Quad
    0 references
    UP-Horn
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers