Showing papers on "Conjunctive normal form published in 1976"
TL;DR: A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus, which contains but one predicate symbol, that being unary, and one function symbol which symbol is binary.
Abstract: A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus. The members of this class are closed prenex formulas of the form ∀x∀yC. The matrix C is in conjunctive normal form and has no disjuncts with more than three literals, in fact all but one conjunct is unary. Furthermore C contains but one predicate symbol, that being unary, and one function symbol which symbol is binary.
1 citations