Electronic Notes in Theoretical Computer Science, Volume 86

Volume 86, Number 1, 2003

• Ingo Dahn, Laurent Vigneron:
  Preface.
  
• Dieter Hutter:
  Deduction as an Engineering Science.
  
• Thomas Hillenbrand:
  Citius altius fortius: Lessons learned from the Theorem Prover WALDMEISTER.
  
• Silvio Ghilardi:
  Quantifier Elimination and Provers Integration.
  
• Cesare Tinelli, Calogero G. Zarba:
  Combining Non-Stably Infinite Theories.
  
• Domenico Cantone, Jacob T. Schwartz, Calogero G. Zarba:
  A Decision Procedure for a Sublanguage of Set Theory Involving Monotone, Additive, and Multiplicative Functions.
  
• Thierry Boy de la Tour, Mnacho Echenim:
  On Leaf Permutative Theories and Occurrence Permutation Groups.
  
• Sébastien Limet, Gernot Salzer:
  Manipulating Tree Tuple Languages by Transforming Logic Programs.
  
• Nicolas Peltier:
  A Resolution-based Model Building Algorithm for a Fragment of OCC1N=.
  
• Silvio Ranise, David Déharbe:
  Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs.
  
• Nachum Dershowitz:
  Canonicity.
  
• Guillaume Feuillade, Thomas Genet:
  Reachability in Conditional Term Rewriting Systems.
  
• Josef Urban:
  MPTP 0.1: System Description.
  
• Abdessamad Imine, Pascal Molli, Gérald Oster, Pascal Urso:
  VOTE: Group Editors Analyzing Tool: System Description.
  
• Hans Zantema, Jan Friso Groote:
  Transforming equality logic to propositional logic.
  
• Mateja Jamnik, Predrag Janicic:
  Learning Strategies for Mechanised Building of Decision Procedures.
  
• Hantao Zhang, Haiou Shen, Felip Manyà:
  Exact Algorithms for MAX-SAT.
  

Volume 86, Number 2, 2003

• Jean-Louis Giavitto, Pierre-Etienne Moreau:
  Preface.
  
• María Alpuente, Santiago Escobar, Salvador Lucas:
  OnDemandOBJ: A Laboratory for Strategy Annotations.
  
• Clara Bertolissi, Horatiu Cirstea, Claude Kirchner:
  Translating Combinatory Reduction Systems into the Rewriting Calculus.
  
• Sebastian Brand, Eric Monfroy:
  Deductive Generation of Constraint Propagation Rules.
  
• Julien Cohen:
  Typing rule-based transformations over topological collections.
  
• Anamaria Martins Moreira, Christophe Ringeissen, Anderson Santana:
  A Tool Support for Reusing ELAN Rule-Based Components.
  
• María Alpuente, Santiago Escobar, Salvador Lucas:
  On-demand Evaluation by Program Transformation.
  
• Otto Skrove Bagge, Magne Haveraaen:
  Domain-Specific Optimisation with User-Defined Rules in CodeBoost.
  
• Radoslaw Karwowski, Przemyslaw Prusinkiewicz:
  Design and Implementation of the L+C Modeling Language.
  

Volume 86, Number 3, 2003

• Germán Vidal:
  Preface.
  
• Jan Maluszynski:
  On integrating rules into the Semantic Web.
  
• Michaël Rusinowitch:
  Automated analysis of security protocols.
  
• Andrew P. Tolmach, Sergio Antoy:
  A monadic semantics for core Curry.
  
• Michael Hanus, Klaus Höppner, Frank Huch:
  Towards translating embedded Curry to C.
  
• Naoki Nishida, Masahiko Sakai, Toshiki Sakabe:
  Narrowing-based simulation of term rewriting systems with extra variables.
  
• Alcino Cunha:
  Automatic visualization of recursion trees: a case study on generic programming.
  
• Demis Ballis, Moreno Falaschi, César Ferri, José Hernández-Orallo, M. José Ramírez-Quintana:
  Cost-sensitive diagnosis of declarative programs.
  
• María Alpuente, Demis Ballis, Santiago Escobar, Moreno Falaschi, Salvador Lucas:
  Abstract correction of first-order functional programs.
  
• Francisco Javier López-Fraguas, Jaime Sánchez-Hernández:
  Failure and equality in functional logic programming.
  
• Ginés Moreno:
  A narrowing-based instantiation rule for rewriting-based fold/unfold transformations.
  
• Jesús Manuel Almendros-Jiménez, Antonio Becerra-Terón:
  A safe relational calculus for functional logic deductive databases.
  

Volume 86, Number 4, 2003

• Bernhard Gramlich, Salvador Lucas:
  3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings.
  
• Manuel Clavel:
  Strategies and user interfaces in Maude at work.
  
• Horatiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack:
  Rewrite strategies in the rewriting calculus.
  
• Jorge Sousa Pinto:
  Weak reduction and garbage collection in interaction nets.
  
• Jürgen Giesl, Hans Zantema:
  Simulating liveness by reduction strategies.
  
• Stéphane Lengrand:
  Call-by-value, call-by-name, and strong normalization for the classical sequent calculus.
  
• Monica Nesi, Giuseppina Rucci, Massimo Verdesca:
  A rewriting strategy for protocol verification.
  
• Mizuhito Ogawa:
  Call-by-need reduction for membership conditional term rewriting Systems.