Abstract is missing.
- Practical Advtanages of Declarative ProgrammingJohn W. Lloyd. 18-30
- Analysis and Refinement of Constraint Answer Sets in a Planning SystemMichael Nitsche. 31-45
- Proving termination of Prolog programsPaolo Mascellani, Dino Pedreschi. 46-61
- A Compositional Semantics for Conditional Term Rewriting SystemsMaría Alpuente, Moreno Falaschi, María José Ramis, Germán Vidal. 62-76
- Characterizing Abstract Program Properties by AbductionRoberto Giacobazzi. 77-91
- An Abstract Interpretation Framework for (almost) Full PrologBaudouin Le Charlier, Sabina Rossi, Pascal Van Hentenryck. 92-106
- Semantics of Concurrent Logic Programming as Uniform ProofsPaolo Volpe. 107-124
- El lambda-calculo Etiquetado Paralelo (LCEP)Salvador Lucas, Javier Oliver. 125-139
- Confluence and Concurrent Constraint ProgrammingMoreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi. 140-154
- Split Resolution Tailoring Tableaux to Refute Clause SetsF. Buffoli. 155-169
- An Algebraic Theory of ObservablesMarco Comini, Giorgio Levi. 170-186
- Fixpoint Semantics of L lambdaMaurizio Martelli, Alessandro Messora, Catuscia Palamidessi, Alain Hui-Bon-Hoa. 187-201
- Total correctness of a goal replacement rule based on the unfold/fold proof methodMaurizio Proietti, Alberto Pettorossi. 203-217
- Modular Transformations of CLP ProgramsSandro Etalle, Maurizio Gabbrielli. 218-233
- Towards a Functional Process CalculusK. Bohlmann, Rita Loogen, Yolanda Ortega-Mallén. 234-250
- El modelo RPS para la gestion del paralelismo AND independiente en programas logicosRamiro Varela. 251-265
- Monadas y Procesos Funcionales ComunicantesJosé E. Gallardo, P. Guerrero, Blas C. Ruiz. 266-280
- Methods for Automatic Compile-time Parallelization of Logic Programs: the MEL, CDG and UDG Algorithms RevisitedFrancisco Bueno. 281-295
- Optimizing Logic Programs with Finite Domain ConstraintsNai-Wei Lin. 297-311
- On the Detection of Implicit and Redundant Numeric Constraint in CLP ProgramsRoberto Bagnara. 312-326
- Deriving Polymorphic Type Dependencies for Logic Programs using Multiple Incarnations of PropMichael Codish, Bart Demoen. 327-341
- Granularity Analysis of Concurrent Logic Languages based on Abstract InterpretationMaría-del-Mar Gallardo, José M. Troya. 342-356
- Improving Abstract Interpretations by Systematic Lifting to the PowersetGilberto Filé, Francesco Ranzato. 357-371
- The Quotient of an Abstract Interpretation for Comparing Static AnalysesAgostino Cortesi, Gilberto Filé, William H. Winsborough. 372-387
- Loop Checking for Reduced SLD-derivationsFilomena Ferrucci, Giuliano Pacini, Maria I. Sessa. 388-402
- Solving Systems of Equations over HypersetsAgostino Dovier, Eugenio G. Omodeo, Alberto Policriti, Gianfranco Rossi. 403-417
- Termination is Language-IndependentDino Pedreschi, Salvatore Ruggieri. 418-433
- Semantics for Reasoning with Contradictory Extended Logic ProgramsAnastasia Analyti, Sakti Pramanik. 434-448
- A non-deterministic semantics for ordered logic programsFrancesco Buccafurri, Nicola Leone, Pasquale Rullo. 449-463
- Finite Failure is AND-CompositionalRoberta Gori, Giorgio Levi. 464-478