Variable and term removal from Boolean formulae
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3902554 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1995157 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3385535 (Why is no real title available?)
- A Complexity Index for Satisfiability Problems
- Algorithms for testing the satisfiability of propositional formulae
- Detecting embedded Horn structure in propositional logic
- Node-and edge-deletion NP-complete problems
- Polynomial-time inference of all valid implications for Horn and related formulae
- Recognition of q-Horn formulae in linear time
- Renaming a Set of Clauses as a Horn Set
- Some simplified NP-complete graph problems
- The node-deletion problem for hereditary properties is NP-complete
Cited in
(11)- Disjoint DNF tautologies with conflict bound two
- Backdoors to q-Horn
- Backdoor DNFs
- Backdoors to planning
- Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
- Maximum renamable Horn sub-CNFs
- Backdoors to satisfaction
- Backdoor sets of quantified Boolean formulas
- Correlations between Horn fractions, satisfiability and solver performance for fixed density random 3-CNF instances
- On the size of maximum renamable Horn sub-CNF
- Backdoors into two occurrences
This page was built for publication: Variable and term removal from Boolean formulae
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1363769)
