Checking the satisfiability of formulas represented in disjunctive normal form in the language L. II
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.
Keywordslanguage L satisfiability of a formula depth of a formula set of conjuncts data representation estimation of complexity
Unable to display preview. Download preview PDF.
- 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).Google Scholar
- 2.A. N. Chebotarev, “Approach to functional specification of automaton systems. I,” Kibern. Sist. Anal., No. 3, 31–42 (1993).Google Scholar
- 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.Google Scholar