


default search action
Journal of Logic Programming, Volume 11
Volume 11, Numbers 1&2, July 1991
- Larry Wos, William McCune:

Automated Theorem Proving and Logic Programming. 1-53 - Laxmikant V. Kalé:

The Reduce-Or Process Model for Parallel Execution of Logic Programs. 55-84 - Pier Giorgio Bosco, Elio Giovannetti, Corrado Moiso, Catuscia Palamidessi

:
Comments on "Logic-Programming with Equations". 85-89 - Melvin Fitting:

Bilattices and the Semantics of Logic Programming. 91-116 - Malik Ghallab, Gonzalo Escalada-Imaz:

A Linear Control Algorithm for a Class of Rule-Based Systems. 117-132 - Evan Tick:

Memory- and Buffer-Referencing Characteristics of a WAM-Based Prolog. 133-162 - Philip W. Dart:

On Derived Dependencies and Connected Databases. 163-188
Volume 11, Numbers 3&4, October/November 1991
- Raghu Ramakrishnan:

Magic Templates: A Spellbinding Approach To Logic Programs. 189-216 - John W. Lloyd, John C. Shepherdson:

Partial Evaluation in Logic Programming. 217-242 - Jonathan S. Ostroff:

Constraint Logic Programming for Reasoning About Discrete Event Processes. 243-270 - Matthew L. Ginsberg:

Negative Subgoals with Free Variables. 271-293 - Isaac Balbin, Graeme S. Port, Kotagiri Ramamohanarao, Krishnamurthy Meenakshi:

Efficient Bottom-UP Computation of Queries on Stratified Databases. 295-344 - Ouri Wolfson

, Abraham Silberschatz:
Decomposability and its Role in Parallel Logic Program Evaluation. 345-358 - John C. Shepherdson:

Correct Answers to Allowed Programs and Queries are Ground. 359-362

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














