Advertisement

On four logics of programs and complexity of their satisfiability problems : Extended abstract

  • Bogdan S. Chlebus
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 148)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A.K. Chandra, D. Kozen, and L.J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 /1981/, 114–133.Google Scholar
  2. 2.
    B.S. Chlebus, Completeness proofs for some logics of programs, Zeitschr. f. math. Logik und Grundlagen d. Math., to appear.Google Scholar
  3. 3.
    B.S. Chlebus, On the computational complexity of satisfiability in propositional logics of programs, Theoretical Computer Science, to appear.Google Scholar
  4. 4.
    B.S. Chlebus, On the decidability of propositional algorithmic logic, Zeitschr. f. math. Logik und Grundlagen d. Math., to appear.Google Scholar
  5. 5.
    M.J. Fischer and R.E. Ladner, Propositional dynamic logic of regular programs, J. Comput. System Sci. 18/1979/, 194–211.Google Scholar
  6. 6.
    D. Harel, A.R. Meyer and V.R. Pratt, Computability and completeness in logics of programs: preliminary report, 9th ACM Symposium on Theory of Computing /1977/, 261–268.Google Scholar
  7. 7.
    J.E. Hopcroft, and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, 1979.Google Scholar
  8. 8.
    N.D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci. 11 /1975/ 68–85.Google Scholar
  9. 9.
    A. Kreczmar, Effectivity problems of algorithmic logic, Lecture Notes in Computer Science 14 /1974/, 584–600.Google Scholar
  10. 10.
    A.R. Meyer and L.J. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, Proc. 13th Annual IEEE Symposium on Switching and Automata Theory /1972/, 125–129.Google Scholar
  11. 11.
    G. Mirkowska, Algorithmic logic and its applications in the theory of programs, Fund. Inform. 1 /1977/, 147–165.Google Scholar
  12. 12.
    V.R. Pratt, Semantical considerations on Floyd-Hoare logic, 17th IEEE Symposium on the Foundations of Computer Science /1976/, 109–121.Google Scholar
  13. 13.
    V.R. Pratt, A near optimal method for reasoning about action, J. Comput. System Sci. 20 /1980/, 231–254.Google Scholar
  14. 14.
    A. Salwicki, Formalized algorithmic languages, Bull. Acad. Pol. Sci., Ser. Math. 18 /1970/, 227–232.Google Scholar
  15. 15.
    W.J. Savitch, Relationships between nondeterministic tape complexities, J. Comput. System Sci. 4 /1970/, 177–192.Google Scholar
  16. 16.
    J.I. Seiferas, M.I. Fischer and A.R. Meyer, Refinements of the nondeterministic time and space hierarchies, Proc. 14th Annual IEEE Symposium on Switching and Automata Theory /1973/, 130–137.Google Scholar
  17. 17.
    M.K. Valiev, Decision complexity of variants of propositional dynamic logic, Lecture Notes in Computer Science 88 /1980/, 656–664.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1983

Authors and Affiliations

  • Bogdan S. Chlebus
    • 1
  1. 1.Institute of InformaticsWarsaw UniversityWarsawPoland

Personalised recommendations