Skip to main content
SpringerLink
Log in

On minimizing the ∀-≩ degree of a connective-free formula

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms. Reading: Addison-Wesley 1974

    Google Scholar 

  2. Book, R.V.: Thue systems as rewriting systems. J. Symb. Comput.3, 39–68 (1987)

    Google Scholar 

  3. Dershowithz, N., Jouannaud, J.-P.: Rewrite systems. In: Leeuwen, J. van (ed.) Handbook of theoretical computer science, vol. B, chap. 6. Amsterdam: Elsevier 1990

    Google Scholar 

  4. Enderton, H.B.: A mathematical introduction to logic. New York: Academic Press 1972

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. San Francisco: Freeman 1979

    Google Scholar 

  6. Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete mathematics. Reading: Addison-Wesley 1989

    Google Scholar 

  7. Ozsoyoglu, G., Wang, H.: A relational calculus with set operators, its safety, and equivalent graphical languages. IEEE Trans. Software Eng.15(9), 1038–1052 (1989)

    Google Scholar 

  8. Van den Bussche, J.: Evaluation and optimization of complex object selections. In: Delobel, C., Kifer, M., Masunaga, A. (eds.) Deductive and object-oriented databases. (Lect. Notes Comput. Sci., vol. 566, pp. 226–243) Berlin Heidelberg New York: Springer 1991

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, University of Antwerp (UIA), Universiteitsplein 1, B-2610, Antwerp, Belgium

    Jan Van den Bussche

Authors
  1. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Research Assistant of the NFWO.

This article was processed by the author using the Springer-Verlag TEX PJourlg macro package 1991.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van den Bussche, J. On minimizing the ∀-≩ degree of a connective-free formula. Acta Informatica 30, 489–502 (1993). https://doi.org/10.1007/BF01210598

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01210598

Keywords

Search

Navigation