Conferences in DBLP

First Order Theorem Proving (FTP) (ftp)
1998 (conf/ftp/1998)

1. Gilles Dowek
   Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:1-22 [Conf]
   
2. Melvin Fitting
   Higher-Order Modal Logic - A Sketch. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:23-38 [Conf]
   
3. Deepak Kapur, G. Sivakumar
   Proving Associative-Communicative Termination Using RPO-Compatible Orderings. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:39-61 [Conf]
   
4. Alexander Leitsch
   Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:62-79 [Conf]
   
5. David A. Plaisted, Yunshan Zhu
   Replacement Rules with Definition Detection. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:80-94 [Conf]
   
6. Thierry Boy de la Tour
   On the Complexity of Finite Sorted Algebras. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:95-108 [Conf]
   
7. Domenico Cantone, Marianna Nicolosi Asmundo
   A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:109-125 [Conf]
   
8. Domenico Cantone, Calogero G. Zarba
   A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:126-136 [Conf]
   
9. Ingo Dahn
   Interpretation of a Mizar-Like Logic in First-Order Logic. [Citation Graph (0, 0)][DBLP]
   FTP (LNCS Selection), 1998, pp:137-151 [Conf]
   
10. Stéphane Demri, Rajeev Goré
    An O ((n·log n)³)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:152-166 [Conf]
    
11. Christian G. Fermüller
    Implicational Completeness of Signed Resolution. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:167-174 [Conf]
    
12. Andrea Formisano, Eugenio G. Omodeo
    An Equational Re-engineering of Set Theories. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:175-190 [Conf]
    
13. Ullrich Hustadt, Renate A. Schmidt
    Issues of Decidability for Description Logics in the Framework of Resolution. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:191-205 [Conf]
    
14. Reinhard Pichler
    Extending Decidable Clause Classes via Constraints. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:206-220 [Conf]
    
15. Reinhard Pichler
    Completeness and Redundancy in Constrained Clause Logic. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:221-235 [Conf]
    
16. Aida Pliuskeviciene
    Effective Properties of Some First-Order Intuitionistic Modal Logics. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:236-250 [Conf]
    
17. Grigore Rosu, Joseph A. Goguen
    Hidden Congruent Deduction. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:251-266 [Conf]
    
18. Viorica Sofronie-Stokkermans
    Resolution-Based Theorem Proving for SH_n-Logics. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:267-281 [Conf]
    
19. Claus-Peter Wirth
    Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized delta-Rule but without Skolemization. [Citation Graph (0, 0)][DBLP]
    FTP (LNCS Selection), 1998, pp:282-297 [Conf]