Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 121
Number of items: 121
  • Kalsbeek, M. B. (1995). Meta-Logics for Logic Programming. [Thesis, fully internal, Universiteit van Amsterdam].
  • Open Access
    Apt, K. R., van Emde Boas, P., & Welling, A. (1995). The STO problem is NP-Hard. Journal of Symbolic Computation, 18, 489-495. https://doi.org/10.1006/jsco.1994.1060
  • Apt, K. R., Marchiori, E., & Palamidessi, C. (1994). A declarative approach for first-order built-in's of Prolog. Applicable Algebra in Engineering, Communication and Computing, 5(3/4), 159-191. https://doi.org/10.1007/BF01190828
  • Apt, K. R., & Gabbrielli, M. (1994). Declarative Interpretations Reconsidered. In P. van Hentenryck (Ed.), ICLP94 (pp. 74-89). MIT Press.
  • Apt, K. R., & Pedreschi, D. (1994). Modular Termination Proofs for Logic and Pure Prolog Programs. In G. Levi (Ed.), Advances in Logic Programming Theory (pp. 183-229). Oxford University Press.
  • Apt, K. R., & Olderog, E. R. (1994). Programmverifikation. Springer Verlag.
  • Apt, K. R., Schrijver, A., & Temme, N. (1994). From Universal Morphisms to Megabytes: A Baayen Space Odyssey. CWI.
  • Open Access
    Apt, K. R., & Pellegrini, A. (1994). On the occur-check free Prolog programs. ACM Transactions on Programming Languages and Systems, 16(3), 687-726. https://doi.org/10.1145/177492.177673
  • Open Access
    Apt, K. R., & Doets, H. C. (1994). A new definition of SLDNF-resolution. Journal of Logic Programming, 18(2), 177-190. https://doi.org/10.1016/0743-1066(94)90051-5
  • Open Access
    Apt, K. R., & Marchiori, E. (1994). Reasoning about Prolog Programs: from Modes through Types to Assertions. Formal Aspects of Computing, 6(6A), 743-765.
Page 12 of 13