Title On minimizing the $\forall-$≩ degree of a connective-free formulaOn minimizing the $\forall-$≩ degree of a connective-free formula Author van den Bussche, J. Faculty/Department Faculty of Sciences. Mathematics and Computer Science Research group Department of Mathematics - Computer Sciences Publication type article Publication 1993Berlin, 1993 Subject Computer. Automation Source (journal) Acta informatica. - Berlin Volume/pages 30(1993):5, p. 489-502 ISSN 0001-5903 ISI A1993LV04100007 Carrier E Target language English (eng) Full text (Publishers DOI) Affiliation University of Antwerp Abstract 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. E-info http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1993LV04100007&DestLinkType=RelatedRecords&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848 http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=WOS:A1993LV04100007&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=ef845e08c439e550330acc77c7d2d848 Handle