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

@@ Property / describes a project that uses @@
+Ltur
@@ Property / describes a project that uses: Ltur / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+MiniSat
@@ Property / describes a project that uses: MiniSat / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10472-015-9452-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2062028302
@@ Property / OpenAlex ID: W2062028302 / rank @@
+Normal rank
@@ Property / cites work @@
+Recognition of \(q\)-Horn formulae in linear time
@@ Property / cites work: Recognition of \(q\)-Horn formulae in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
+Normal rank
@@ Property / cites work @@
+Properties of SLUR Formulae
@@ Property / cites work: Properties of SLUR Formulae / rank @@
+Normal rank
@@ Property / cites work @@
+Extended Horn sets in propositional logic
@@ Property / cites work: Extended Horn sets in propositional logic / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced matrices
@@ Property / cites work: Balanced matrices / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of theorem-proving procedures
@@ Property / cites work: The complexity of theorem-proving procedures / rank @@
+Normal rank
@@ Property / cites work @@
+Q3077976
@@ Property / cites work: Q3077976 / rank @@
+Normal rank
@@ Property / cites work @@
+LTUR: A simplified linear-time unit resolution algorithm for Horn formulae and computer implementation
+Normal rank
@@ Property / cites work @@
+A hierarchy of tractable satisfiability problems
@@ Property / cites work: A hierarchy of tractable satisfiability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Using Boolean Constraint Propagation for Sub-clauses Deduction
+Normal rank
@@ Property / cites work @@
+Linear-time algorithms for testing the satisfiability of propositional horn formulae
+Normal rank
@@ Property / cites work @@
+Q5687266
@@ Property / cites work: Q5687266 / rank @@
+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 @@
+Eliminating Redundant Clauses in SAT Instances
@@ Property / cites work: Eliminating Redundant Clauses in SAT Instances / rank @@
+Normal rank
@@ Property / cites work @@
+A perspective on certain polynomial-time solvable classes of satisfiability
+Normal rank
@@ Property / cites work @@
+Algorithms for testing the satisfiability of propositional formulae
+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 @@
+Unit Refutations and Horn Sets
@@ Property / cites work: Unit Refutations and Horn Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Q2741514
@@ Property / cites work: Q2741514 / rank @@
+Normal rank
@@ Property / cites work @@
+Renaming a Set of Clauses as a Horn Set
@@ Property / cites work: Renaming a Set of Clauses as a Horn Set / rank @@
+Normal rank
@@ Property / cites work @@
+Q3624095
@@ Property / cites work: Q3624095 / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for unique Horn satisfiability
+Normal rank
@@ Property / cites work @@
+A note on Dowling and Gallier's top-down algorithm for propositional Horn satisfiability
+Normal rank
@@ Property / cites work @@
+A simplified NP-complete satisfiability problem
@@ Property / cites work: A simplified NP-complete satisfiability problem / rank @@
+Normal rank