Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic Programming, Volume 18
Volume 18, Number 1, January 1994
- Kerima Benkerimi, John C. Shepherdson:
Partial Deduction of Updateable Definite Logic Programs. 1-26 - Kenneth A. Ross:
On Negation in HiLog. 27-53 - Jonas Barklund, Andreas Hamfelt:
Hierarchical Representation of Legal Knowledge with Metaprogramming in Logic. 55-80 - Eberhard Bertsch:
On the Relationship between Indexed Grammars and Logic Programs. 81-98
Volume 18, Number 2, February 1994
- Ritu Chadha, David A. Plaisted:
Correctness of Unification Without Occur Check in Prolog. 99-122 - Christoph Beierle, Gregor Meyer:
Run-Time Type Computations in the Warren Abstract Machine. 123-148 - Saumya K. Debray, Raghu Ramakrishnan:
Abstract Interpretation of Logic Programs using Magic Transformations. 149-176 - Krzysztof R. Apt, Kees Doets:
A New Definition of SNDNF-Resolution. 177-190
Volume 18, Number 3, April 1994
- Katsumi Inoue
:
Hypothetical Reasoning in Logic Programs. 191-227 - Gert Smolka, Ralf Treinen:
Records for Logic Programming. 229-258
a service of 
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 2024-04-16 20:19 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
