Efficient program synthesis: Semantics, logic, complexity

  • Max I. Kanovich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 526)


The problem of program synthesis is considered.

(1) A computational semantics is introduced for relational knowledge bases. Our semantics naturally arises from practical experience of databases and knowledge bases.

(2) It is stated that the corresponding logic coincides exactly with the intuitionistic one.

(3) Our methods of proof of the general theorems turn out to be very useful for designing new efficient algorithms.

In particular, one can construct a program synthesizer that runs in linear space.

As a corollary, we can explain why there exist programs that solve PSPACE-complete problems “in a reasonable time” despite of their theoretical exponential uniform lower bound.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A.Aho, J.Hopcroft and J.Ullman, The Design and Analysis of Computer Algorithms, (1976).Google Scholar
  2. [2]
    H.Rogers, Theory of Recursive Functions and Effective Computability, (1967).Google Scholar
  3. [3]
    J.D.Ullman, Principles of Database Systems, (1980).Google Scholar
  4. [4]
    M.R.Garey and D.S.Johnson, Computers and Intractability, (1979).Google Scholar
  5. [5]
    G.E. Mints and E.Kh. Tyugu, Propositional logic programming and the PRIZ system. J. Logic Programming, 9, N 2–3 (1990),179–193.Google Scholar
  6. [6]
    I.O.Babaev, S.S.Lavrov et al., Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 29–41. (Russian)Google Scholar
  7. [7]
    A.Ja.Dikovskii, Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 42–51. (Russian)Google Scholar
  8. [8]
    A.Ja. Dikovskii and M.I. Kanovich, Computational models with separable subtasks. Proceedings of Academy of Sci. of USSR, Technical Cybernetics, 5 (1985), 36–60. (Russian)Google Scholar
  9. [9]
    M.I. Kanovich, Quasipolynmial algorithms for recognizing the satisfiability and derivability of propositional formulas. Soviet Mathematics Doklady, 34, N 2 (1987), 273–277.Google Scholar
  10. [10]
    M.I. Kanovich, Efficient program synthesis in computational models. J. Logic Programming, 9, N 2–3 (1990), 159–177.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Max I. Kanovich
    • 1
  1. 1.Tver' State UniversityTver'USSR

Personalised recommendations