On minimizing the <tex>$\forall-$</tex>≩ degree of a connective-free formulaOn minimizing the <tex>$\forall-$</tex>≩ degree of a connective-free formula
Faculty of Sciences. Mathematics and Computer Science

Department of Mathematics - Computer Sciences

article

1993Berlin, 1993

Computer. Automation

Acta informatica. - Berlin

30(1993):5, p. 489-502

0001-5903

A1993LV04100007

E

English (eng)

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.

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