ISBN: 3-540-67190-0
TITLE: Automated Deduction in Classical and Non-Classical Logics
AUTHOR: Caferra, Ricardo; Salzer, Gernot (Eds.)
TOC:

Invited Papers
Automated Theorem Proving in First-Order Logic Modulo:
On the Difference between Type Theory and Set Theory 1
Gilles Dowek (INRIA-Rocquencourt)
Higher-Order Modal Logic-A Sketch 23
Melvin Fitting (Lehman College, CUNY)
Proving Associative-Commutative Termination Using RPO-Compatible Orderings 39
Deepak Kapur (University of New Mexico), G. Sivakumar (Indian Institute of Technology)
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction 62
Alexander Leitsch (Technische Universitt Wien)
Replacement Rules with Definition Detection 80
David A. Plaisted (University of North Carolina at Chapel Hill), Yunshan Zhu (University of North Carolina at Chapel Hill)
Contributed Papers
On the Comlexity of Finite Sorted Algebras 95
Thierry Boy de la Tour (LEIBNIZ-IMAG, CNRS)
A Further and Effective Liberalization of the delta-Rule in Free Variable Semantic Tableaux 109
Domenico Cantone (Universit di Catania), Marianna Nicolosi Asmundo (Universit di Catania)
A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory. 126
Domenico Cantone (Universit di Catania), Calogero G. Zarba (Stanford University)
Interpretation of a Mizar-Like Logic in First-Order Logic 137
Ingo Dahn (University of Koblenz-Landau)
An O((nlog n)^3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic 152
Stphane Demri (LEIBNIZ-CNRS), Rajeev Gor (Australian National University)
Implicational Completeness of Signed Resolution 167
Christian G. Fermller (Technische Universitt Wien)
An Equational Re-engineering of Set Theories 175
Andrea Formisano (University "La Sapienza" of Rome), Eugenio Omodeo (University of L'Aquila)
Issues of Decidability for Description Logics in the Framework of Resolution 191
Ullrich Hustadt (Manchester Metropolitan University), Renate A. Schmidt (Manchester Metropolitan University)
Extending Decidable Clause Classes via Constraints 206
Reinhard Pichler (Technische Universitt Wien)
Completeness and Redundancy in Constrained Clause Logic 221
Reinhard Pichler (Technische Universitt Wien)
Effective Properties of Some First-Order Intuitionistic Modal Logics 236
Aida Pliukeviciene (Vilnius Institute of Mathematics and Informatics)
Hidden Congruent Deduction 251
Grigore Rosu (University of California at San Diego), Joseph Goguen (University of California at San Diego)
Resolution-Based Theorem Proving for SH_n-Logics 267
Viorica Sofronie-Stokkermans (Max-Planck-Institut fr Informatik, Saarbrcken)
Full First-Order Sequent and Tableau Calculi with Preservation of Solutions and the Liberalized -Rule but without Skolemization 282
Claus-Peter Wirth (Universitt Dortmund)
Author Index 299
END
