Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
A.Aho, J.Hopcroft and J.Ullman, The Design and Analysis of Computer Algorithms, (1976).
H.Rogers, Theory of Recursive Functions and Effective Computability, (1967).
J.D.Ullman, Principles of Database Systems, (1980).
M.R.Garey and D.S.Johnson, Computers and Intractability, (1979).
G.E. Mints and E.Kh. Tyugu, Propositional logic programming and the PRIZ system. J. Logic Programming, 9, N 2–3 (1990),179–193.
I.O.Babaev, S.S.Lavrov et al., Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 29–41. (Russian)
A.Ja.Dikovskii, Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 42–51. (Russian)
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)
M.I. Kanovich, Quasipolynmial algorithms for recognizing the satisfiability and derivability of propositional formulas. Soviet Mathematics Doklady, 34, N 2 (1987), 273–277.
M.I. Kanovich, Efficient program synthesis in computational models. J. Logic Programming, 9, N 2–3 (1990), 159–177.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kanovich, M.I. (1991). Efficient program synthesis: Semantics, logic, complexity. In: Ito, T., Meyer, A.R. (eds) Theoretical Aspects of Computer Software. TACS 1991. Lecture Notes in Computer Science, vol 526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54415-1_67
Download citation
DOI: https://doi.org/10.1007/3-540-54415-1_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54415-9
Online ISBN: 978-3-540-47617-7
eBook Packages: Springer Book Archive