default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic Programming, Volume 7
Volume 7, Number 1, July 1989
- Daniele Nardi
:
Formal Synthesis of a Unification Algorithm by the Deductive-Tableau Method. 1-43 - Giorgio Gallo, Giampaolo Urbani:
Algorithms for Testing the Satisfiability of Propositional Formulae. 45-61 - Lee Naish:
Proving Properties of Committed Choice Logic Programs. 63-84
Volume 7, Number 2, September 1989
- Avshalom Houri, Ehud Shapiro:
A Sequential Abstract Machine for Flat Concurrent Prolog. 85-123 - Andrzej Ciepielewski, Seif Haridi, Bogumil Hausman:
Or-Parallel Prolog on Shared Memory Multiprocessors. 125-148 - Saumya K. Debray:
Flow Analysis of Dynamic Logic Programs. 149-176
Volume 7, Number 3, November 1989
- Lawrence Cavedon, John W. Lloyd:
A Completeness Theorem for SLDNF Resolution. 177-191 - Timothy J. Hickey, Shyam Mudambi:
Global Compilation of Prolog. 193-230 - Kenneth Kunen:
Signed Data Dependencies in Logic Programs. 231-245
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.
last updated on 2025-02-27 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
