RDP'03 - Federated Conference on Rewriting, Deduction and Programming 2003
RDP'03 Home Page

Volume 86, Number 1, 2003

FTP'03, 4th International Workshop on First-Order Theorem Proving
June 2003
FTP'03 Home Page

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

Volume 86, Number 2, 2003

RULE'03, 4th International Workshop on rule-Based Programming
June 2003
RULE'03 Home Page

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

Volume 86, Number 3, 2003

WFLP'03, 12th International Workshop on Functional and Constraint Logic Programming
June 2003
WFLP'03 Home Page

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

Volume 86, Number 4, 2003

WRS 2003

• 
  Bernhard Gramlich, Salvador Lucas: Preface: 3rd International Workshop on Reduction Strategies in Rewriting and Programming (WRS 2003) - Final Proceedings. 567-569
• 
  Manuel Clavel: Strategies and user interfaces in Maude at work. 570-592
• 
  Horatiu Cirstea, Claude Kirchner, Luigi Liquori, Benjamin Wack: Rewrite strategies in the rewriting calculus. 593-624
• 
  Jorge Sousa Pinto: Weak reduction and garbage collection in interaction nets. 625-640
• 
  Jürgen Giesl, Hans Zantema: Simulating liveness by reduction strategies. 641-656
• 
  Monica Nesi, Giuseppina Rucci, Massimo Verdesca: A rewriting strategy for protocol verification. 657-672
• 
  Mizuhito Ogawa: Call-by-need reduction for membership conditional term rewriting Systems. 673-688
• 
  Zurab Khasidashvili, John R. W. Glauert: An Abstract Concept of Optimal Implementation. 689-713
• 
  Stéphane Lengrand: Call-by-value, call-by-name, and strong normalization for the classical sequent calculus. 714-730