Skip to main content
SpringerLink
Log in

Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

This paper concentrates on issues of implementation of the method proposed for checking the consistency of formulae of the language L and described in the first part of this work. Upper-bound estimates of time complexity of the corresponding algorithms are obtained.

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. S. L. Kryvyi and A. N. Chebotarev, “Checking the satisfiability of formulas represented in disjunctive normal form in the language L. I,” Kibern. Sist. Anal., No. 4, 22–28 (2005).

  2. A. N. Chebotarev, “Approach to functional specification of automaton systems. I,” Kibern. Sist. Anal., No. 3, 31–42 (1993).

  3. P. Mc Geer, J. Sanghavi, R. K. Brayton, and A. L. Sangiovani-Vincentelli, “ESPRESSO— SIGNATURES: A New Exact Minimizer for Logic Functions,” in: Proc. 30th ACM/IEEE Design Automation Conf., ACM, New York (1993), pp. 618–621.

Download references

Author information

Authors and Affiliations

  1. Cybernetics Institute, National Academy of Sciences of Ukraine, Kiev, Ukraine

    S. L. Kryvyj & A. N. Chebotarev

Authors
  1. S. L. Kryvyj
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. N. Chebotarev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Part I of this article is published in No. 4 (2005).

__________

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 11–19, November–December 2005.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kryvyj, S.L., Chebotarev, A.N. Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II. Cybern Syst Anal 41, 800–807 (2005). https://doi.org/10.1007/s10559-006-0018-2

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-006-0018-2

Keywords

Search

Navigation