Automated Deduction in Classical and Non-Classical Logics: Selected Papers

by Ricardo Caferra (Editor), Gernot Salzer (Editor)

Overview

This volume presents a collection of thoroughly reviewed revised full papers on automated deduction in classical, modal, and many-valued logics, with an emphasis on first-order theories.
Five invited papers by prominent researchers give a consolidated view of the recent developments in first-order theorem proving. The 14 research papers presented went through a twofold selection process and were first presented at the International Workshop on First-Order Theorem Proving, FTP'98, held in Vienna, Austria, in November 1998. The contributed papers reflect the current status in research in the area; most of the results presented rely on resolution or tableaux methods, with a few exceptions choosing the equational paradigm.

Product Details

ISBN-13:	9783540671909
Publisher:	Springer Berlin Heidelberg
Publication date:	03/15/2000
Series:	Lecture Notes in Computer Science , #1761
Edition description:	2000
Pages:	304
Product dimensions:	6.10(w) x 9.25(h) x 0.03(d)

Table of Contents

Invited Papers.- Automated Theorem Proving in First-Order Logic Modulo: On the Difference between Type Theory and Set Theory.- Higher-Order Modal Logic—A Sketch.- Proving Associative-Commutative Termination Using RPO-Compatible Orderings.- Decision Procedures and Model Building or How to Improve Logical Information in Automated Deduction.- Replacement Rules with Definition Detection.- Contributed Papers.- On the Complexity of Finite Sorted Algebras.- A Further and Effective Liberalization of the—-Rule in Free Variable Semantic Tableaux.- A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory.- Interpretation of a Mizar-Like Logic in First Order Logic.- An ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic.- Implicational Completeness of Signed Resolution.- An Equational Re-engineering of Set Theories.- Issues of Decidability for Description Logics in the Framework of Resolution.- Extending DecidableClause Classes via Constraints.- Completeness and Redundancy in Constrained Clause Logic.- Effective Properties of Some First Order Intuitionistic Modal Logics.- Hidden Congruent Deduction.- Resolution-Based Theorem Proving for SH n-Logics.- Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized—-Rule but Without Skolemization.