Automated deduction in classical and non-classical logics : selected papers /

Saved in:

Bibliographic Details
Imprint:	Berlin ; New York : Springer, 2000.
Description:	1 online resource (viii, 297 pages) : illustrations.
Language:	English
Series:	Lecture notes in computer science ; 1761. Lecture notes in artificial intelligence Lecture notes in computer science ; 1761. Lecture notes in computer science. Lecture notes in artificial intelligence.
Subject:	Automatic theorem proving. Logic, Symbolic and mathematical. Automatic theorem proving. Logic, Symbolic and mathematical.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11067975

Hidden Bibliographic Details
Other authors / contributors:	Caferra, Ricardo, 1945- Salzer, Gernot, 1963-
ISBN:	9783540465089 3540465081 3540671900 9783540671909
Notes:	Includes bibliographical references and index.
Summary:	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.
Other form:	Print version: Automated deduction in classical and non-classical logics. Berlin ; New York : Springer, 2000 3540671900

Table of Contents:

Automated theorem proving in first-order logic modulo : on the difference between type theory and set theory / Gilles Dowek
Higher-order modal logic--a sketch / Melvin Fitting
Proving associative-commutative termination using RPO-compatible orderings / Deepak Kapur, G. Sivakumar
Decision procedures and model building, or how to improve logical information in automated deduction / Alexander Leitsch
Replacement rules with definition detection / David A. Plaisted, Yunshan Zhu
On the comlexity [sic] of finite sorted algebras / Thierry Boy de la Tour
A further and effective liberalization of the [delta]-rule in free variable sematic tableaux / Domenico Cantone, Marianna Nicolosi Asmundo
A new fast tableau-based decision procedure for an unquantified fragment of set theory / Domenico Cantone, Calogero G. Zarba
Interpretation of a Mizar-like logic in first-order logic / Ingo Dahn
An O((n·log n)³)-time transformation from Grz into decidable fragments of classical first-order logic / Stéphane Demri, Rajeev Goré
Implicational completeness of signed resolution / Christian G. Fermüller
An equational re-engineering of set theories / Andrea Fromisano, Eugenio Omodeo
Issues of decidability for description logics in the framework of resolution / Ullrich Hustadt, Renate A. Schmidt
Extending decidable clause classes via constraints / Reinhard Pichler
Completeness and redundancy in constrained clause logic / Reinhard Pichler
Effective properties of some first-order intuitionistic modal logics / Aida Pliuškevičienė
Hidden congruent deduction / Grigore Roșu, Joseph Goguen
Resolution-based theorem proving for SH[subscript n]-logics / Viorica Sofronie-Stokkermans
Full first-order sequent and tableau calculi with preservation of solutions and the liberalized [delta]-rule but without skolemization / Claus-Peter Wirth.

Automated deduction in classical and non-classical logics : selected papers /

Similar Items