Modularity in Logic Programming
- 31 July 1994
- journal article
- Published by Elsevier in The Journal of Logic Programming
- Vol. 19-20, 443-502
- https://doi.org/10.1016/0743-1066(94)90032-9
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Partial deduction for structured logic programmingThe Journal of Logic Programming, 1993
- An extended Warren abstract machine for the execution of structured logic programsThe Journal of Logic Programming, 1992
- A calculus for the construction of modular prolog programsThe Journal of Logic Programming, 1992
- A logical analysis of modules in logic programmingThe Journal of Logic Programming, 1989
- Clausal intuitionistic logic II. tableau proof proceduresThe Journal of Logic Programming, 1988
- Clausal intuitionistic logic I. fixed-point semanticsThe Journal of Logic Programming, 1988
- Enumeration operators and modular logic programmingThe Journal of Logic Programming, 1987
- Login: a logic programming language with built-in inheritanceThe Journal of Logic Programming, 1986
- N-Prolog: An extension of prolog with hypothetical implication. II. Logical foundations, and negation as failureThe Journal of Logic Programming, 1985
- N-Prolog: An extension of Prolog with hypothetical implications. I.The Journal of Logic Programming, 1984