On minimizing the <tex>$\forall-$</tex>≩ degree of a connective-free formula
Faculty of Sciences. Mathematics and Computer Science
Acta informatica. - Berlin
, p. 489-502
University of Antwerp
Within a restricted class of predicate logic formulas, which we call the connective-free formulas, we address the following optimization problem: Given a formula, find all equivalent formulas in which the number of occurring negations and universal quantifiers is minimal. We present algorithms that solve the problem, as well as the associated decision, search and enumeration problems, efficiently.