@inproceedings{Dowek98FTP,
	crossref="FTP98",
	title="Automated theorem proving in first-order logic modulo:
               on the difference between type theory and set theory",
	author="Dowek, Gilles",
	pages="1--21"
}

@inproceedings{Fitting98FTP,
	crossref="FTP98",
	title="Higher-order modal logic -- a sketch",
	author="Fitting, Melvin",
	pages="22--36"
}

@inproceedings{Fitting98AISC,
	title="{Bertrand} {Russell}, {Herbrand}'s theorem, and the assignment
               statement",
        booktitle="Artificial Intelligence and Symbolic Computation",
	author="Fitting, Melvin",
        editor="Calmet, J. and Plaza, J.",
        year=1998,
        series="LNCS 1476 (LNAI)",
        publisher="Springer Verlag"
}

@inproceedings{Leitsch98FTP,
	crossref="FTP98",
	title="Decision procedures and model building,
               or How to improve logical information in {ATP}",
	author="Leitsch, Alexander",
	pages="50--64"
}

@inproceedings{ArmandoRanise98FTP,
	crossref="FTP98",
	title="Constraint contextual rewriting",
	author="Armando, Alessandro and Ranise, Silvio",
	pages="65--75"
}

@inproceedings{BoyDeLaTour98FTP,
	crossref="FTP98",
	title="How complex is a finite first-order sorted interpretation?",
	author="Boy de la Tour, Thierry",
	pages="76--85"
}

@inproceedings{CantoneNicolosi98FTP,
	crossref="FTP98",
	title="A further and effective liberalization of the $\delta$-rule in
               free variable semantic tableaux",
	author="Cantone, Domenico and Nicolosi Asmundo, Marianna",
	pages="86--96"
}

@inproceedings{CantoneZarba98FTP,
	crossref="FTP98",
	title="A new fast tableau-based decision procedure for an unquantified
               fragment of set theory",
	author="Cantone, Domenico and Zarba, Calogero G.",
	pages="97--105"
}

@inproceedings{ChandruEtAl98FTP,
	crossref="FTP98",
	title="A partial instantiation based first order theorem prover",
	author="Chandru, Vijay and Hooker, John and Rago, Gabriela
                and Shrivastava, Anjul",
	pages="106--115"
}

@inproceedings{Dahn98FTP,
	crossref="FTP98",
	title="Interpretation of a {Mizar}-like logic in first-order logic",
	author="Dahn, Ingo",
	pages="116--126"
}

@inproceedings{DemriGore98FTP,
	crossref="FTP98",
	title="An {${\cal O}((n\cdot\log n)^3)$}-time transformation from {Grz}
               into decidable fragments of classical first-order logic",
	author="Demri, Stephane and Gore, Rajeev",
	pages="127--134"
}

@inproceedings{Fermueller98FTP,
	crossref="FTP98",
	title="Implicational completeness of signed resolution",
	author="Ferm{\"u}ller, Christian G.",
	pages="135--141"
}

@inproceedings{FormisanoOmodeo98FTP,
	crossref="FTP98",
	title="An equational re-engineering of set theories",
	author="Formisano, Andrea and Omodeo, Eugenio",
	pages="142--151"
}

@inproceedings{HustadtSchmidt98FTP,
	crossref="FTP98",
	title="Issues of decidability for description logics in the framework
               of resolution",
	author="Hustadt, Ullrich and Schmidt, Renate A.",
	pages="152--161"
}

@inproceedings{Konev98FTP,
	crossref="FTP98",
	title="Upper bound on the height of terms in proofs with cuts",
	author="Konev, Boris",
	pages="162--171"
}

@inproceedings{Peltier98FTP,
	crossref="FTP98",
	title="Proof generalization and function introduction",
	author="Peltier, Nicolas",
	pages="172--181"
}

@inproceedings{Pichler98FTPa,
	crossref="FTP98",
	title="Extending decidable clause classes via constraints",
	author="Pichler, Reinhard",
	pages="182--192"
}

@inproceedings{Pichler98FTPb,
	crossref="FTP98",
	title="Completeness and redundancy in constrained clause logic",
	author="Pichler, Reinhard",
	pages="193--203"
}

@inproceedings{Pliuskeviciene98FTP,
	crossref="FTP98",
	title="Effective properties for some first order intuitionistic
               modal logics",
	author="Pliu\v{s}kevi\v{c}ien\.e, Aida",
	pages="204--212"
}

@inproceedings{RosuGoguen98FTP,
	crossref="FTP98",
	title="Hidden congruent deduction",
	author="Rosu, Grigore and Goguen, Joseph",
	pages="213--223"
}

@inproceedings{Sofronie98FTP,
	crossref="FTP98",
	title="Resolution-based theorem proving for {$SHn$}-logics",
	author="Sofronie-Stokkermans, Viorica",
	pages="224--233"
}

@inproceedings{Wagner98FTP,
	crossref="FTP98",
	title="A new resolution calculus for the infinite-valued propositional
               logic of {{\L}ukasiewicz}",
	author="Wagner, Hubert",
	pages="234--243"
}

@inproceedings{Wirth98FTP,
	crossref="FTP98",
	title="Full first-order sequent and tableau calculi with preservation of
               solutions and the liberalized $\delta$-rule but without
               skolemization",
	author="Wirth, Claus-Peter",
	pages="244--255"
}

@inproceedings{Bonacina98FTP,
	crossref="FTP98",
	title="Theorem proving strategies: a search oriented taxonomy",
	author="Bonacina, Maria Paola",
	pages="256--259"
}

@inproceedings{Matzinger98FTP,
	crossref="FTP98",
	title="Computational representations of models of first-order formulas",
	author="Matzinger, Robert",
	pages="260--261"
}

@inproceedings{Zinn98FTP,
	crossref="FTP98",
	title="Verifying textbook proofs",
	author="Zinn, Claus",
	pages="262--264"
}

@proceedings{FTP98,
	editor={Caferra, Ricardo and Salzer, Gernot},
	title={Int. Workshop on First-Order Theorem Proving (FTP'98)},
	booktitle={Int. Workshop on First-Order Theorem Proving (FTP'98)},
	year={1998},
        series={Technical Report E1852-GS-981},
	organization={{Technische} {Universit\"at} {Wien}, {Austria}},
	note={Electronically available from {\tt http://www.logic.at/ftp98}}
}