A transformation of the problems of minimal satisfaction of constraints

  • Ireneusz Sierocki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 585)


This paper concerns the search problems, called the problems of minimal satisfaction of constraints. The problem transformation method is proposed. It is proved that if a problem P2 is a homomorphic image of a problem P1 then P1 is transformable into P2. Next, a relationship between a computational complexity of two problems P1 and P2, being in the problem transformation relation, is investigated. A main result of this paper asserts that if P1 is polynomially and homomorphically transformable into P2 and P1 is NP-difficult then P2 is also NP-difficult.


problem of minimal satisfaction of constraints transformation NP-difficulty homomorphism 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aho A.V.,Hopcroft J.E.,Ullman J.D., “The Design and Analysis of Computer Algorithms”, Addison Wesley Publishing Company, 1974.Google Scholar
  2. [2]
    Angluin D., “On the complexity of minimum inference of regular sets”, Inform. Control 39, 337–350, 1978.Google Scholar
  3. [3]
    Garey M.R., Johnson D.S., “Computers and Intractability: A Guide to the Theory of NP-Completeness”, San Francisco, Freeman, 1979.Google Scholar
  4. [4]
    Gold E.M., “ Complexity of automaton identification from given data”, Inform. Control 37, 302–320, 1978.Google Scholar
  5. [5]
    Pfleeger C.P, “State reduction in incompletely specified finite-state machines”, IEEE Trans.Computers C-22, 1099–1102, 1973.Google Scholar
  6. [6]
    Pichler F., “CAST-modelling approaches in engineering design”, Lectures Notes in Computer Science, vol 410, 52–68,1990.Google Scholar
  7. [7]
    Reusch B.,Merznich W., “Minimal coverings for incompletely specified sequential machines”, Acta Informatica, 22, 663–678, 1986.Google Scholar
  8. [8]
    Rich E., “Artificial Intelligence”, McGraw-Hill, New York,1983.Google Scholar
  9. [9]
    Sierocki I., “A description of a set of hypotheses for system identification problem”, Int.J.General Systems, 15, 301–319, 1989.Google Scholar
  10. [10]
    Sierocki I., “A polynomial transformation of the problem of minimal identification of finite automaton”, submitted for publication.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Ireneusz Sierocki
    • 1
  1. 1.Institute of Technical CyberneticsTechnical University of WrocławWrocławPoland

Personalised recommendations