Journal of Automated Reasoning (JAR), Volume 34

Volume 34, Number 1, January 2005

• Calogero G. Zarba:
  Combining Sets with Cardinals. 1-29
  
• Anja Remshagen, Klaus Truemper:
  An Effective Algorithm for the Futile Questioning Problem. 31-47
  
• Domenico Cantone, Calogero G. Zarba, Rosa Ruggeri Cannata:
  A Tableau-Based Decision Procedure for a Fragment of Set Theory with Iterated Membership. 49-72
  
• Bernard Jurkowiak, Chu Min Li, Gil Utard:
  A Parallelization Scheme Based on Work Stealing for a Class of SAT Solvers. 73-101
  

Volume 34, Number 2, December 2005

• Jürgen Giesl, Deepak Kapur:
  Preface. 103-104
  
• Hans Zantema:
  Termination of String Rewriting Proved Automatically. 105-139
  
• Alexander Serebrenik, Danny De Schreye:
  Termination of Floating-Point Computations. 141-177
  
• Brigitte Pientka:
  Verifying Termination and Reduction Properties about Higher-Order Logic Programs. 179-207
  

Volume 34, Number 3, April 2005

• Cesare Tinelli, Calogero G. Zarba:
  Combining Nonstably Infinite Theories. 209-238
  
• Konstantine Arkoudas:
  Simplifying Proofs in Fitch-Style Natural Deduction Systems. 239-294
  
• M. Carmen Fernández Gago, Ullrich Hustadt, Clare Dixon, Michael Fisher, Boris Konev:
  First-Order Temporal Verification in Practice. 295-321
  

Volume 34, Number 4, May 2005

• Jürgen Giesl, Deepak Kapur:
  Preface. 323
  
• Evelyne Contejean, Claude Marché, Ana Paula Tomás, Xavier Urbain:
  Mechanically Proving Termination Using Polynomial Interpretations. 325-363
  
• Alfons Geser, Dieter Hofbauer, Johannes Waldmann:
  Termination Proofs for String Rewriting Systems via Inverse Match-Bounds. 365-385
  
• Panagiotis Manolios, Daron Vroon:
  Ordinal Arithmetic: Algorithms and Mechanization. 387-423