Journal of Automated Reasoning (JAR)
, Volume 22
Volume 22, Number 1, January 1999
Larry Wos
,
Gail W. Pieper
: The Hot List Strategy. 1-44
BibTeX
Frieder Stolzenburg
: An Algorithm for General Set Unification and Its Complexity. 45-63
BibTeX
Peter Madden
,
Alan Bundy
,
Alan Smaill
: Recursive Program Optimization Through Inductive Synthesis Proof Transformation. 65-115
BibTeX
Volume 22, Number 2, February 1999
Erica Melis
,
Jon Whittle
: Analogy in Inductive Theorem Proving. 117-147
BibTeX
A. K. Shiny
,
Arun K. Pujari
: An Efficient Algorithm to Generate Prime Implicants. 149-170
BibTeX
William E. Aitken
,
Robert L. Constable
,
Judith L. Underwood
: Metalogical Frameworks II: Developing a Reflected Decision Procedure. 171-221
BibTeX
Volume 22, Number 3, March 1999
Leon Lukaszewicz
: Triple Dots in a Formal Language. 223-239
BibTeX
Gilles Pesant
,
Michel Boyer
: Reasoning about Solids Using Constraint Logic Programming. 241-262
BibTeX
Ofer Arieli
,
Arnon Avron
: A Model-Theoretic Approach for Recovering Consistent Data from Inconsistent Knowledge Bases. 263-309
BibTeX
Johan G. F. Belinfante
: Computer Proofs in Gödel's Class Theory with Equational Definitions for Composite and Cross. 311-339
BibTeX
Johan G. F. Belinfante
: On Computer-Assisted Proofs in Ordinal Number Theory. 341-378
BibTeX
Volume 22, Number 4, May 1999
Renate A. Schmidt
: Decidability by Resolution for Propositional Modal Logics. 379-396
BibTeX
Christian B. Suttner
: SPS-Parallelism + SETHEO = SPTHEO. 397-431
BibTeX
Andrea Formisano
,
Alberto Policriti
: T-Resolution: Refinements and Model Elimination. 433-483
BibTeX
Copyright ©
Sun May 17 00:06:23 2009 by
Michael Ley
(
ley@uni-trier.de
)