Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 121
Number of items: 121
  • Apt, K. R., & Ben-Eliyahu, R. (1996). Meta-variables in Logic Programming, or in Praise of Ambivalent Syntax. Fundamenta Informaticae, 28(1&2), 23-3.
  • Apt, K. R., & Schaerf, A. (1996). Search and Imperative Programming. (Technical Report; No. CS-R9645). CWI.
  • Teusink, F. J. M. (1996). Non-monotonic reasoning via Logic Programming. [Thesis, externally prepared, Universiteit van Amsterdam]. UvA.
  • Open Access
    Apt, K. R., Gabbrielli, M., & Pedreschi, D. (1996). A closer look at declarative interpretations. Journal of Logic Programming, 28(2), 147-180. https://doi.org/10.1016/0743-1066(95)00150-6
  • Open Access
    Apt, K. R. (1996). Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming. Science of Computer Programming, 26(1-3), 133-148. https://doi.org/10.1016/0167-6423(95)00020-8
  • Apt, K. R., & Turini, F. (1995). Meta-logics and Logic Programming. The MIT Press.
  • Apt, K. R., & Luitjes, I. (1995). Verification of Logic Programs with Delay Declarations. In M. Nivat, & V. S. Alagar (Eds.), Proceedings of the Fourth International Conference on Algebraic Methodology and Software Technology (AMAST'95) (pp. 66-90). (Lecture Notes in Computer Science; No. 936). Springer-Verlag.
  • Apt, K. R., & Teusink, F. (1995). Comparing negation in logic programming and in Prolog. In F. Turini, & K. R. Apt (Eds.), Meta-logics and Logic Programming (pp. 111-133). The MIT Press.
  • Apt, K. R. (1995). Arrays, Bounded Quantification and Iteration in Logic and Constraint Logic Programming. In M. I. Sessa, & M. Alpuente Frasnedo (Eds.), 1995 Joint Conference on Declarative Programming (GULP-PRODE '95) (pp. 19-35). University of Salerno, Italy.
  • Etalle, S. (1995). Transformation and Analysis of (Constraint) Logic Programs. [Thesis, externally prepared, Universiteit van Amsterdam].
Page 11 of 13