default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic Programming, Volume 34
Volume 34, Number 1, January 1998
- M. R. K. Krishna Rao, Deepak Kapur, R. K. Shyamasundar:
Transformational Methodology for Proving Termination of Logic Programs. 1-41
- Xining Li:
A New Term Representation Method for Prolog. 43-57 - Jean-Jacques Hébrard, Philippe Luquet:
The Horn Basis of a Set of Clauses. 59-66
Volume 34, Number 2, February 1998
- Roland N. Bol, Lars Degerstedt:
Tabulated Resolution for the Well-Founded Semantics. 67-109 - Marc Denecker
, Danny De Schreye:
SLDNFA: An Abductive Procedure for Abductive Logic Programs. 111-167
Volume 34, Number 3, March 1998
- Ilyas Cicekli:
Abstract Metaprolog Engine. 169-199 - Patrick R. J. van der Laag, Shan-Hwei Nienhuys-Cheng:
Completeness and Properness of Refinement Operators in Inductive Logic Programming. 201-225 - David A. Rosenblueth, Julio C. Peralta:
SLR Inference an Inference System for Fixed-Mode Logic Programs Based on SLR Parsing. 227-259
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 2026-08-25 22:06 CEST 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
