Abstract is missing.
- Towards Scalable Partial Evaluation of Declarative ProgramsGermán Vidal. 1-4 [doi]
- Deciding Full Branching Time Logic by Program TransformationAlberto Pettorossi, Maurizio Proietti, Valerio Senni. 5-21 [doi]
- A Transformational Approach for Proving Properties of the CHR Constraint StorePaolo Pilozzi, Tom Schrijvers, Maurice Bruynooghe. 22-36 [doi]
- The Dependency Triple Framework for Termination of Logic ProgramsPeter Schneider-Kamp, Jürgen Giesl, Manh Thang Nguyen. 37-51 [doi]
- Goal-Directed and Relative Dependency Pairs for Proving the Termination of NarrowingJosé Iborra, Naoki Nishida, Germán Vidal. 52-66 [doi]
- LP with Flexible Grouping and Aggregates Using ModesMarcin Czenko, Sandro Etalle. 67-81 [doi]
- On Inductive and Coinductive Proofs via Unfold/Fold TransformationsHirohisa Seki. 82-96 [doi]
- Coinductive Logic Programming with NegationRichard Min, Gopal Gupta. 97-112 [doi]
- Refining Exceptions in Four-Valued LogicSusumu Nishimura. 113-127 [doi]
- Towards a Framework for Constraint-Based Test Case GenerationFrançois Degrave, Tom Schrijvers, Wim Vanhoof. 128-142 [doi]
- Using Rewrite Strategies for Testing BUpL AgentsLacramioara Astefanoaei, Frank S. de Boer, M. Birna van Riemsdijk. 143-157 [doi]
- Towards Just-In-Time Partial Evaluation of PrologCarl Friedrich Bolz, Michael Leuschel, Armin Rigo. 158-172 [doi]
- Program Parallelization Using Synchronized PipeliningLeonardo Scandolo, César Kunz, Manuel V. Hermenegildo. 173-187 [doi]
- Defining Datalog in Rewriting LogicMaría Alpuente, Marco A. Feliú, Christophe Joubert, Alicia Villanueva. 188-204 [doi]