Skip to main content
SpringerLink
Log in

Automated Deduction in Classical and Non-Classical Logics

Selected Papers

  • Conference proceedings
  • © 2000

Overview

Editors:
  1. Ricardo Caferra

    1. Leibniz-IMAG, Grenoble cedex, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gernot Salzer

    1. Technical University of Vienna, Vienna, Austria

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1761)

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

Included in the following conference series:

Conference proceedings info: FTP 1998.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Pages I-VIII
    Download chapter PDF

  3. Contributed Papers

    1. On the Complexity of Finite Sorted Algebras

      • Thierry Boy de la Tour
      Pages 95-108

    2. A Further and Effective Liberalization of the δ-Rule in Free Variable Semantic Tableaux

      • Domenico Cantone, Marianna Nicolosi Asmundo
      Pages 109-125

    3. A New Fast Tableau-Based Decision Procedure for an Unquantified Fragment of Set Theory

      • Domenico Cantone, Calogero G. Zarba
      Pages 126-136

    4. Interpretation of a Mizar-Like Logic in First Order Logic

      • Ingo Dahn
      Pages 137-151

    5. An \( \mathcal{O} \) ((n · log n)3)-Time Transformation from Grz into Decidable Fragments of Classical First-Order Logic

      • Stéphane Demri, Rajeev Goré
      Pages 152-166

    6. Implicational Completeness of Signed Resolution

      • Christian G. Fermüller
      Pages 167-174

    7. An Equational Re-engineering of Set Theories

      • Andrea Formisano, Eugenio Omodeo
      Pages 175-190

    8. Issues of Decidability for Description Logics in the Framework of Resolution

      • Ullrich Hustadt, Renate A. Schmidt
      Pages 191-205

    9. Extending Decidable Clause Classes via Constraints

      • Reinhard Pichler
      Pages 206-220

    10. Completeness and Redundancy in Constrained Clause Logic

      • Reinhard Pichler
      Pages 221-235

    11. Effective Properties of Some First Order Intuitionistic Modal Logics

      • Aida Pliuškevičienė
      Pages 236-250

    12. Hidden Congruent Deduction

      • Grigore Roşu, Joseph Goguen
      Pages 251-266

    13. Resolution-Based Theorem Proving for SH n-Logics

      • Viorica Sofronie-Stokkermans
      Pages 267-281

    14. Full First-Order Sequent and Tableau Calculi With Preservation of Solutions and the Liberalized δ-Rule but Without Skolemization

      • Claus-Peter Wirth
      Pages 282-297
Back to top

Other volumes

  1. Automated Deduction in Classical and Non-Classical Logics

Keywords

Editors and Affiliations

  • Leibniz-IMAG, Grenoble cedex, France

    Ricardo Caferra

  • Technical University of Vienna, Vienna, Austria

    Gernot Salzer

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation