- Fausto Spoto:
Operational and Goal-Independent Denotational Semantics for Prolog with Cut. J. Log. Program. 42(1): 1-46 (2000) - Vasilis Vassalos, Yannis Papakonstantinou:
Expressive Capabilities Description Languages and Query Rewriting Algorithms. J. Log. Program. 43(1): 75-122 (2000) - Sofie Verbaeten, Marc Denecker, Danny De Schreye:
Compositionality of Normal Open Logic Programs. J. Log. Program. 42(3): 151-183 (2000) - Kewen Wang:
Argumentation-based abduction in disjunctive logic programming. J. Log. Program. 45(1-3): 105-141 (2000) - Jia-Huai You, Li-Yan Yuan, Randy Goebel:
An abductive approach to disjunctive logic programming. J. Log. Program. 44(1-3): 101-127 (2000) - Jianyang Zhou:
Introduction to the constraint language NCL. J. Log. Program. 45(1-3): 71-103 (2000) - 1999
- Catherine Belleannée, Pascal Brisset, Olivier Ridoux:
A Pragmatic Reconstruction of lambda-Prolog. J. Log. Program. 41(1): 67-102 (1999) - Peter A. Bigot, Saumya K. Debray:
Return Value Placement and Tail Call Optimization in High Level Languages. J. Log. Program. 38(1): 1-29 (1999) - Annalisa Bossi, Yves Deville:
Guest Editors' Introduction Special Issue: Synthesis, Transformation and Analysis of Logic Rrograms 2. J. Log. Program. 41(2-3): 139-140 (1999) - Henrik Boström, Peter Idestam-Almquist:
Induction of Logic Programs by Example-Guided Unfolding. J. Log. Program. 40(2-3): 159-183 (1999) - Stefan Brass, Jürgen Dix:
Semantics of (disjunctive) Logic Programs Based on Partial Evaluation. J. Log. Program. 40(1): 1-46 (1999) - Iliano Cervesato, Angelo Montanari:
A General Modal Framework for the Event Calculus and Its Skeptical and Credulous Variants. J. Log. Program. 38(2): 111-164 (1999) - Baudouin Le Charlier, Christophe Leclère, Sabina Rossi, Agostino Cortesi:
Automated Verification of Prolog Programs. J. Log. Program. 39(1-3): 3-42 (1999) - Pawel Cholewinski, Miroslaw Truszczynski:
Extremal Problems in Logic Programming and Stable Model Computation. J. Log. Program. 38(2): 219-242 (1999) - Michael Codish:
Efficient Goal Directed Bottom-Up Evaluation of Logic Programs. J. Log. Program. 38(3): 355-370 (1999) - Michael Codish:
Worst-Case Groundness Analysis Using Positive Boolean Functions. J. Log. Program. 41(1): 125-128 (1999) - Michael Codish, Cohavit Taboch:
A Semantic Basis for the Termination Analysis of Logic Programs. J. Log. Program. 41(1): 103-123 (1999) - Marco Comini, Giorgio Levi, Maria Chiara Meo, Giuliana Vitiello:
Abstract Diagnosis. J. Log. Program. 39(1-3): 43-93 (1999) - Agostino Cortesi, Gilberto Filé:
Sharing is Optimal. J. Log. Program. 38(3): 371-386 (1999) - Mireille Ducassé:
Opium: An Extendable Trace Analyzer for Prolog. J. Log. Program. 39(1-3): 177-223 (1999) - Birgit Elbl:
A Declarative Semantics for Depth-First Logic Programs. J. Log. Program. 41(1): 27-66 (1999) - Joeri Engelfriet, Heinrich Herre:
Stable Generated Models, Partial Temporal Logic and Disjunctive Defaults. J. Log. Program. 41(1): 1-25 (1999) - Sandro Etalle, Annalisa Bossi, Nicoletta Cocco:
Termination of Well-Moded Programs. J. Log. Program. 38(2): 243-257 (1999) - Sandro Etalle, Maurizio Gabbrielli:
Layered Modes. J. Log. Program. 39(1-3): 225-244 (1999) - Pierre Flener, Serap Yilmaz:
Inductive Synthesis of Recursive Logic Programs: Achievements and Prospects. J. Log. Program. 41(2-3): 141-195 (1999) - Juan Carlos González Moreno, Maria Teresa Hortalá-González, Francisco Javier López-Fraguas, Mario Rodríguez-Artalejo:
An Approach to Declarative Programming Based on a Rewriting Logic. J. Log. Program. 40(1): 47-87 (1999) - Russell Greiner:
The Complexity of Revising Logic Programs. J. Log. Program. 40(2-3): 273-298 (1999) - Bharat Jayaraman, Jana Devashis:
Set Constructors, Finite Sets, and Logical Semantics. J. Log. Program. 38(1): 55-77 (1999) - Evelina Lamma, Michela Milano, Paola Mello:
Reasoning on Constraints in CLP(FD). J. Log. Program. 38(1): 93-110 (1999) - Kung-Kiu Lau, Mario Ornaghi, Sten-Åke Tärnlund:
Steadfast Logic Programs. J. Log. Program. 38(3): 259-294 (1999)