


default search action
Theory and Practice of Logic Programming (TPLP), Volume 1
Volume 1, Number 1, January 2001
- John Alan Robinson:

Invited editorial. 1 - Jack Minker:

Editorial (by the Editor in Chief). 3-4
- Laks V. S. Lakshmanan, Fereidoon Sadri:

On a theory of probabilistic deductive databases. 5-42 - Sergio Flesca, Sergio Greco:

Declarative semantics for active rules. 43-69 - Yi-Dong Shen, Li-Yan Yuan, Jia-Huai You, Neng-Fa Zhou:

Linear tabulated resolution based on Prolog control strategy. 71-103
- Elisa Bertino, Barbara Catania, Roberta Gori:

Enhancing the expressive power of the U-Datalog language. 105-122
- Femke van Raamsdonk:

Book Review - Logic in Computer Science: Modelling and Reasoning about Systems by Michael R. A. Huth and Mark D. Ryan, Cambridge University Press, 2000, ISBN 0521652006, (hardback), ISBN 0521656028, (paperback). 123-125
Volume 1, Number 2, March 2001
- Jorge Lobo, Gisela Mendez, Stuart R. Taylor:

Knowledge and the Action Description Language A. 129-184 - Puri Arenas-Sánchez, Mario Rodríguez-Artalejo:

A General Framework for Lazy Functional Logic, Programming with Algebraic Polymorphic Types. 185-245
Volume 1, Number 3, May 2001
- Leon Sterling, Lee Naish, Manuel V. Hermenegildo:

Guest editor's introduction Special issue on Logic Programming and the Internet. 249-250 - Daniel Cabeza Gras, Manuel V. Hermenegildo:

Distributed WWW Programming using (Ciao-)Prolog and the PiLLoW library. 251-282 - Keith L. Clark, Peter J. Robinson, Richard Hagen:

Multi-threading and Message Communication in Qu-Prolog. 283-301 - Thom W. Frühwirth, Slim Abdennadher:

The Munich Rent Advisor: A Success for Logic Programming on the Internet. 303-319 - Seng Wai Loke, Andrew Davison:

Secure Prolog Based Mobile Code. 321-357 - Paul Tarau, Verónica Dahl:

High-Level Networking with Mobile Code and First Order AND-Continuations. 359-380
Volume 1, Number 4, July 2001
- Sergio Greco

, Carlo Zaniolo:
Greedy Algorithms in Datalog. 381-407 - Jan-Georg Smaus, Patricia M. Hill, Andy King:

Verifying Termination and Error-Freedom of Logic Programs with block Declarations. 447-486 - Javier Leach, Susana Nieva

, Mario Rodríguez-Artalejo:
Constraint Logic Programming with Hereditary Harrop Formula. 409-445
- Hudson Turner:

Order-consistent programs are cautiously monotonic. 487-495
Volume 1, Number 5, September 2001
- Stefan Brass, Jürgen Dix, Burkhard Freitag, Ulrich Zukowski:

Transformation-based bottom-up computation of the well-founded model. 497-538 - Filomena Ferrucci

, Giuliano Pacini, Maria I. Sessa:
On redundancy elimination tolerant scheduling rules. 539-590 - Zbigniew Lonc

, Miroslaw Truszczynski:
On the problem of computing the well-founded semantics. 591-609
- Samir Genaim

, Jacob M. Howe, Michael Codish
:
Worst-case groundness analysis using definite boolean functions. 611-615
- Richard A. O'Keefe:

O(1) reversible tree navigation without cycle. 617-630
Volume 1, Number 6, November 2001
- Frédéric Benhamou, Pascal Van Hentenryck:

In honor of Alain Colmerauer's 60th birthday. Theory Pract. Log. Program. 1(6): 633-635 (2001) - Jacques Cohen:

A Tribute to Alain Colmerauer. 637-646 - Roberto Bruni

, Ugo Montanari, Francesca Rossi:
An interactive semantics of logic programming. 647-690 - Michael J. Maher:

Propositional Defeasible Logic has Linear Complexity. 691-711 - Krzysztof R. Apt, Éric Monfroy:

Constraint programming viewed as rule-based programming. 713-750 - François Fages, Emmanuel Coquery:

Typing constraint logic programs. 751-777 - Yves Caseau, Glenn Silverstein, François Laburthe:

Learning Hybrid Algorithms for Vehicle Routing Problems. Theory Pract. Log. Program. 1(6): 779-806 (2001) - A short bibliography of Alain Colmerauer. Theory Pract. Log. Program. 1(6): 807-809 (2001)

- PhD theses surpervised by Alain Colmerauer. Theory Pract. Log. Program. 1(6): 811-813 (2001)


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














