Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878): Difference between revisions
From MaRDI portal
Latest revision as of 14:30, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Recognizing renamable generalized propositional Horn formulas is NP- complete |
scientific article |
Statements
Recognizing renamable generalized propositional Horn formulas is NP- complete (English)
0 references
17 May 1995
0 references
Horn formulas
0 references
satisfiability problem
0 references
NP-completeness
0 references
0 references