On the Computational Complexity of Prolog Programs

@article{Dikovsky1993OnTC,
  title={On the Computational Complexity of Prolog Programs},
  author={Alexandre Ja. Dikovsky},
  journal={Theor. Comput. Sci.},
  year={1993},
  volume={119},
  pages={63-102}
}
Time and space complexity of Prolog programs is investigated in simplest Prolog subclasses: kernel Prokq (no structures, no built-ins), kernel dynamic Prolog (dynamic clauses control operators allowed), .pat Pro& (the subset of kernel Prolog with no lists) and pat dynamic Prolog (the corresponding subset of kernel dynamic Prolog. Even in flat Prolog the problem of solution existence needs exponential time. A new operational semantics of Prolog is introduced which allows measuring practical time… CONTINUE READING
3 Citations
5 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Gavrilenko , Applications of Cooper algebras to the theory of tail recursion in logic programming ( Russian )

  • Yu.
  • Soaiet Math . Dokl .
  • 1990

Gavrilenko , Recursion and iteration on Cooper algebras ( Russian ) Soviet Math

  • Yu.
  • Dokl .
  • 1990

Recursion and iteration on Cooper algebras (Russian

  • Yu. Gavrilenko
  • Soviet Math. Dokl
  • 1990

Foundations qf‘ Logic Programming

  • J. W. Lloyd
  • in: Proc. Internat. Congress qf Mathematicians…
  • 1984

Similar Papers

Loading similar papers…