


default search action
Journal of Logic Programming, Volume 13
Volume 13, Number 1, May 1992
- Kenneth A. Ross:

A Prodedural Semantics for Well-Founded Negation in Logic Programs. 1-22 - John V. Tucker, Jeffery I. Zucker:

Deterministic and Nondeterministic Computation and Horn Programs, on Abstract Data Types. 23-55 - Saumya K. Debray:

A Simple Code Improvement Scheme for Prolog. 57-88 - Akihiro Yamamoto:

Short Note: Procedural Semantics and Negative Information of Elementary Formal System. 89-97
Volume 13, Numbers 2&3, July 1992
- Saumya K. Debray:

Guest Editor's Introduction. 99-101 - Patrick Cousot, Radhia Cousot:

Abstract Interpretation and Application to Logic Programs. 103-179 - Kim Marriott, Harald Søndergaard

:
Bottom-Up Dataflow Analysis of Normal Logic Programs. 181-204 - Gerda Janssens, Maurice Bruynooghe:

Deriving Descriptions of Possible Values of Program Variables by Means of Abstract Interpretation. 205-258 - William H. Winsborough:

Multiple Specialization using Minimal-Function Graph Semantics. 259-290 - Dean Jacobs, Anno Langen:

Static Analysis of Logic Programs for Independent And-Parallelism. 291-314 - Kalyan Muthukumar, Manuel V. Hermenegildo

:
Compile-Time Derivation of Variable Dependency Using Abstract Interpretation. 315-347
Volume 13, Number 4, August 1992
- Manuel V. Hermenegildo

, Richard A. Warren, Saumya K. Debray:
Global Flow Analysis as a Practical Compilation Tool. 349-366 - David M. Russinoff:

A Verified Prolog Compiler for the Warren Abstract Machine. 367-412 - Mehmet A. Orgun

, William W. Wadge:
Towards a Unified Theory of Intensional Logic Programming. 413-440

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














