Abstract
Within a restricted class of predicate logic formulas, which we call theconnective-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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
