Abstract is missing.
- Analysis of Logic Programs Using Regular Tree Languages - (Extended Abstract)John P. Gallagher. 1-3 [doi]
- Dynamic Symbolic Computation for Domain-Specific Language ImplementationFritz Henglein. 4-24 [doi]
- Resource-Driven CLP-Based Test Case GenerationElvira Albert, Miguel Gómez-Zamalloa, José Miguel Rojas. 25-41 [doi]
- A Declarative Embedding of XQuery in a Functional-Logic LanguageJesús Manuel Almendros-Jiménez, Rafael Caballero, Yolanda García-Ruiz, Fernando Sáenz-Pérez. 42-56 [doi]
- Automata-Based Computation of Temporal Equilibrium ModelsPedro Cabalar, Stéphane Demri. 57-72 [doi]
- Simplifying Questions in Maude Declarative Debugger by Transforming Proof TreesRafael Caballero, Adrián Riesco, Alberto Verdejo, Narciso Martí-Oliet. 73-89 [doi]
- Clones in Logic Programs and How to Detect ThemCeline Dandois, Wim Vanhoof. 90-105 [doi]
- Using Real Relaxations during Program SpecializationFabio Fioravanti, Alberto Pettorossi, Maurizio Proietti, Valerio Senni. 106-122 [doi]
- Marker-Directed Optimization of UnCAL Graph TransformationsSoichiro Hidaka, Zhenjiang Hu, Kazuhiro Inaba, Hiroyuki Kato, Kazutaka Matsuda, Keisuke Nakano, Isao Sasano. 123-138 [doi]
- Modular Extensions for Modular (Logic) LanguagesJosé F. Morales, Manuel V. Hermenegildo, Rémy Haemmerlé. 139-154 [doi]
- Meta-predicate SemanticsPaulo Moura. 155-172 [doi]
- A Strategy Language for Graph RewritingMaribel Fernández, Hélène Kirchner, Olivier Namet. 173-188 [doi]
- Improved Termination Analysis of CHR Using Self-sustainability AnalysisPaolo Pilozzi, Danny De Schreye. 189-204 [doi]
- Proving Properties of Co-Logic Programs by Unfold/Fold TransformationsHirohisa Seki. 205-220 [doi]
- Probabilistic Termination of CHRiSM ProgramsJon Sneyers, Danny De Schreye. 221-236 [doi]
- A Linear Operational Semantics for Termination and Complexity Analysis of ISO PrologThomas Ströder, Fabian Emmes, Peter Schneider-Kamp, Jürgen Giesl, Carsten Fuhs. 237-252 [doi]