Volume 39,
Numbers 1-2,
July 1999
- Clemens Ballarin, Lawrence C. Paulson:
A Pragmatic Approach to Extending Provers by Computer Algebra - with Applications to Coding Theory.
1-20
- Belaid Benhamou, Laurent Henocque:
A Hybrid Method for Finite Model Search in Equational Theories.
21-38
- Piergiorgio Bertoli, Jacques Calmet, Fausto Giunchiglia, Karsten Homann:
Specification and Integration of Theorem Provers and Computer Algebra Systems.
39-57
- Uwe Egly, Stephan Schmitt:
On Intuitionistic Proof Transformations, their Complexity, and Application to Constructive Program Synthesis.
59-83
- Stéphane Fèvre, Dongming Wang:
Combining Clifford Algebraic Computing and Term-Rewriting for Geometric Theorem Proving.
85-104
- Melvin Fitting:
On Quantified Modal Logic.
105-121
- Dirk Fuchs:
On the Use of Subgoal Clauses in Bottom-up and Top-down Calculi.
123-143
- Christopher Lynch, Christelle Scharff:
Basic Completion with E-cycle Simplification.
145-165
- Eric Monfroy, Christophe Ringeissen:
An Open Automated Framework for Constraint Solver Extension: the SoleX Approach.
167-187
- Brigitte Pientka, Christoph Kreitz:
Automating Inductive Specification Proofs.
189-209
- J. Rafael Sendra, Franz Winkler:
Algorithms for Rational Real Algebraic Curves.
211-228
Volume 39,
Number 3,
July-August 1999
Volume 39,
Number 4,
September 1999
Copyright © Mon Nov 2 21:36:28 2009
by Michael Ley (ley@uni-trier.de)
