![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Logic Programming, Volume 14
Volume 14, Numbers 1&2, October 1992
- Marianne Baudinet:
Proving Termination Properties of Prolog Programs: A Semantic Approach. 1-29 - Philip W. Dart, Justin Zobel:
Efficient Run-Time Type Checking of Typed Logic Programs. 31-69 - Jieh Hsiang, Hélène Kirchner, Pierre Lescanne, Michaël Rusinowitch:
The Term Rewriting Approach to Automated Theorem Proving. 71-99 - Sumit Ganguly, Abraham Silberschatz, Shalom Tsur:
Parallel Bottom-Up Processing of Datalog Queries. 101-126 - Raymond Reiter:
What Should a Database Know? 127-153 - Maria Paola Bonacina
, Jieh Hsiang
:
On Rewrite Programs: Semantics and Relationship with Prolog. 155-180 - Dimiter Skordev
:
Short Note: On Van Gelder's Loop Detection Algorithm. 181-183 - Allen Van Gelder:
Short Note: Van Gelder's Response. 185
Volume 14, Numbers 3&4, November 1992
- Evelina Lamma, Paola Mello, Antonio Natali:
An Extended Warren Abstract Machine for the Execution of Structured Logic Programs. 187-222 - Yannis E. Ioannidis:
Commutativity and its Role in the Processing of Linear Recursion. 223-252 - H. Lewis Chau, Douglas Stott Parker Jr.:
Narrowing Grammar: Theory, Implementation, and Applications. 253-286 - H. Albert Lilly, Barrett R. Bryant:
A Prescribed Cut for Prolog that Ensures Soundness. 287-339 - Antonis C. Kakas
, Paolo Mancarella:
Short Note: Preferred Extensions are Partial Stable Models. 341-348
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.